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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def resolve():
    a, b, t = map(int, input().split())
    time = a
    ans = 0
    while time <= t + 0.5:
        time += a
        ans += b
    print(ans)
resolve()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

A, B, T = MAP()

t = 0
ans = 0


while t + A < T+0.5 :
	ans += B
	t += A

print(ans)

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

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

time=a
cnt=0
i=1
while time <= t+0.5:
    cnt+=b
    i +=1
    time += a

print(cnt)

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

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

print( (T//A) * B)

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

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

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

print( int(t/a)*b)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a,b,t = input().split()
a = int(a)
b = int(b)
t = int(t)
qtd = 0

if 1 <= a <= 20 :
    if 1 <= b <= 20:
        if 1 <= t <= 20:
            intera = a
            while intera <= t:
                qtd = qtd + b
                intera = intera + a
            print(qtd)

Solution (Python):
a,b,t = map(int, input().split())
if a > t:
    print(0)
else:
    tempo = int((t + 0.5) / a)
    print(tempo * b)

Solution (Python):
def main():
    s, b, e = [int(x) for x in input().split()]
    e += 0.5
    levas = e // s
    print(int(levas*b))
main()

Solution (Python):
a,b,t=[int(x) for x in input().split()]
x=2
total=a
biscoito=0
while total<=(t+0.5):
    biscoito+=b
    total=x*a
    x+=1
print(biscoito)

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

ans = (int(C/A))*B
print(ans)

Solution (Python):
i = input().split()

a,b,t = list(map(float, i))

c = 1
bisc = 0
na = a

while(na <= t):
    bisc = bisc + b
    c += 1
    na = a * c

print(int(bisc))

Solution (Python):
numerosStr = input().split(" ")
numeros=[]
contador=0
i=0
for j in numerosStr:
    numeros.append(int(j))

A = numeros[0]
B = numeros[1]
T = numeros[2]+0.5

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

Solution (Python):
line = input()
A, B, T = [int(n) for n in line.split()]
T+=0.5
i = 0
while A*(i+1) <= T:
    i+=1
print(i*B)

Solution (Python):
line = input()
a, b, c = [int(n) for n in line.split()]
soma=0
for a in range(a, c+1, a):
    soma=b+soma
print(soma)

Solution (Python):
line = input()
numbers = [int(n) for n in line.split()]
time = numbers[2]*10 + 5
biscuits = numbers[1]
time_taken = numbers[0] * 10
predicted_value = 0
while time >= 0:
    if time - time_taken >= 0:
        predicted_value += biscuits
    time -= time_taken
print(predicted_value)

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

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

s = 0
x = a
while x <= t + 0.5:
    s += b
    x += a

print(s)

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

Solution (Python):
A, B, T = map(int, input().split())
cnt = 0

for i in range(A, T+1, A):
  cnt += B
print(cnt)

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

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

print(int(((t + .5) // a) * b))

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

Solution (Python):
icase=0
if icase==0:
    a,b,t=map(int,input().split())
    n=(t+0.5)//a
    print(b*int(n))

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

Solution (Python):
a = list(map(int, input().split()))

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

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

print(n*b)

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, T = lr()
answer = B * (T//A)
print(answer)

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

print((1+(T-A)//A)*B)

Solution (Python):
n=input().rstrip().split()
a=int(n[0])
b=int(n[1])
t=int(n[2])

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

print(ans)

Solution (Python):
a,b,c=map(int,input().split())
d=0
f=0
e=1

while 1:
  
  f=a*e
  if c+0.5>=f:
    e+=1
    
    d+=b
  else:
    break
print(d)

Solution (Python):
a,b,c=map(int,input().split())
d=0
f=0
e=1

while 1:
  
  f=a*e
  if c+0.5>=f:
    e+=1
    
    d+=b
  else:
    break
print(d)

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

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

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

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

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

Solution (Python):
A,B,T = map(int,input().split())
ans = 0
second = 0
while second <= T - A:
  ans += B
  second += A
print(ans)

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

Solution (Python):
import math
import collections
import sys

input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

Solution (Python):
import math
A,B,T=map(int, input().split())
print(math.floor(T/A)*B)

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

Solution (Python):
a,b,t = map(int,input().split())
if a > t:
  print(0)
else:
  L = t // a
  print(L*b)

Solution (Python):
A, B, T = map(int, input().split())
ans = 0
cnt = A
while cnt <= T + 0.5:
    ans += B
    cnt += A
print(ans)

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

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

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

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

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

Solution (Python):
a,b,t=map(int,input().split())
time=a
n=0
while time<t+0.5:
    n+=1
    time+=a
print(b*n)

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

Solution (Python):

a, b, t = map(int, input().split())
tmp = a
ans = 0
while (True):
    for i in range(100):
        if a >= t + 0.5:
            print(ans)
            exit()
        a += tmp
        ans += b

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

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

print(B*(T//A))

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

print(B*(T//A))

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

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

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

Solution (Python):
a, b, t = map(int, input().split())
c = a
while t+0.5 >c :
    c += a 
c -= a
aa = c//a*b
print(aa)

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

print(int(t/a)*b)

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

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

Solution (Python):
n,m,k = map(int, input().split())
print((k//n)*m)

Solution (Python):
a, b, c = [int(i) for i in input().split()]
 
ans = 0
for i in range(1, c+1):
    if i%a == 0:
        ans += b
 
print(ans)

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

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

Solution (Python):
x,y,z=map(int,input().split())
c=0
for i in range(100000):
    c=z-i*x
    if c<0:
        break
print((i-1)*y)

Solution (Python):
A,B,T = map(int, input().split())
t = A
b = 0
while(t<=(T+0.5)):
    b += B
    t += A

print(b)

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

print((t//a)*b)

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline










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

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

print(ans)

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

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

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

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

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

Solution (Python):

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

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

print(t//a*b)

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    A, B, T = input_nums()
    time = 0
    total = 0
    while True:
        time += A
        if time > T +0.5: break
        total += B
    print(total)
if __name__ == '__main__':
    main()

Solution (Python):
def main():
    A, B, T = map(int, input().split())
    ans = (T//A)*B
    print(ans)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
A,B,T=list(map(int,input().split()))
ans=0
for t in range(1,T+1):
    if t%A==0:
        ans+=B
print(ans)

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

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

print(t // a * b)

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


count=0
i=1
t=A
while t<T+0.5:
  count=count+B

  i=i+1
  t=i*A  

print(count)

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

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

Solution (Python):
a, b, t = map(int, input().split())
c = 0
for number in range(1, 21):
    if a * number < t + 0.5:
        c += b
    else:
        pass
print(c)

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

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

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

Solution (Python):

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

Solution (Python):
import numpy as np
import sys
a, b, t = map(int, input().split())
print(b * (t // a))

Solution (Python):
def main():
    a, b, t = map(int, input().split())
    time = t/a
    ans = int(time) * b
    print(int(ans))
if __name__ == '__main__':
    main()

Solution (Python):
import math 

a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
p = math.floor(z / x)
print(int(p * y))

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, t = map(int, readline().split())
  print((t//a)*b)
  
  
  
  
if __name__ == '__main__':
  main()

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

Solution (Python):
A,B,T=map(int,input().split())
i=0
while A*i<=T:
    i=i+1
print(B*(i-1))

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

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

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

Solution (Python):
import itertools
import fractions
def main():
  a,b,t = map(int,input().split())
  
  print(b * (t//a))
if __name__ == '__main__':
  main()

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

time = t
count = time//a
amount = count*b
print(amount)

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

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

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

T = T + 0.5

times = T // A

print(int(B*times))

Solution (Python):
import sys

a, b, t = map(int, sys.stdin.readline().split())

def main():
    res = b * (t // a)
    print(res)

if __name__ ==  '__main__':
    main()

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

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

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    count = (a[2] // a[0]) *a[1]
    print(count)

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

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

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

time=0
biscuits=0

while True:
    time+=A
    if time>T+0.5:
        break
    biscuits+=B
print(biscuits)

Solution (Python):

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

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

res = 0
cnt = 0
t = T + 0.5

loop = T // A

for i in range(loop):
    if(cnt <= t):
        res += B
        cnt = i * A
    else:
        break
print(res)

Solution (Python):
A_interval, B_mai, T_limit = map(int, input().split())

times = T_limit // A_interval

ans = B_mai * times
print(ans)

Solution (Python):

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

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

Solution (Python):
a,b,t = map(int,input().split())
n = 0
ans = 0
while n+a <= t:
  ans += b
  n += a
print(ans)

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

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

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

print((T//A)*B)

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

Solution (Python):
a,b,t = list(map(int,input().split()))
print("{:}".format(t//a*b))

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

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

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

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

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

print("{}".format((T//A)*B))

Solution (Python):












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

ans = t//a * b

print(ans)

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

tt = 0
x = 0
while True:
    tt += a
    if tt > t + 0.5:
        break
    x += b
print(x)

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

print(T//A*B)

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

print(T//A*B)

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

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

Solution (Python):
A, B, T = map(int, input().split())
k = 2
val = A
while True:
  if val > T + 0.5:
    break
  else:
    val = k * A
    k += 1
print((k - 2) * B)

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

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

Solution (Python):

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

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

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        









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

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

print(int(ans))

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

Solution (Python):


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate
    
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
def main():
    a, b, t = (int(x) for x in input().split())
    t += 0.5
    print(int(t/a)*b)

main()

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

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

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

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

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

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

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

print(T//A*B)

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

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

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

print((t//a) * b)

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

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

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

Solution (Python):







import math

import sys



ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a, b, t = list(map(int,ipti().split()))

    print((t//a) * b)

if __name__ == '__main__':
    main()

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

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

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

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

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

print(T//A * B)

Solution (Python):


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

if __name__ == '__main__':
    main()

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

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

x = t //a
result = b * x
print(result)

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

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

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

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

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

Solution (Python):
a,b,t = map(int,input().split())
T = t + 0.5

print(round(T // a * b))

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

    return 0


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
N, M, K = map(int, input().split())
print((K//N)*M)

Solution (Python):
a,b,t=(map(int,input().split()))
t=t+0.5
i=0
while t>=a:
  t=t-a
  i+=b
print(i)

Solution (Python):
a, b, t = map(int, input().split())
c = 0
d = a
while d <= t + 0.5:
  c += b
  d += a
print(c)

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

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

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

print(cnt)

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

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

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

Solution (Python):

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

print(n // a * b)

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

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

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

print((t // a) * b)

Solution (Python):

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

Solution (Python):
a, b, t = list(map(int, input().split()))
result = 0
for i in range(1, 21):
    if a*i <= t+0.5:
        result = b * i
    else:
        break
print(result)

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

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

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

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

print(b * (t//a))

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

Solution (Python):
from sys import stdin

a, b, t = (int(i) for i in stdin.readline().rstrip().split())
total = 0
time = a
while time <= t+0.5:
    total += b
    time += a
print(total)

Solution (Python):
A,B,D=map(int,input().split())
count=0
D+=0.5
while True:
    if D-A>=0:
        count+=1
        D-=A
    else:
        print(count*B)
        exit()

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

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

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

Solution (Python):
stdin = input().split(" ")
A = int(stdin[0])
B = int(stdin[1])
T = int(stdin[2])
x = 1
sums = 0

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

Solution (Python):
import sys
input = sys.stdin.readline
A, B, T = map(int, input().split())

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

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

print(c // a * b)

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

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

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

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

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

print(ans)

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

ans = B * (T//A)

print(ans)

Solution (Python):



from math import ceil

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

if __name__=='__main__':
  main()

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

t = 1
ans = 0

while t <= T:
    if t % A == 0:
        ans += B
    t += 1

print(ans)

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

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

print(ans)

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

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

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

print((t // a) * b)

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

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

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

count= 0
for i in range(1,10**12):
    if t + 0.5 <= i * a:
        break
    else:
        count += b

print(count)

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

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

print(t // a * b)

Solution (Python):
A,B,T=map(int,input().split())
T0 = 0
B0 = 0
while T0 < (T + 0.5):
    B0 = B0 + B
    T0 = T0 + A
print(B0-B)

Solution (Python):
A,B,T = input().split()
C = 0
x = 0
while float(C) <= float(T) + 0.5:
    
    C = C + int(A)
    
    x = x + int(B)
print(x - int(B))

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

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

Solution (Python):

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A, B, T = MAP()
 
bis = 0
for i in range(1, 100):
  if A*i <= T:
    bis += B
  else:
    break
print(bis)

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



cnt = 1
tcnt = 0
bis = 0
while tcnt <= t+0.5:
    tcnt = cnt * a
    bis += b
    cnt += 1
print(bis-b)

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

x = (t+0.5)//a

print(int(x*b))

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

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

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

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

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

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

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

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

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

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

sum=0
i=1
while A*i<=T+0.5:
	sum+=B
	i+=1
print(sum)

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

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

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