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

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

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

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

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

cnt = 0
while T >= A:
  cnt += B
  T -= A
print(cnt)

Solution (Python):
A,B,T = map(int,input().split())
print(len(range(A,T+1,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())
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 = 0
now = a
while now <= t:
    ans += b
    now += a
print(ans)

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

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

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

Solution (Python):
A,B,T = map(int,input().split())
t = T//A
ans = t*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):
def main():
	A,B,T = list(map(int,input().split()))
	print(T//A*B)
main()

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

print((t//a)*b)

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

n = (c + 0.5) // a

print(int(n) * b)

Solution (Python):
a,b,t=map(int,input().split())
t+=0.5
print(int(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((T+0.5)//A) * B)

Solution (Python):
import math


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

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

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

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

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

Solution (Python):
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

A, B, T = rl()

r = math.floor(T / A)
print(r * 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())
bis = 0
for i in range(1,30):
    time = a * i
    if time < t + 0.5:
        bis += b
print(bis)

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

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):
rStr = input()

A = int(rStr.split(' ')[0])
B = int(rStr.split(' ')[1])
T = int(rStr.split(' ')[2])

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

print(result)

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

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

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

print(int(time*B))

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

ans = 0
i = 1
while i*a <= t+0.5:
    ans +=b
    i+=1
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+0.5)//a)*b))

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

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

Solution (Python):
def count_biscuits_num() -> int:
    after_a_sec, making_per_a, until_sec = map(int, input().split())
    limited_time = float(until_sec) + 0.5
    spent_time = after_a_sec
    total_making = 0

    while True:
        if limited_time >= spent_time:
            total_making += making_per_a
            spent_time += after_a_sec
        else:
            return total_making


print(count_biscuits_num())

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

Solution (Python):





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






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

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

x = c//a
print(x * 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())

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

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

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

print(t//a * b)

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

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


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

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

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

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

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

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

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

print((T // A) * B)

Solution (Python):
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    a, b, k = Input()
    ans = (k//a) * b
    print(ans)


main()

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

Solution (Python):

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

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

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

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

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

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

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

time = 1
biscuit = 0

while time < t + 0.5:
    if time % a == 0:
        biscuit += b
    time += 1

print(biscuit)

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

time = A
biscuits = 0

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

Solution (Python):
x,y,z=map(int,input().split())
s=0
c=0
i=0
while(s<z+0.5):
    c+=y
    s+=x
    if(s>z):
        c-=y
print(c)

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

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

    print(ans)


if __name__ == "__main__":
    main()

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

import sys
import numpy as np


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

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

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

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

A, B, T = LI()


def main():
    ans = (T // A) * B
    print(ans)


if __name__ == "__main__":
    main()

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

print(b*(t//a))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, B, T = map(int, readline().split())

    print(T // A * B)

    return


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

Solution (Python):
A, B, T = [ int(v) for v in input().split(" ") ]

T += 0.5
total = 0
time = A

while True:
  if time < T:
    total += B
    time += A
  else:
    break

print(total)

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


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


if __name__ == "__main__":
    main()

Solution (Python):
A,B,T = map(int,input().split())
time = A
cnt = 0
while time < T + 0.5:
    time += A 
    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(B*(T//A))

Solution (Python):
a,b,t=list(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()
ans = 0
i = 1
while i*a <= t:
    ans += b
    i += 1
print(ans)

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
print (B*x)

Solution (Python):

def input2():
	return map(int,input().split())

a,b,t=input2()
ans=0

for i in range(1,21):
	if a*i>t:
		break
	ans+=b
print(ans)

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

print(b*d)

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    A, B, T = LI()

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

if __name__ == '__main__':
    resolve()

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

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

solve()

Solution (Python):
a,b,t = map(int, input().split())
n = int(t/a)
print(n*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((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())
for i in range(21):
    if a*i < t+0.5:
        k=i
    else:
        break      
print(b*k)

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

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

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

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

the_number_of_times = (t + 0.5) // a
the_number_of_biscuits = int(b * the_number_of_times)

print(the_number_of_biscuits)

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

print( b * kaisuu)

Solution (Python):


import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)


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

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

print(count)

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

Solution (Python):
a, b, t = map(int, input().strip().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(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((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(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(t//a*b)

Solution (Python):
a, b, n = map(int, input().split())
c = 0
d = a
i = 1
while d <= n:
  c = c + b
  i = i + 1
  d = a * i
print(c)

Solution (Python):
import sys

stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


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

Solution (Python):
import math
a, b, t = map(int, input().split())
T = t + 0.5
times = math.floor(T / a)

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

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

Solution (Python):
a, b, c = list(map(int, input().split()))
n = c % a
my_result = b * (c - n) / a
print(int(my_result))

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

print(res)

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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b,t=I()


print(t//a*b)

Solution (Python):

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

Solution (Python):
a,b,c=list(map(int,input().split()))
count=0
d=a
con=1
while(a<=c+0.5):
  count+=b
  con+=1
  a=d*con
print(count)

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

Solution (Python):
a, b, t = map(int, input().split())
m = 0
i = 1

while i * a < t + 0.5:
    i += 1
    m += b

print(m)

Solution (Python):
ary = list(map(lambda n : int(n), input().split(" ")))

print(int(ary[2]/ary[0]) * ary[1])

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

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

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

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

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

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

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

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

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

ans = 0
for t in range(T//A):
    ans += B
print(ans)

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

Solution (Python):













































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    A, B, T = list(map(int, lines[0].split()))
    
    
    
    
    
    
    
    

    result = 0

    result = (T//A) * B

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 5 7']
        lines_export = [10]
    if pattern == 2:
        lines_input = ['3 2 9']
        lines_export = [6]
    if pattern == 3:
        lines_input = ['20 20 19']
        lines_export = [0]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):

a = list(map(int, input().split()))

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

cout = 0
loopCount = 1
timeOut = T + 0.5
time = A
while True:
    if time >= timeOut:
        break
    cout += B
    loopCount += 1
    time = A * loopCount

print(cout)

Solution (Python):
import sys

input = sys.stdin.readline


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

    ans = B * (T // A)

    print(ans)


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

Solution (Python):
n = input().split()
ans = int( (int(n[2]) + 0.5) / int(n[0])) * int(n[1])
print(ans)

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

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

t = 0
m = 0
while(1):
    t += A
    if t <= T + 0.5:
        m += B
    else:
        break


print(m)

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

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

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

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

if t < a:
    print(0)

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

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

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

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

Solution (Python):
a, b, t = map(int, input().split())
print(b * sum(1 for _ in range(a, t+1, a)))

Solution (Python):
import math

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

print(math.floor(cnt*b))

Solution (Python):
a,b,t = map(int,input().split())
ans = 0
while t >= a:
    ans += b
    t -= 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(T//A*B)

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

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

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//A
Ans = B*C
print(Ans)

Solution (Python):
A, B, T = [int(i) for i in 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())
n = int(c/a)
res = b*n
print(res)

Solution (Python):
a,b,t = map(int, input().split())
time = 0
i = 0
sum = 0
while True:
    i += 1
    if t + 0.5 < a*i:
        break
    sum += b

print(sum)

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

Solution (Python):
import sys
A,B,T = map(int,input().split())
if not ( 1 <= A <= 20 and 1 <= B <= 20 and 1 <= T <= 20 ): sys.exit()

time_remind = T+0.5
sum = 0
for I in range(1,T+1):
    time_remind -= A
    if time_remind >= 0: sum += B
print(sum)

Solution (Python):
def main():
    a,b,t = map(int,input().split())
    ans = 0
    for i in range(1,t + 1, 1):
        if i % a == 0:
            ans += b
    print(ans)
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())
print(t//a*b)

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

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

print(b*(t//a))

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

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

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

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

Solution (Python):
a,b,t = map(int, input().split())
print(round((t + 0.5) // 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()

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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

sum = 0
time = 0
while True:
    time += a
    if t < time:
        break
    sum += b

print(sum)

Solution (Python):
import sys

def S(): return sys.stdin.readline().rstrip()

A,B,T = map(int,S().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(int((T + 0.5) // A * B))

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

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

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

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

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

Solution (Python):
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
a, b, t = rm()
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(b*(t//a))

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

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]





A, B, T = mi()

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

c = T // A

d = c * B

print(d)

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

ans = 0

while T>0:
  ans += B
  T -= A
  
if T == 0:
  print(ans)
else:
  print(ans-B)

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

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

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

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

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

print((T//A)*B)

Solution (Python):
import math
a,b,t=map(int,input().split())
print(math.floor((t+0.5)//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=0
c=a
while a<=t :
  cnt+=b
  a+=c

print(cnt)

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

while cnt < T+0.5:
  if cnt%A == 0:
    ans = ans + B
  cnt += 1
print(ans)

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

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

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

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

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

Solution (Python):
a,b,k=map(int, input().split())
ans=(k//a)*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(int((T + 0.5) // A) * B)

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

Solution (Python):


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

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

if __name__ == "__main__":
    main()

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

Solution (Python):
import sys

from bisect import bisect
from collections import defaultdict, Counter
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))





def solve():
	a, b, t = read()
	print(int((t+.5)//a)*b)


	





		

if __name__ == "__main__":
	solve()

Solution (Python):
a,b,t = map(int,input().split())
x = 0
for i in range(100):
    if a * i <= t: x = i
print(x * b)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)



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








ans = 0
A = a

while A <= t+0.5:
    ans += b
    A += a
    
print(ans)

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

time_count = 0
biscuit_count = 0
for i in range(1, 100):
    time_count += A
    if time_count > T + 0.5:
        break
    biscuit_count += B

print(biscuit_count)

Solution (Python):
a,b,t = map(int, input().split())
ans = int((t+0.5)//a)*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(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):
def INT():
    return int(input())

def MI():
    return map(int, input().split())

def LI():
    return list(map(int, input().split()))

A, B, T = MI()

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

Solution (Python):
A, B, T = map(int, input().split())
ans = 0
time = A
while time <= T:
    ans += B
    time += 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())

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

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

print((T//A)*B)