Problem:


Score : 100 points

Problem Statement

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

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

Constraints

All values in input are integers.

1 \leq A, B, T \leq 20

Input

Input is given from Standard Input in the following format:

A B T

Output

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

Sample Input 1

3 5 7

Sample Output 1

10

Five biscuits will be produced three seconds after activation.

Another five biscuits will be produced six seconds after activation.

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

Sample Input 2

3 2 9

Sample Output 2

6

Sample Input 3

20 20 19

Sample Output 3

0



Sample input:
3 5 7


Sample output:
10

Submission status: Accepted

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

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

ans = (t//a) * b

print(ans)

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

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

Submission status: Accepted

Solution code:
A, B, T = list(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())
print(T//A * B)

Submission status: Accepted

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

Submission status: Accepted

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

#output
answer = 0
C = T // A
answer = B*C
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, string
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**7)
inf = float('inf')
mod = 10**9+7
ans = inf ;count = 0 ;pro = 1

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

Submission status: Accepted

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

ans = 0
for i in range(20):
    t -= a
    if ( t >= 0):
        ans += b
    else:
        break

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def check(a, time):
  ret, mod = divmod(time, a)
  value = True if mod == 0 else check(a, ret) if ret > a else False
  return value


a, b, t, biscuit = map(int, input().split() + ["0"])
for i in range(1, t + 1):
  if check(a, i):
    biscuit = biscuit + b

print(biscuit)

Submission status: Accepted

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

print(t // a * b)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

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

print(bis-b)

Submission status: Accepted

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

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

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())
s=0
x=a
while x<=t+0.5:
    s+=b
    x+=a
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

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

time = i[0]
num = i[1]
limit_time = i[2]

times = (limit_time+0.5) // time

print(int(num*times))

Submission status: Accepted

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

x = b * (t // a)

print(x)

Submission status: Accepted

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

x = t // a
y = b * x

print(y)

Submission status: Accepted

Solution code:
# ABC125a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#制限時間 i[2]+0.5秒の間で、i[0]秒ごとに、i[1]枚ビスケットができる

ans = int(i[1]*((i[2]+0.5)//(i[0])))
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#H, W = map(int, input().split())
A, B, T = map(int, input().split())

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

Submission status: Accepted

Solution code:
A,B,T=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

print(T//A*B)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(A, B, T):
    """Test Case
    >>> print_ans(3, 5, 7)
    10
    >>> print_ans(3, 2, 9)
    6
    >>> print_ans(20, 20, 19)
    0
    """
    tmp, _ = divmod(T, A)
    print(tmp * B)

if __name__ == '__main__':
    A, B, T = map(int, input().rstrip().split())
    print_ans(A, B, T)

Submission status: Accepted

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

Submission status: Accepted

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

p_a()

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
i=0
cum_time=0
total=0
while True : 
  cum_time+=a
  if cum_time>t+0.5:
    break
  else:
    total+=b
print(total)

Submission status: Accepted

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

PART = T//A

print(B*PART)

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:
def examA():
    A, B, T = LI()
    ans = (T//A)*B
    print(ans)

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

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+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())
if a > t:
    print(0)
elif a == t:
    print(b)
else:
    t += 0.5
    tsum = 0
    ans = 0
    while (tsum < t):
        tsum += a
        if tsum > t:
            break
        else:
            ans += b
    print(ans)

Submission status: Accepted

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

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

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().strip().split())

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t = (int(x) for x in input().split())
t = t + 0.5
c = a
n = 0
while t >= a :
    a = a + c
    n += 1
print((n)*b)

Submission status: Accepted

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


def gcd(a, b):
    # greatest common divisor
    while b > 0:
        a, b = b, a % b

    return a


A, B, T = inpl()

print(B * (T // A))

Submission status: Accepted

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

total = 0

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

print(total)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(B*n)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 2019-11-13 01:43:55(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    a, b, t = [int(x) for x in sys.stdin.readline().split()]
    ans = int((t + 0.5) // a) * b
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

while float(a*i) < float(c)+0.5:
  i += 1

ans = (i-1)*b  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


ans = 0

print(t // a * b)

Submission status: Accepted

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

import math

N = (T + 0.5)/A
n = math.floor(N)

bisket = B * n

print(bisket)

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

ret = (t//a)*b

print(ret)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print (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())
m = 1

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

print((m-1)*b)

Submission status: Accepted

Solution code:
# ABC 125: A – Biscuit Generator
a, b, t = [int(s) for s in input().split()]
print(t // a * b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,T=map(int,input().split())
ans=0
t=a
while t <= T + 0.5:
  ans += b
  t += a
  
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())
otv = 0
for i in range(a,a*100, a):
    if t < i:
        break
    otv += b
print(otv)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
ans = [B for i in range(T//A)]
print(sum(ans))

Submission status: Accepted

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

print(int(T*b))

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(i) for i in input().split()]
print(int((t + 0.5) / a) * b)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())
k = (t + 0.5) // a
x = int(k * b)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(biscut)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a,b,t = map(int,input().split())
i = a
count = 0
while t+0.5 >= i:
    count += b
    i += a
    

print(count)

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
A, B, T = map(int,sys.stdin.readline().split())

print((T//A)*B)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

byou = T//A
total = byou * B
print(total)

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

x = 1

while T / (A * x) >= 1 :
    x += 1
print((x-1)* 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())
print(B * (T//A))

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

to = 0
aa = a
while aa <= t+0.5:
	to += b
	aa += a

print(to)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABT = input().split()
gen = int(ABT[0])
onetime = int(ABT[1])
Time = int(ABT[2])
cookie = 0

for i in range(1,Time+1):
    if (i % gen)  == 0:
        cookie += onetime

print(cookie)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t = list(map(int,input().strip().split()))
s = int(0)
n = int(t/a)
for k in range(n):
    s += b
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

# In[4]:


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


# In[5]:


time = A
sum = 0

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

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())
if (t+0.5)/a < 1:
  print(0)
else:
  print(int((t+0.5)/a)*b)

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, t = list(map(int, input().rstrip('\n').split()))
    total = 0
    for i in range(1, t + 1):
        if i % a == 0:
            total += b
    print(total)


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

a,b,t = [int(x) for x in stdin.readline().rstrip().split()]

print(b*(t//a))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(int(T+0.5)//A):
    ans+=B

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

Submission status: Accepted

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

s = 0
i = 0 - A[1]

while s < A[2]+0.5:
    s = s + A[0]
    i = i + A[1]
    
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))
A = int(INPUT[0])
B = int(INPUT[1])
T = int(INPUT[2])
print('{:.0f}'.format((T+0.5)//A*B))

Submission status: Accepted

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

print(B*count)

Submission status: Accepted

Solution code:
'''A - Biscuit Generator
https://atcoder.jp/contests/abc125/tasks/abc125_a

>>> main(3,5,7)
10
>>> main(3,2,9)
6
>>> main(20,20,19)
0'''


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


if __name__ == "__main__":
    a, b, t = map(int, input().split(' '))
    main(a, b, t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=[int(i) for i in input().split()] #A=A[0] B=A[1] T=A[2]
n=A[2]//A[0]*A[1]
print(n)

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, t = [int(i) for i in 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:
ip = input()
A, B, T = ip.split(" ")

N = int(T) // int(A)

if N < 1:
	print(0)
else: print(N * int(B))

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, t = list(map(int, input().rstrip('\n').split()))
    print(t // a * b)


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
print(0 if a>t else (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,C=[int(s) for s in input().split()]
print((C//A)*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """3 5 7"""
        output = """10"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """3 2 9"""
        output = """6"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """20 20 19"""
        output = """0"""
        self.assertIO(input, output)

def  resolve():
    (A,B,T)=(int(i) for i in  input().split())
    print(int(T/A)*B)
if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

count = 0
for i in range(0, int(T/A)):
    count += B

print(count)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
counter = 0
for _ in range(t//a):
    counter += b
print(counter)

Submission status: Accepted

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

count = 0

for i in range(1,21,1):
  if t >= i * a :
    count += 1
  else:
    break
    
print( count * 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())
print(int(((T+0.5)//A)*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
ans = 0 
i = 0
while ans >= 0:
    i += 1
    if A*i > T + 0.5:
        break
    else:
        ans += B
print(ans)

Submission status: Accepted

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

print(T // A * B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(T/A)*B)

Submission status: Accepted

Solution code:
a,b,t=[int(i) for i in 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 = [int(x) for x in input().split()]

print((T//A)*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print( (t)//a*b )

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10 ** 7)


def solve(A: int, B: int, T: int):
    ans, t = 0, 0
    while True:
        t += A
        if t > T + 0.5:
            break
        ans += B
    print(ans)
    return


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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