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: Wrong Answer

Solution code:
6

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

out = (T / A) * B

print(int(out))

Submission status: Wrong Answer

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

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

out = (T / A) * B

print(out,end='')

Submission status: Wrong Answer

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

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

out = (T / A) * B

print(out)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def biscuit_generator(a,b,t):
    sec = a
    biscket = 0
    time = t

    while sec < time + 0.5:
        biscket += b
        sec += a
    print(biscket)

Submission status: Wrong Answer

Solution code:
def biscuit_generator(a,b,t):
    sec = a
    biscket = 0
    time = t

    while sec < time + 0.5:
        biscket += b
        sec += a
    return biscket

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

T += 0.5
answer =  (T // A) * B

print(answer)

Submission status: Wrong Answer

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

T += 0.5
answer = B * (T // A)

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = int(3)
B = int(5)
T = int(7)
print(((T+0.5)//A)*B)

Submission status: Wrong Answer

Solution code:
A = int(3)
B = int(5)
T = int(7)
print(T//A*B)

Submission status: Wrong Answer

Solution code:
A = 3
B = 5
T = 7
print(T//A*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
a, b, t = map(int, sys.stdin.readline().split())
total = ((t+1)//a)*b
print(total)

Submission status: Wrong Answer

Solution code:
import sys
a, b, t = map(int, sys.stdin.readline().split())
total = 0
a_i = a
for i in range(1, t + 2, 1):
  if a_i <= i:
    total += b
    a_i = a_i + a
print(total)

Submission status: Wrong Answer

Solution code:
import sys
a, b, t = map(int, sys.stdin.readline().split())
total = 0
for i in range(1,t+1,1):
  if a <= i:
    total += 1
print(total)

Submission status: Wrong Answer

Solution code:
import sys
a, b, t = map(int, sys.stdin.readline().split())
total = 0
for i in range(1,t+1,1):
  if a < i:
    total += 1
print(total)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(0)

Submission status: Wrong Answer

Solution code:
ABC = input().rstrip().split(" ")
A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])
count = (C+0.5)//A
print(count*B)

Submission status: Wrong Answer

Solution code:
ABC = input().rstrip().split(" ")
A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])
count=A//(C + 0.5)
print(count*B)

Submission status: Wrong Answer

Solution code:
input_line = input()
A, B, T = input_line.split()
time = 0
biscuitNum = 0

while time * A >= T:
  time += 1
  biscuitNum += B

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if(a >= 1 and a <= 20 and b >= 1 and b <= 20 and t >= 1 and t <= 20):
    count = t / a
    answer = b * count
    print(round(answer))
else:
    print(0)

Submission status: Wrong Answer

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

count = t / a

answer = b * count

print(round(answer))

Submission status: Wrong Answer

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

count = t / a

answer = b * count

print(answer)

Submission status: Wrong Answer

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

if T < A:
    pass
    
else:
    for i in range(A, T, A):
        #print(i)
        biscuit += B

print(biscuit)

Submission status: Wrong Answer

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

if T < A:
    pass
    
else:
    for i in range(1, T, A):
        biscuit += B

print(biscuit)

Submission status: Wrong Answer

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

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

print(biscuit)

Submission status: Wrong Answer

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

m=a//t

print(int(m*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0
for i in range(A):
  if T <= i*A:
    cnt += i
  else:
    break
print (cnt*B)

Submission status: Wrong Answer

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

cnt = 0
for i in range(A):
  if T >= i*A:
    cnt += 1
  else:
    break
print (cnt*A)

Submission status: Wrong Answer

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

cnt = 0
for i in range(A):
  if T <= i*A:
    cnt += 1
  else:
    break
print (cnt*B)

Submission status: Wrong Answer

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

cnt = 0
for i in range(A):
  if T <= i*A:
    cnt += 1
  else:
    break
print (cnt*A)

Submission status: Wrong Answer

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

cnt = 0
for i in range(A):
  if T < i*A:
    cnt += 1
  else:
    break
print (i*A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def biscuit_generator(a, b, t):
  return ((t + 0.5) // a) * b

Submission status: Wrong Answer

Solution code:
# problemA
def main():
  A, B, T = map(int, input().split())
  t = 0 # 累積時間
  i = 0
  # この部分は総和によってもともと計算してあればもっと早くできる
  while t<T+0.5:
    i = i + 1
    t = t + A*i
    if A>T+0.5:
      i = 0
  result = B*i
  print(result)
  
main()

Submission status: Wrong Answer

Solution code:
# problemA
def main():
  A, B, T = map(int, input().split())
  t = 0 # 累積時間
  i = 0
  # この部分は総和によってもともと計算してあればもっと早くできる
  while t<T+0.5:
    i = i + 1
    t = t + A*i
    if A*i>T+0.5:
      i = 0
  result = B*i
  print(result)
  
main()

Submission status: Wrong Answer

Solution code:
# problemA
def main():
  A, B, T = map(int, input().split())
#   print('A={},B={},T=[3]'.format(A,B,T))
  t = 0 # 累積時間
#   total = 0 # クッキー合計数
  i = 0
  # この部分は総和によってもともと計算してあればもっと早くできる
  while t<T+0.5:
    i = i + 1
    t = t + A*i
    if A*i<T+0.5:
      i = 0
  result = B*i
  print(result)
main()

Submission status: Wrong Answer

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

print(round(T/A)*B)

Submission status: Wrong Answer

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

k = t / a
if k >= 0:
  print(k * b)
elif a>t:
  print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
str=input().split(' ')
a,b,t=eval(str[0]),eval(str[1]),eval(str[2])
ans=0
while a<=t:
  ans+=b
  a+=a
print(ans)

Submission status: Wrong Answer

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

if A>T:
    print(0)
else:
    while(True):
        l = A*k*(k+1)/2
        if l >= T+0.5:
            print(k*B)
            break
        k+=1

Submission status: Wrong Answer

Solution code:
#############################################################...#.....#...#.......
###########################################.#.################....#...............
############################################.#..################....##............
######################.#####################..#.##################.....#..........
#######################.#####################.#..#######..##########......#.......
#######################..####################....####...#.....######.###..........
########################################....#...##...###..#.......##..####........
###################.##.#....#########........#.#........##.###....................
####################.#..#....##..#..........#.##........##.#######................
###########.########.....#.....##.............####...#..#...########..#...........
############.########.....#...................########..#...########...#.##.......
########..###..####.....#####..................#######.......##.####..#....#......
########.....#.....##########...................#####........#..###..#.......##...
########........#####.##....##.#............................###.##..#...........#.
########......######.........................#.................##.................
########.....########....................................##....#..................
########.....##############......................#...........##.#.................
#########...###############.......................................................
###########..##############......................................#................
###########.......#####..........................................#................

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A>=T:
    print(0)
else:
    while(True):
        l = A*k*(k+1)/2
        if l >= T+0.5:
            print(k*B)
            break
        k+=1

Submission status: Wrong Answer

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

if A>=T:
    print(0)
else:
    while(k!=0):
        k+=1
        l = A*k*(k+1)/2
        if l >= T+0.5:
            print(k*B)
            k=0

Submission status: Wrong Answer

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

if A>=T:
    print(0)
else:
    for k in range(20):
        l = A*k*(k+1)/2
        if l >= T+0.5:
            print(k*B)
            break

Submission status: Wrong Answer

Solution code:
A, B, T = (int(i) for i in input().split()) 
j = 0
for i in range(20):
  if T >= i * A:
    j = i
ans = 0
ans = j * B
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = T // A

sum = 0
for i in range(n):
  sum = sum + B*(n+1)
  
print(sum)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

total=0

for i in range(1,20):
     if a*i > t:
         break
     else:
         total += b


print(total)

Submission status: Wrong Answer

Solution code:
#スペース区切りの整数の入力
A, B, T= map(int, input().split())
ans = (T/A)*B
print("{}".format(ans))

Submission status: Wrong Answer

Solution code:
A, B, T = map(int, input().split(" "))
if A>T:
    print(0)
else:
    count = (T-T%A)/A
    ans = B * count
    print(ans)

Submission status: Wrong Answer

Solution code:
num_list = [int(i) for i in input().split()] 
print(num_list)
num_1 = num_list[0]
plus =  num_list[0]
num_2 = num_list[1]
num_3 = num_list[2]+0.5
target = 0

while(num_1 <= num_3):
  if num_1 > num_3:
    print(target)
    break
  if num_1 <= num_3:
    target += num_2
    num_1 += plus
print(target)

Submission status: Wrong Answer

Solution code:
num_list = [int(i) for i in input().split()] 
print(num_list)
num_1 = num_list[0]
plus =  num_list[0]
num_2 = num_list[1]
num_3 = num_list[2]
target = 0

while(num_1 <= num_3):
  if num_1 > num_3:
    print(target)
    break
  if num_1 <= num_3:
    target += num_2
    num_1 += plus
print(target)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b, t = (float(i) for i in input().split())
print(int(math.floor((t + 0.5) / b)) * a)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
cnt=1
ABT=input().split()
A=[int(i) for i in ABT]
A[2]+=0.5
if 0<A[2]-A[0]:
    while 0<A[2]:
        A[2]-=A[0]*cnt
        if 0<A[2]:
            cnt+=1
    print(cnt*A[1])
else:
    print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from itertools import*
from fractions import*
n,*a=map(int,open(0).read().split())
b=list(accumulate([0]+a,gcd))
c=list(accumulate([0]+a[::-1],gcd))
print(max(gcd(s,t)for s,t in zip(b,c[::-1][1:])))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
a,b,t=map(int,input().split(" "))
t+=0.5
ans=0
if(t>a):
    ans=(t-t%a)/a*b
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print((A//T)*B)

Submission status: Wrong Answer

Solution code:

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

print((A//T)*B)

Submission status: Wrong Answer

Solution code:

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

print(A//T*B)

Submission status: Wrong Answer

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

print(B*(T/A))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count = (T + 0.5) // A
bsc = B * count

print(bsc)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
li = input().split()
A=int(li[0])
B=int(li[1])
T=int(li[2])
s=T*B//A
print(s)

Submission status: Wrong Answer

Solution code:
li = input().split()
A=int(li[0])
B=int(li[1])
T=int(li[2])
s=T*B//A
print(str(s))

Submission status: Wrong Answer

Solution code:
li = input().split()
A=int(li[0])
B=int(li[1])
T=int(li[2])
s=T*B/A
print(str(s))

Submission status: Wrong Answer

Solution code:
li = input().split()
s=(float(li[2])+0.5)*int(li[1])/int(li[0])
print(str(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

nums = range(1,20,1)
nums = list(map(lambda x: x * a, nums))

nums.append(t+0.5)
print(sorted(nums).index(t+0.5) * b)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
s = list(map(int, input().split()))
z=s[2]+0.5
q=z//s[0]
w=s[1]*q
print(w)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = c + 0.5

d = c // a

print(b * d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(map(int, input().split()))
z=round((s[2]+0.5)/s[0])
w=s[1]*z
print(w)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = [int(i) for i in input().split()]
print((l[2] + 0.5) // l[0] * l[1])

Submission status: Wrong Answer

Solution code:
def biscuit_generator(A: int, B: int, T: int)->int:
    return (A//T) * B


if __name__ == "__main__":
    A, B, T = map(int, input().split())
    ans = biscuit_generator(A, B, T)
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, T = map(int,input().split())
n = 1
for i in range(20):
  if T > i*A:
    n = n + 1
print(B*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, T = map(int, input().split())
i = 1
a = 1
count = 0

while T > a:
    a = A * i
    i += 1
    if T / a and T > a:
        count += 1
        print(a)
print(count*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = [int(i) for i in input().split()]
d = a % c
print(b * d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i , t in enumerate(range(20)):
    if i == 0 :
        continue;
    if i * a > T :
        break;
    result += b;

print(result)

Submission status: Wrong Answer

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

s = 0
while a < c + 0.5:
    s += b
    a += a
print(s)

Submission status: Wrong Answer

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

for i , t in enumerate(range(T)):
    if i == 0 :
        continue;
    if i * a > T :
        break;
    result += b;

print(result)

Submission status: Wrong Answer

Solution code:
a, b , t = map(int, input().split())  #複数数値入力
count = 0

for i in range(1,t):
    an = a * i
    if an >= t + 0.5:
        break
    count += 1
    

print(count * b)

Submission status: Wrong Answer

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

a=int(A)
b=int(B)
t=int(T)

print((t-(t%a))/a*b)

Submission status: Wrong Answer

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

a=int(A)
b=int(B)
t=int(T)

print((t-(t%a))/a*b)

Submission status: Wrong Answer

Solution code:
a, b , t = map(int, input().split())  #複数数値入力
count = 0

for i in range(1,t):
    an = a * i
    if an > t + 0.5:
        break
    count += 1
    

print(count * b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt=0
bcnt=0

for i in range(1,30):
    cnt+=i

    if cnt > T:
        break
    else:
        bcnt+=B

print(bcnt)

Submission status: Wrong Answer

Solution code:
a,b,t = (int(i) for i in input().split())
d = 0
k = 1
c = 0
if a>t :
    print(0)
else:
    while d<=t + 0.5:
        c = c + b
        d = d + k*a
        k = k + 1
    print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,t = (int(i) for i in input().split())
time = 0
num = 0
for i in range(1,20):
  time = i*a
  if time < t+0.5:
    num += b
  else:
    print(num)
    break

Submission status: Wrong Answer

Solution code:
a,b,t = (int(i) for i in input().split())
time = 0
num = 0
for i in range(1,20):
  time = i*a
  if time <= t+0.5:
    num += b
  else:
    print(num)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt=0
bcnt=0
for i in range(30):
    cnt+=i*A;
    if cnt > T:
        break;
    else:
        bcnt+=B
print(bcnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

a,b,t = [s for s in input().split(' ')]
a = int(a)
b = int(b)
t = int(t) + 0.5

ret = 0
while a < t:
  ret += b
  a += a

print(ret)

Submission status: Wrong Answer

Solution code:
import numpy as np

#入力
N = input()
#入力値を取り出す
A, B, T = np.array(list(map(int,N.split( ))))

T = T + 0.5
S = 0
n = 1
while(A<T):
  
  n = n + 1
  A = n * A
  S = S + B
print (S)

Submission status: Wrong Answer

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

t += 0.5
tot_bisc = 0
counter = 1

if a <= t:
    while t > 0:
        tot_bisc += b
        t -= (counter * a)
        counter += 1

print(tot_bisc)

Submission status: Wrong Answer

Solution code:
import math
#from functools import reduce
import functools

Submission status: Wrong Answer

Solution code:
# ビスケット生産装置を起動すると、起動してから A 秒後、2A 秒後、3A 秒後、
# ... (A の倍数秒後) に
# B枚ずつビスケットを生産します。
 
# ビスケット生産装置を起動してから T+0.5秒後までに生産されるビスケットの
# 合計枚数を求めてください。

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

cnt=1
sum=0
for i in range(T):
  if i == 0:
    continue
    
  if i % A*cnt == 0:
    sum=sum+B
    cnt=cnt+1
#    print(i,sum)
    
print(sum)

Submission status: Wrong Answer

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

t += 0.5
tot_bisc = 0
counter = 1

if a < t:
    while t > 0.5:
        tot_bisc += b
        t -= (counter * a)
        counter += 1

print(tot_bisc)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a=int(A)
b=int(B)
t=int(T)

p=t%a
p=t-p
p=p/a
p=p*b
print(p)

Submission status: Wrong Answer

Solution code:
import numpy as np
#入力
N = input()
#入力値を取り出す
A, B, T = np.array(list(map(int,N.split( ))))

T = T + 0.5
S = 0
while(A<T):
  A = 2*A
  S = S + B
print(S)

Submission status: Wrong Answer

Solution code:
a, b, t = map(int, '20 20 19'.split())
print(sum([b for _ in range(a, t + 1, a)]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t += 0.5
tot_bisc = 0
counter = 1

if a < t:
    while t > 0:
        tot_bisc += b
        t -= (counter * a)
        counter += 1

print(tot_bisc)

Submission status: Wrong Answer

Solution code:
import os, sys, re, math

inary = [int(s) for s in input().split(' ')]
t = inary[0]
ret = 0
while t < inary[2]:
  ret += inary[1]
  t += inary[0]

print(ret)

Submission status: Wrong Answer

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

t += 0.5
tot_bisc = 0
counter = 1

if a <= t and a > 0:
    while t >= 0.5:
        tot_bisc += b
        t -= (counter * a)
        counter += 1

print(tot_bisc)

Submission status: Wrong Answer

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

a=int(A)
b=int(B)
t=int(T)

p=t%a
p=t-p
p=p/a
print(p*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, t = map(int, input().split())
cnt = 0
for i in range(1,20):
    if a*i <= t+0.5:
        cnt = cnt + 1
    else:
        break
sum = b * cnt
print(sum)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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