Problem:


Score : 100 points

Problem Statement

A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.

Find the total number of biscuits produced within T + 0.5 seconds after activation.

Constraints

All values in input are integers.

1 \leq A, B, T \leq 20

Input

Input is given from Standard Input in the following format:

A B T

Output

Print the total number of biscuits produced within T + 0.5 seconds after activation.

Sample Input 1

3 5 7

Sample Output 1

10

Five biscuits will be produced three seconds after activation.

Another five biscuits will be produced six seconds after activation.

Thus, a total of ten biscuits will be produced within 7.5 seconds after activation.

Sample Input 2

3 2 9

Sample Output 2

6

Sample Input 3

20 20 19

Sample Output 3

0



Sample input:
3 5 7


Sample output:
10

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

ans = int((T + 0.5) // A) * B

print(ans)

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())
# print(a, b, t)

time = 0
count = 0
while time < t + 0.5:
    if time % a == 0:
        count += b
    time += 1
print(count - b)

Submission status: Accepted

Solution code:
i = list(map(int, input().split())) 

A = i[0]
B = i[1]
T = i[2]

timeElapsed = 0
limit = T + 0.5
biscuitCount = 0 #ビスケットの生成回数（A秒後、2A秒後…毎インクリメントする）

for i in range(1, T+1):
    if(A*i <= limit):
        biscuitCount+=1
    else:
        break

print(biscuitCount * B)

Submission status: Accepted

