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:
import sys
def input():
    return sys.stdin.readline()[:-1]


a,b,t = map(int,input().split(' '))
cnt = 0
t += 0.5
T = 0

while True:
    T   += a
    if T>t:
        break
    cnt += b
print(cnt)

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())
init = A
biscuits = 0
while A < T+0.5:
    biscuits += B
    A += init 
print(biscuits)

Submission status: Accepted

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

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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict
import sys,bisect,math,itertools,string,queue
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

a,b,t = inpl()
print(t//a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input().split())
a=int(s[0])
b=int(s[1])
c=int(s[2])

d=int(c/a)
print(b*d)

Submission status: Accepted

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

time = a
num = 0
while time < t+0.5:
    num += b
    time += a
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split(" "))
ans = 0
while (t >= a):
    t -= a
    ans += b
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
while (t >= a):
    t -= a
    ans += b
print(ans)

Submission status: Accepted

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

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:
def main():
    a, b, t = map(int, input().split())

    ans = 0
    cnt = a
    while cnt <= t:
        ans += b
        cnt += a
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

    ans = 0
    for _ in range(a, t + 1, a):
        ans += b
    print(ans)

if __name__ == '__main__':
    main()

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 sys
input = sys.stdin.readline
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:
a, b, t = map(int, input().split())
print(int((t + 0.5) / a) * b)

Submission status: Accepted

Solution code:
A, B, T = list(map(int, input().split()))
sum = 0
time = A
while time <= T + 0.5:
    sum += B
    time += A
print(sum)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
ans=0
t_=1
i=1
while 1:
  if t+0.5<t_:
    print(ans)
    break
  if t_%a==0:
    ans+=b
  i+=1
  t_+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())

ct = a
bis = 0

while t + 0.5 >= ct:
    bis += b
    ct += a

print(bis)

Submission status: Accepted

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

# solution
total = 0
for t in range(1, T+1):
    if t % A == 0:
        total += B

#output
print(total)

Submission status: Accepted

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

past_time = a
ans = 0
while past_time <= t:
    ans += b
    past_time += a

print(ans)