Solution code:
a,b,t = (int(i) for i in input().split())
print(t//a*b)

Submission status: Accepted

Solution code:
a, b, t = list(map(int, input().split()))
print(t // a * b)

Submission status: Accepted

Solution code:
A, B, T = list(map(int, input().split(' ')))
print(int((T + 0.5) / A) * B)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
T = float(T) + 0.5
print(int(T / A) * B)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if(c<a):
    print('0')
else:
    print((c//a)*b)

Submission status: Accepted

Solution code:
[a,b,c]=map(int,raw_input().split())
print c//a*b

Submission status: Accepted

Solution code:
import math

a, b, c = input().split()
a, b, c = int(a), int(b), int(c)


d = math.floor(c/a) 
print(b*d)

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
print(int((T//A)*B))

Submission status: Accepted

Solution code:
import math

def main():
    A, B, T = list(map(int, input().strip().split(' ')))
    print(math.floor(T/A) * B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

print(int(t / a) * b)

Submission status: Accepted

Solution code:
A, B, T = (int(x) for x in input().split())
 
print((T//A)*B)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

print(b * int((t + 0.5) / a))

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

def biscuit_gen(A,B,T):
    total = 0
    num = int(T//A)
    return B*num

n = biscuit_gen(A,B,T)
print(n)

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))
print(c//a * b)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

M = (T+0.5)//A * B
print(int(M))

Submission status: Accepted

Solution code:
import math
inp = input()
inp = inp.split()
inp = list(map(int, inp))
a = inp[0]
b = inp[1]
t = inp[2]
ans = math.floor(t/a)*b
print(ans)

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())
ans = t // a * b
print(ans)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())

print((T//A)*B)

Submission status: Accepted

Solution code:
import math

def sub():
    A, B, T = [int(e) for e in input().split(" ")]
    k = math.floor(math.floor(T) / A)
    print("{}".format(int(k) * B))

sub()

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())

q=(t+0.5)/a

f=int(q)*b
print(int(f))

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
time=(T+0.5)//A
S=int(B*time)
print(S)

Submission status: Accepted

Solution code:


def problem():
    A, B, T = map(int, input().split())
    print(algorithm(A, B, T))


def algorithm(A: int, B: int, T: int):
    x = int((T + 0.5) / A)
    return x*B



problem()

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int(((T + 0.5) // A) * B))

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
B= (A[2]+0.5) // A[0]
C= int(A[1]*B)
print(C)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int(T/A) * B)

Submission status: Accepted

Solution code:
A,B,T=map(int, input().split())
print(int(T/A)*B)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

ans = T // A * B
print(ans)

Submission status: Accepted

Solution code:
abt = list(map(int,input().split()))

a = abt[0]
b = abt[1]
t = abt[2]

t05 = t + 0.5
times = t05 // a

total = b * times

print(str(int(total)))

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int((T + 0.5)//A * B))

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

t = float(T) + 0.5

print(int(t/A) * B)

Submission status: Accepted

Solution code:
a,b,t = list(map(int,input().split()))
print(t//a * b)

Submission status: Accepted

Solution code:
from functools import reduce
A, B, T = map(int, input().split())
print(int((T + 0.5) // A * B))

Submission status: Accepted

Solution code:
args = input()
args = args.split(' ')

a = int(args[0])
b = int(args[1])
t = int(args[2]) + 0.5 - a

r = 0

while t > 0:
    r += b
    t -= a

print(r)

Submission status: Accepted

Solution code:
inputs = list(map(int, input().split()))
A, B, T = inputs

print(T // A * B)

Submission status: Accepted

Solution code:
A,B,T = (int(x) for x in input().split())
print(B*(T//A))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

a = l[0]
b = l[1]
t = l[2]

#print(a,b,t)

seisan = 0

for i in range(1,t+1):
	#print(i)
	if i%a == 0:
		#生産
		seisan += b

print(seisan)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

print(b * ( int(t + 0.5) // a) )

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
reward=0
time=0

for t in range(T):
    time += 1
    if time%A == 0:
        reward = reward + B
        
print(reward)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
print("{}".format(T//A*B))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

time = 0
biscuit = 0

time +=  a
while time < t + 0.5 :
    biscuit += b
    time += a

print(biscuit)

Submission status: Accepted

Solution code:
a, b, t = map( int, input().split() )
print(b*(t//a))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, T: int):
    print(T // A * B)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, B, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
# S.input() -> ["1","2","3"]
# int("1") -> 1
# map(int,["1","2","3"]) -> [1,2,3]
[A,B,T] = map(int,S.split())

print(T // A * B)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split());print(int(t//a*b))

Submission status: Accepted

Solution code:
n = input()
args = n.split()

a = int(args[0])
b = int(args[1])
t = int(args[2])

c = int(t / a)

print(c * b)

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())
print(t//a * b)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

# A, 2A, 3A,...とT+0.5より大きくなるまで増やしていき、その間に得られたビスケットの枚数を数える

ans = 0 # 得られたビスケットの総数
cnt = 1 # Aの係数

while cnt * A <= T + 0.5:
    ans += B
    cnt += 1

print(ans)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
ans = b * int(t / a)
print(ans)

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
biscuit = 0
for i in range(1,T+1):
    if (biscuit//B+1)*A==i:
        biscuit = biscuit + B

print(biscuit)

Submission status: Accepted

Solution code:
A, B, T = (int(x) for x in input().split())
print(int(T/A)*B)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())


print( int((T+0.5)//A*B) )

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
x = int((t+0.5) // a)
print(x*b)

Submission status: Accepted

Solution code:
SUM_COOKIE = 0
A, B, T = map(int, input().split())
SUM_COOKIE = T//A * B
print(SUM_COOKIE)

Submission status: Accepted

Solution code:
A,B,T  = map(int, input().split())
 
print(int(T/A)*B)

Submission status: Accepted

Solution code:
def Biscuit():
	A,B,T=map(int,input().split())
	print(B*int((T+0.5)//A))

Biscuit()

Submission status: Accepted

Solution code:

l = list(map(int, input().split(' ')))

print(int(((l[2] + 0.5) // l[0]) * l[1]))

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-
A, B, T = map(int, input().split())

print(B * (T // A))

Submission status: Accepted

Solution code:
import sys

def LI(): return [int(x) for x in sys.stdin.readline().split()]

A, B, T = LI()

print((T//A) * B)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
print(b*int(t//a))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
result = 0
for i in range(1 , c + 1):
    if i % a == 0:
        result += b
print(result)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
time=0
k=1
time=(t+0.5)//a
print(int(b*time))

Submission status: Accepted

Solution code:
import sys

A, B, T = map(int, input().split())

i = 0
while True:
    if (i*A > T+0.5):
        break
    else:
        i += 1

print(B*(i-1))

Submission status: Accepted

Solution code:
# Coding: Utf-8

A,B,T=map(int, input().split())
count=0
for i in range(1,T+1):
    if i%A==0:
        count=count+B
print(count)

Submission status: Accepted

Solution code:
A ,B ,T = map(int, input().split()) 
print((T//A)*B)

Submission status: Accepted

Solution code:
first = input()
(sA, sB, sC) = first.split()
A = int(sA)
B = int(sB)
C = int(sC)
D = C//A
E = B*D
print(E)

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 125
# A - Biscuit Generator

'''
Result: All Correct
Score: 100
Code length: 91 Byte
Execution Time: 17 ms
Memory usage: 2940 KB
'''

hoge = input()
a, b, t = [int(x) for x in hoge.split(' ')]
print(int(((t+0.5)//a)*b))

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split(" "))


print((t//a)*b)

Submission status: Accepted

Solution code:
A,B,T = map(int, input().split())
ans = ((T+0.5)//A)*B
ans = int(ans)
print(ans)

Submission status: Accepted

Solution code:
a,b,t = list(map(int, input().split()))

t = int(t+0.5)

x = int(t/a)

print(x*b)

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
print(int((0.5+T)//A)*B)

Submission status: Accepted

Solution code:
a,b,t=map(int, input().split())
t=t+0.5
num_b = int(t/a)
print(num_b*b)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
a = int(c/a)
b = b*a
print(b)

Submission status: Accepted

Solution code:
a, b, t = (int(x) for x in input().split())
print(t // a * b)

Submission status: Accepted

Solution code:
 
a, b, t = [int(x) for x in input().split()]

rest = t
biscuit = 0
plustime = 1

while rest >= a * plustime:
    biscuit = biscuit + b
    plustime += 1

print(biscuit)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

count = int(t//a)
ans = count * b
print(ans)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
ans = 0

for i in range(1, t+1):
    if i % a == 0:
        ans += b

print(ans)

Submission status: Accepted

Solution code:
In=map(int,raw_input().split())

A=int(In[0])
B=int(In[1])
T=int(In[2])

count=0

t=int((T+0.5)/A)
count=B*t

print count

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int(B * (T//A)))

Submission status: Accepted

Solution code:
def main():
    a, b, t = [int(i) for i in input().split()]
    print(t//a*b)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
print(T//A * B)

Submission status: Accepted

Solution code:
A,B,T=input().split()
A=int(A)
B=int(B)
T=int(T)
print(T//A*B)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
T += 0.5
print(int(T // A * B))

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
Y=T//A
X=Y*B
print(X)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print((C//A) * B)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(int((c//a)*b))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

a = l[1] * int((l[2]+0.5)/l[0])
print(a)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

x = (t + 0.5) // a
print(int(b * x))

Submission status: Accepted

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
print(T//A*B)

Submission status: Accepted

Solution code:
a, b , c = map(int,input ().split())
time = 0
bis = 0
while c > time:
  time += 1

  if time % a == 0:
    bis = b + bis
    
print(bis)

Submission status: Accepted

Solution code:
A , B , T  = map(int ,input().split())
ans = (int((T+0.5)/A))*B
print (ans)

Submission status: Accepted

Solution code:
A , B , T = map(int , input().split())
 
count =  T // A * B
 
print(count)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
for i in range(200):
    if A * i < (T + 0.5):
        continue
    else:
        print(B * (i - 1))
        break

Submission status: Accepted

Solution code:
a,b,c = map(int, input().strip().split())

print((c//a)*b)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int(((T+0.5)//A*B)))

Submission status: Accepted

Solution code:
import math
a,b,t = map(int, input().split())
print(math.floor( t/ a) * b)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    A, B, T = [int(x) for x in stdin.readline().rstrip().split()]
    print(T // A * B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding:UTF-8

# 入力値の受け取り
input_list = input().split()

num_A = int(input_list[0])
num_B = int(input_list[1])
num_T = int(input_list[2])

# 合計枚数の算出
output_answer = int((num_T + 0.5) // num_A * num_B)
print(output_answer)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

shou = T // A

print(shou * B)

Submission status: Accepted

Solution code:
str = input().split()
A = int(str[0])
B = int(str[1])
T = int(str[2])

time = T + 0.5
biscuits = (time //   A) * B

print(int(biscuits))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Biscuit Generator
https://atcoder.jp/contests/abc125/tasks/abc125_a

"""
import sys


def solve(A, B, T):
    gen = [t for t in range(1, T+1) if t % A == 0]
    return B * len(gen)


def main(args):
    A, B, T = map(int, input().split())
    ans = solve(A, B, T)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
ans = 0
for i in range(1, 22):
    if A * i <= T + 0.5:
        ans += B
    else:
        print(ans)
        break

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

print( B * ( T // A))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
biscuits = int((t + 0.5) // a * b)
print(biscuits)

Submission status: Accepted

Solution code:
data = input().split()
A = int(data[0])
B = int(data[1])
T = int(data[2]) + 0.5
biscuit = 0
time = A
while time < T:
  biscuit += B
  time += A

print(biscuit)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
t+=0.5
print(int(b*(t//a)))

Submission status: Accepted

Solution code:
#入力
a, b, t = map(int, input().split())

t2 = t + 0.5

print(int(t2//a * b))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
t += 0.5
key = t//a
print(int(key * b))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())

print((t//a)*b)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
S=0
n=0
while T+0.5>S:
  n+=1
  S=n*A
print((n-1)*B)

Submission status: Accepted

Solution code:
A,B,T = input().split(" ")
print(int(int(T)/int(A))*int(B))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().rstrip().split())
print(int(((t + 0.5) // a) * b))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A = list(map(int,input().split()))
print(A[2] // A[0] * A[1])

Submission status: Accepted

Solution code:
import math

A,B,T = map(int, input().split())

maisu = math.floor(T/A) * B

print(maisu)

Submission status: Accepted

Solution code:
A,B,T = map(int, input().split())
sum_visket = 0
count = int(T/A)
for i in range (count):
    sum_visket += B
print(sum_visket)

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())
print((t//a)*b)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
b=0
c=1
while(c*a[0]<(a[2]+0.5)):
  b=b+a[1]
  c=c+1
  
print(b)

Submission status: Accepted

Solution code:
def calculate(a, b, t):
    return int(t / a) * b


if __name__ == "__main__":
    val = [int(x) for x in input().split(" ")]
    print(calculate(val[0], val[1], val[2]))

Submission status: Accepted

Solution code:
A,B,T = map(int, input().split())
C=T+0.5

V=(C//A)*B

print(int(V))

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
print(int(int(T / A) * B))

Submission status: Accepted

Solution code:
[a, b, t] = [int(i) for i in input().split()]

print(t // a * b)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split(" "))
ans = int(t/a)*b
print(ans)

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split(" "))
ans = int(T/A)*B
print(ans)

Submission status: Accepted

Solution code:
src = raw_input()

sp = src.split(" ")

A = int(sp[0])
B = int(sp[1])
T = int(sp[2])
cnt = int(int(T + 0.5) / A )

out = B * cnt
print(out)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
##
## a 秒ごとに b 枚のビスケットを生産する。
## t+0.5 秒後のビスケットの枚数を出力する。
## 

(a, b, t) = [ int(v) for v in input().split() ]
if t > 20: raise("limit over")
biscuit = int(((t + 0.5) // a) * b)
print(biscuit)

Submission status: Accepted

Solution code:
def solve():
    A, B, T = map(int, input().split())
    
    print ((T//A) * B)
    
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
ans = (t // a) * b
print(ans)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

print(T // A * B)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
c=(t+0.5)/a
c=int(c)
d=b*c
print(d)

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())
res = t // a
print(res * b)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
bis = t // a
print(bis * b)

Submission status: Accepted

Solution code:
def getlist():
	return list(map(int, input().split()))

A, B, T = getlist()
print(B * (int((T + 0.5) // A)))

Submission status: Accepted

Solution code:
minit, value, time = map(int, input().split())
print((time//minit)*value)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
print(int(t/a)* b)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
num = t / a
print(int(num) * b)

Submission status: Accepted

Solution code:
J=list(map(int,input().split()))
I=(J[2]+0.5)//J[0]*J[1]
print(int(I))

Submission status: Accepted

Solution code:
import sys
import math 
ni = lambda: int(ns())
na = lambda: list(map(int, input().split()))
ns = lambda: input()

A,B,T = na()

n = T//A

print(B*n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
input = sys.stdin.readline

def io_generator():
	return input()

#+++++++++++++++++++

def main(io):
	a,b,t= map(int, io().split())
	return (t // a)*b

#++++++++++++++++++++

if __name__ == "__main__":
	io= lambda : io_generator()
	print (main(io))

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
C = (T + 0.5) // A
D = C * B 
print(str(int(D)))

Submission status: Accepted

Solution code:
import math
s = input().split()

A=int(s[0])
B=int(s[1])
C=int(s[2])

tmp=C/A
answer = math.floor(tmp) *B
print(answer)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
tmp = (t+0.5)//a
print(int(b*tmp))

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
A = i[0]
B = i[1]
T = i[2]

print(int((T+0.5)/A)*B)

Submission status: Accepted

Solution code:
abt = input()
abt = list(map(int, abt.split(" ")))
output = (abt[2] + 0.5 ) //  abt[0] * abt[1]
print(int(output))

Submission status: Accepted

Solution code:
abt = input()
abt = list(map(int, abt.split(" ")))
output = (abt[2] + 0.5 ) //  abt[0] * abt[1]
print(int(output))

Submission status: Accepted

Solution code:
hoge = input()

a, b, t = [int(x) for x in hoge.split(' ')]

print(int(((t+0.5)//a)*b))

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
a =T//A
number = 0
for i in range(a):
  b=1
  s = a-b
  if s >=0:
    number+=1
  b+=1
print(number*B)

Submission status: Accepted

Solution code:
[A, B, T] = map(int, raw_input().split())
biscuits = B * (T / A)
print biscuits

Submission status: Accepted

Solution code:
[A, B, T] = map(int, raw_input().split())
biscuits = 0
time = 0
while time < (T + 0.5 - A):
  biscuits = biscuits + B
  time = time + A
print biscuits

Submission status: Accepted

Solution code:
biscuit_data = list(map(int,input().split()))
biscuit_data[2] += 0.5
biscuit_num = 0
while(biscuit_data[2]-biscuit_data[0]>0):
    biscuit_num += biscuit_data[1]
    biscuit_data[2] -= biscuit_data[0]

print(biscuit_num)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
print(int((t + 0.5) / a) * b)

Submission status: Accepted

Solution code:
'''input
20 20 19
'''

a, b, t=map(int, input().split())

print(int(b*((t+0.5)//a)))

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
print(int((T+0.5)/A)*B)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

N = 1
for i in range(100):
    if N * A > T + 0.5:
        N -= 1
        break

    N += 1

ret = N * B
print(ret)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

print(int((T+0.5)/A)*B)

Submission status: Accepted

Solution code:
A,B,T=[int(it) for it in input().split()]
print ( T//A * B )

Submission status: Accepted

Solution code:
A, B, T = list(map(int,input().split()))
T+=0.5
out = T // A * B
print(int(out))

Submission status: Accepted

Solution code:
[a,b,t]=map(int,input().split())
k=int(t/a)
print(k*b)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
time = int(t/a)
print(time*b)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
n = (t//a)*b
print(int(n))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
print((l[2] // l[0]) * l[1], "")

Submission status: Accepted

Solution code:
#coding:utf-8
a,b,t =map(int,input().split())
x = t // a
print(b*x)

Submission status: Accepted

Solution code:
a, b, t = (int(i) for i in input().split())

print((t//a)*b)

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
ans = 0

for i in range(1,T+1):
    if i % A == 0:
        ans += B

print(ans)

Submission status: Accepted

Solution code:
interval, volume, endtime = (map(int, input().split()))
makes = int(endtime / interval)

print(makes * volume)

Submission status: Accepted

Solution code:
a, b, t = [int(x) for x in input().split()]
biscuit = (t // a) * b
print(biscuit)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
t=T+0.5
ans=t//A*B
print(int(ans))

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
print(T//A * B)

Submission status: Accepted

Solution code:
A,B,T =(int(x) for x in input().split())
count=0
T+=0.5

while(True):
    if (A>T):
        break
    else:
        count+=B
        T=T-A
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(c // a  * b)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
print(int(((t+0.5) // a)*b))

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
z = t // a
print(b * z)

Submission status: Accepted

Solution code:
n = input().split()
A = int(n[0])
B = int(n[1])
T = int(n[2])

print(T//A  * B)

Submission status: Accepted

Solution code:
N = input().split()

A = int(N[0])
B = int(N[1])
T = int(N[2])

count = T // A
 # T / A だと小数点まで求めてしまうため、この問題では使いにくい。
 # //を使うことで小数点以下を切り捨てることができる

ans = count * B

if ans == 0:
    print("0")
else:
    print(ans)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

answer =  (T // A) * B

print(answer)

Submission status: Accepted

Solution code:
tmp = raw_input().split()
A = int(tmp[0])
B = int(tmp[1])
T = int(tmp[2])
print(int(((T+0.5)//A)*B))

Submission status: Accepted

Solution code:
def main():
    a, b, t = map(int, input().split())
    print(t // a * b)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,t = map(int, input().split())

times = t // a

print(b * times)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split(" "))

ans=((T+0.5)//A)*B
print(int(ans))

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
ans = 0
for i in range(1, int(T/A) + 1):
    ans += B
print(ans)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split(" "))
ans=T//A*B
print(ans)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split(" "))

n=(T//A)

print(n*B)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split(" "))

ans=((T+0.5)//A)*B
print(int(ans))

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split(" "))

print(int(((t+0.5)//a)*b))

Submission status: Accepted

Solution code:
A,B,T = (int(i) for i in input().split())

time = A
cookies = 0

mult = 1

while time < T+0.5:
    
    cookies += B
    
    mult += 1
    time = mult*A

print(cookies)

Submission status: Accepted

Solution code:

def get_next_ints(delim=" "):
    return tuple([int(float(x)) for x in input().split(delim)])

def main():
    a, b, t = get_next_ints()
    
    n = t // a
    print(n * b)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,t = (int(num) for num in input().split())
print((t//a)*b)

Submission status: Accepted

Solution code:
l = raw_input().split()
a = int(l[0])
b = int(l[1])
t = int(l[2])
i = 1
sum = 0

while (i * a) <= t:
    sum += b
    i+=1

print(sum)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
total = 0
for i in range(a, t+1, a):
  total += b
print(total)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
c=(t//a)*b
print(c)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())

i=1
while i*A<T+0.5:
    i+=1

S = B*(i-1)
print(S)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split(" "))

print(T // A * B)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
t = a[2] + 0.5
d = int(t // a[0])
print(d * a[1])

Submission status: Accepted

Solution code:
a=input().split()
t=int(a[2])+0.5
print(int(t//int(a[0])*int(a[1])))

Submission status: Accepted

Solution code:

# coding: utf-8

# In[ ]:

A, B, T = map(int, input().split())


# In[ ]:

#A, B, T = 3, 5, 7


# In[ ]:

print(T//A*B)

Submission status: Accepted

Solution code:
A,B,T = [int(i) for i in input().split()]

c = (T + 0.5 ) // A
print(int(B*c))

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

print(int(b*((c+0.5)//a)))

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
t+=0.5
print(int(t//a*b))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split(" "))
g = 1
c = 0

while a * g <= t:
  c += b
  g += 1

print(c)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split());print(int(t/a)*b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,t = map(int, input().split())
print((t//a)*b)

Submission status: Accepted

Solution code:
A, B, T = [int(_) for _ in input().split()]
print(T // A * B)

Submission status: Accepted

Solution code:
from sys import stdin

def calc(data):
    sum = 0
    current_time = int(data[0])
    counter = 1
    while current_time < int(data[2]) + 0.5:
        sum += int(data[1])
        counter += 1
        current_time = int(data[0]) * counter
    return sum

if __name__ == '__main__':
    input = stdin.readline().rstrip()
    input_array = input.split(" ")
    print calc(input_array)

Submission status: Accepted

Solution code:
A,B,T = map(int ,input().split())
T = T+0.5
print(int(T/A)*B)

Submission status: Accepted

Solution code:
A, B, T=map(int, input().split())
print(T // A * B)

Submission status: Accepted

Solution code:
import math

A,B,T=map(int,input().split())
count=0

count=(T+0.5)//A
print(math.floor(count*B))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-                                                         

A ,B, T = map(int, input().split())
biscuit = B * int((T+0.5)/A)

print(biscuit)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().rstrip().split(' '))

count = 0
bisket = 0

while True:

    count += 1
    if A*count > T+0.5:
        break
    else:
        bisket += B


print(bisket)

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))

answer = (i[2] // i[0]) * i[1]
print(answer)

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
print(int((T-T%A)/A*B))