Submission status: Accepted

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

    cnt = 0
    for i in range(1, 100):
        if T + 0.5 >= A * i:
            cnt += 1
        else:
            print(cnt*B)
            exit()

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
for i in range(25):
  if i*a <= t+0.5 < (i+1)*a:
    get = b*i
    print(get)
    break

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

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(B * ((T+0.5)//A)))

Submission status: Accepted

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

t_ans = t+0.5
i = 1
count = 0
while t_ans > a*i:
    count += b
    i += 1
    
print(count)

Submission status: Accepted

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

q = current_time // A

print(int(B * q))

Submission status: Accepted

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

Submission status: Accepted

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

num_prd = T//A
answer = num_prd*B

print(answer)

Submission status: Accepted

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

num_prd = T//A
answer = num_prd*B

if num_prd >= 1 :
	print(answer)
else :
	print(0)

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())
print((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:
source = input().split()
A, B, T = int(source[0]), int(source[1]), int(source[2])
j = 1
biscuit = 0
current = A
while float(current) <= T + 0.5:
    biscuit += B
    j += 1
    current = A * j
print(biscuit)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

def main():
    A,B,T = map(int, input().split())
    n = 0
    for _ in range(A,T+1,A):
        n += B
    print(n)

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    func()

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())

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

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
time = 0
cnt = 0
while time + a < (t + 0.5):
    cnt += b
    time += a
print(cnt)

Submission status: Accepted

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

A,B,T = MAP()
print(T//A*B)

Submission status: Accepted

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

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

print(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 = map(int, input().split())
ans = 0
time = 0
while time + a < t+1:
    ans += b
    time += a
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC125 A
A,B,T = list(map(int, input().split()))
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:
A,B,T = list(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())

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

Submission status: Accepted

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


num = (T + 0.5) // A
print(int(num * 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
print(int(ans))

Submission status: Accepted

Solution code:
# A - Biscuit Generator
A, B, T = map(int,input().split())
ans = 0
for i in range(1, T+1):
    if i % A == 0:
        ans = ans + B
    else:
        pass

print(ans)

Submission status: Accepted

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

limit = t+0.5
time = a
c = 0
while limit >= time:
  time += a
  c += b
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(B * (math.floor(T/A)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Aug 23 13:52:59 2019

@author: gaomi
"""

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

sys.setrecursionlimit(1000000)

def main(): 

    ABT = list(map(int,input().split()))
    print(int(ABT[2]+0.5)//ABT[0]*ABT[1])
    



if __name__ == "__main__":
    main()

Submission status: Accepted

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

    while(1):
        T -= A
        if T < 0 :
            break
        ans += B
    print(ans)
resolve()

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())
print (int((T + 0.5) // A * B))

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
time = 0
bsc = 0
while 0 == 0:
    time += a
    if time < t + 0.5:
        bsc += b
    else:
        break
print(bsc)

Submission status: Accepted

Solution code:
import math

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

kai = math.floor(t/a)
#print(kai)
print(kai*b)

Submission status: Accepted

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

for i in range(1,100000):
    time += A
    if time > T+0.5:
        break
    bisket += B
        
    
print(bisket)

Submission status: Accepted

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

Submission status: Accepted

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

mplier = C // A
print(mplier * B)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
if 1 <= a <= 20 and 1 <= b <= 20 and 1 <= t <= 20:
    made = (t + 0.5) // a
    print(int(made * b))
else:
    print('Invalid value')

Submission status: Accepted

Solution code:
#!/usr/bin/env python

def main():
    A, B, T = map(int, input().split())
    return (T // A) * B

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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

Submission status: Accepted

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

S=T+0.5

C=S//A

print(int(C*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:
l = list(map(int,input().split()))
a = l[0]
b = l[1]
t = l[2]
print((t//a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
ans = 0
i=1
while a*i <=t:
    ans +=b
    i+=1
print(ans)

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 ,c = map(int, input().split())

print(c//a*b)

Submission status: Accepted

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


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

Solution code:
#### import ####
import sys
import math
from collections import defaultdict

#### 設定 ####
sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

#### 定数 ####
mod = 10**9 + 7

#### 読み込み ####
def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))

#################

A,B,T = II()

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

Submission status: Accepted

Solution code:
list1 = [i for i in input().split()]

num1 = int(list1[0])
num2 = int(list1[1])
num3 = int(list1[2])

print (int(num3//num1 * num2))

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())

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

Submission status: Accepted

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

d = (n[2] + 0.5) // n[0]
ans = d * n[1]
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 = map(int,input().split())
print( (T // A) * B )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

inputa = input().split()

# inputb = input()


a = int(inputa[0])
b = int(inputa[1])
c = int(inputa[2])

# inputList = list(inputb)
#
# inputList[b-1] = inputList[b-1].lower()
#
# ans = "".join(inputList)
time = float(c)+0.5
ans = math.floor(time / float(a))
ans = int(ans)*b

print(ans)

# inputList.sort()
#
# list = [a+b, b+c ,c+a]
#
# ans = min(list)
# print(ans)



# flg = 1
# for i in range(0, len(inputList)-1):
#     if inputList[i] == inputList[i + 1]:
#         flg = 0
#         break
#
# if flg == 0:
#     print("Bad")
# else:
#     print("Good")

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:
a,b,t=input().split()
a,b,t=int(a),int(b),int(t)
#doubleをintで割ってもdoubleになってしまう(暗黙的)
#print((t+0.5)//a)
print((int((t+0.5)/a))*b)

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
a, b, t = list(map(int, input().split()))
cnt = 0
t += 0.5
t -= a
while t>0:
	cnt += 1
	t -= a
print(b*cnt)

Submission status: Accepted

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

if a > t:
    print(0)
else:
    ans = t//a*b
    print(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 = map(int,input().split())
print("{}".format((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())

print(T//A*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
C = T//A
print(C*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())

i = 0
while i*a <= t+0.5:
    i += 1

print(b*(i-1))

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())

print(t//a*b)

Submission status: Accepted

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

print((temp[2]//temp[0])*temp[1])

Submission status: Accepted

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

Submission status: Accepted

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

l_num = t // a

sum_ = 0
for n in range(1, l_num+1):
    sum_ += b

print(sum_)

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())
bisc = (t//a)*b
print(bisc)

Submission status: Accepted

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

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

Submission status: Accepted

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

buf=c//a

print(buf*b)

Submission status: Accepted

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

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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((t//a)*b)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(A)
# print(B)
# print(T)

print(int(T / A) * B)

Submission status: Accepted

Solution code:
N = input().split()
print(int(N[2]) // int(N[0]) * int(N[1]))

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(i) for i in input().split())
n = T // A
print(n*B)

Submission status: Accepted

Solution code:
a,b,t = map(int,raw_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:
A, B, T = map(int, input().split())
print(int((T-T%A)/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 = map(int, input().rstrip().split())

print((T//A)*B)

Submission status: Accepted

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

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())
print(T//A*B)

Submission status: Accepted

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

Submission status: Accepted

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

t = t + 0.5

result = (t // a) * b

print( "{:d}".format(int(result)) )

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 = list(map(int,input().split()))
T = t + 0.5
ans = 0

for i in range(1,21):
  if a*i <= T:
    ans += 1
print(ans*b)

Submission status: Accepted

Solution code:
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())

t = 1
biscuit = 0
while t*A <= T:
  biscuit += B
  t += 1

print(biscuit)

Submission status: Accepted

Solution code:
#coding:utf-8

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

#ビスケットが生産される回数
bake = t // a
ans =  b * bake

print(ans)

Submission status: Accepted

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

res=t//a*b

print(res)

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 = map(int, input().split())

ans = 0
i = 1
c = a
while c < t + 0.5:
    ans += b
    i += 1
    c = a * i

print(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 = list(map(int, input().split()))
i = 1
c = 0

while i <= (t + 0.5):
    if i % a == 0:
        c += b
    i += 1

print(c)

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 = map(int,input().split())
print(T//A * B)

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
sum=0
i=1
while a*i <= t+0.5:
    sum += b
    i += 1
print(sum)

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
print(int(z/x)*y)

Submission status: Accepted

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

main()

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())
print(int((t + 0.5) // a * b))

Submission status: Accepted

Solution code:
def biscuit(a,b,t):
    n = int(t/a) * b

    print("%d" %n)

if __name__ == '__main__':
    string = input().split()
    a = int(string[0])
    b = int(string[1])
    t = int(string[2])

    biscuit(a,b,t)

Submission status: Accepted

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

bisc = 0

while(A < (T + 0.5)):
    bisc += B
    A += step


print(bisc)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split(" ")]
interval = list[0]
qty = list[1]
t = list[2]
times = int((t+0.5)/interval)
print(times*qty)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

res = 0
t = t + 1
for k in range(1,10000):
    now = k * a
    if now < t:
        res += b

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
#coding: utf-8

A, B, T = map(int, input().split())
print(int(T/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:
l = [int(i) for i in input().split()]
print((l[2]//l[0])*l[1])

Submission status: Accepted

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

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())
count = 0
t = A
while True:
    if t > T + 0.5:
        break
    count += B
    t += A

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def wei(A,B,T):
    if T+0.5 > A:
        return int(T/A)*B
    else:
        return 0

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

"""print(wei(3,5,7) == 10)
print(wei(3,2,9) == 6)
print(wei(20,20,19) == 0)"""

Submission status: Accepted

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

while i*A <= T2:
  i += 1
  
i=i-1
  
print(B*i)

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())
limit = (t + 0.5) // a
print(math.floor(limit * b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main25():
    data = input().split()
    num = []
    for i in range(3):
        num.append(int(data[i]))
    result = num[1] * int(num[2]/num[0])
    print(result)

if __name__ == "__main__":
    main25()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    A,B,T= map(int, sys.stdin.readline().split())
    c=0
    i=1
    while True:
        if i*A < T+0.5:
            c +=1
            i +=1
        else:
            break
    print(B*c)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
s = input()

arr = s.rstrip().split(" ")

sai = int(arr[2]) // int(arr[0])

print(sai * int(arr[1]))

Submission status: Accepted

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

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 = map( int, input().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:
a,b,t = map(int, input().split())
print(int(b * (t // 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 = list(map(int, input().split()))

print(int((t + 0.5) // 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())

print(T // A * B)

Submission status: Accepted

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

count = 0
ans = 0
now_time = 0
while 1:
    count+=1
    now_time += a
    if now_time > t:
        break
    ans += b

print(ans)

Submission status: Accepted

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

while(time <= T + 0.5):
  biscuits += B
  time += A
  
print(biscuits)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# T/A * B を出力する
a,b,t = map(int,input().split())
print(b*(t//a))

Submission status: Accepted

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

Submission status: Accepted

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

print(T//A * B)

Submission status: Accepted

Solution code:
num = input().split()
a, b, t = int(num[0]),int(num[1]),int(num[2])

print(b*(t//a))

Submission status: Accepted

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

n = t // a
print(n*b)

Submission status: Accepted

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

num = ( T + 0.5 ) // a
print(int(b * num))