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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

num_prd = T//A
answer = num_prd*B

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

Submission status: Wrong Answer

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

num_prd = T//A
answer = num_prd*B

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

Submission status: Wrong Answer

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

print(a + b * t)

Submission status: Wrong Answer

Solution code:
#ABC125 A
A,B,T = list(map(int, input().split()))
ans = 0
for i in range(1, T):
    if i * A < T+0.5:
        ans += B
print(ans)

Submission status: Wrong Answer

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

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())
res = 0
for _ in range(A // T):
  res += B
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

S=T+0.5

C=S//A

print(C*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
cookie = 0
for x in range(c):
  if x % a == 0 and x != 0:
    cookie += b
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a > t:
    print(0)
else:
    ans = t // 3 *b
    print(ans)

Submission status: Wrong Answer

Solution code:
A, B, T = map(int,input().split())
N=0
for i in range(A,T+1,3):
    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:
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
while a<t+0.5:
  ans+=b
  a+=a
else:
  print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
 
ans=[]
while a<=t+0.5:
  ans.append(b)
  a+=a
  
print(sum(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,t = map(int, input().split())
 
print(int((t+0.5)/a*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:
#coding: utf_8
a,b,t =[int(i) for i in input().split()]

# 経過時間tp 作られたビスケットbm
tp = 0
bm = 0

i = 1

for i in range(20):
  if tp <= t:
    bm += b
    tp += i * a
    i += 1
  
print(bm)

Submission status: Wrong Answer

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

# 経過時間tp 作られたビスケットbm
tp = 0
bm = 0

i = 1

while tp <= t:
  bm += b
  tp += i * a
  i += 1
  
print(bm)

Submission status: Wrong Answer

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

# 経過時間tp 作られたビスケットbm
tp = 0
bm = 0

i = 1

while tp < t:
  bm += b
  tp += i * a
  i += 1
  
print(bm)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

main()

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:
def biscuit(a,b,t):
    n = 0
    for i in range(1,round(t+0.5)):
        if i%a == 0:
            n += b

    print("%d" %n)

if __name__ == '__main__':
    string = input().split()
    biscuit(int(string[0]),int(string[1]),int(string[2]))

Submission status: Wrong Answer

Solution code:

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

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

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(a,21,a):
    if i > t+0.5:
        print(c)
        break
    
    c+=b

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

biscuits = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, t = LI()
    print(b * t // a)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if T < A:
  print(0)
else:
  print(B*T//A)

Submission status: Wrong Answer

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

if T <= A:
  print(0)
else:
  print(B*int(T/A))

Submission status: Wrong Answer

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

if T <= A:
  print(0)
else:
  print(B*(T//A))

Submission status: Wrong Answer

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

if T <= A:
  print(0)
else:
  print(B*T//A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
Biscuit_factory_0, Biscuit_factory_1, Biscuit_factory_2 = (int(a)for a in input().split())

Production_time = Biscuit_factory_0 * 2

if Production_time <= Biscuit_factory_2:
    print(Production_time)
else:
    print(Biscuit_factory_2)

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, a+1):
    if a * i <= t + 0.5:
        ans += b
print(ans)

Submission status: Wrong Answer

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

num = T + 0.5 // A

print(num * 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, c = map(int, input().split())
c += 0.5

while True:
  a *= 2
  b += b
  
  if a  <= c:
    break

print(b)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
c += 0.5
d = 1

while True:
  d += 1
  a *= d
  b += b
  
  if a < c:
    break

print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a,b,t = map(int, input().split())
cnt = 0
while a <= t:
    cnt += b
    a *= 2
print(cnt)

Submission status: Wrong Answer

Solution code:
0

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

print((t+0.5)//a*5)

Submission status: Wrong Answer

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

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

print(number)

Submission status: Wrong Answer

Solution code:
A,B,T = map(int,input().split())
cnt = 0
n = A
while n <= T:
  n *= 2
  cnt += B
print(cnt)

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 30 18:00:51 2019

@author: またの
"""

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

C = (T + 1/2)//A
ans = B*C

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

if isinstance(A,int) and isinstance(B,int) and isinstance(T,int) :
    num_biscuit=0

    if 1<=A<=20 and 1<=B<=20 and A<=T<=20:
        # num_biscuit=(T+0.5)*(math.floor(B/A))                                            
        for i in range(math.floor(T/A)):
            num_biscuit=num_biscuit+B
            print(num_biscuit)
    else :
        print(0)

else :
    print("ERROR")
    exit()

Submission status: Wrong Answer

Solution code:
import math

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

num_biscuit=0

if 1<=A<=20 and 1<=B<=20 and A<=T<=20:
    # num_biscuit=(T+0.5)*(math.floor(B/A))                                                
    for i in range(math.floor(T/A)):
        num_biscuit=num_biscuit+B
    print(num_biscuit)

else :
    print("ERROR")
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for t in range(21):
    if t * A > T + 0.5:
        print((t-1) * B)
        break

Submission status: Wrong Answer

Solution code:
def Main(A, B, T):

    n = (T + 0.5) // A
    tot_biscuits = B * n


    return int(tot_biscuits)

Submission status: Wrong Answer

Solution code:
import math


def Main(A, B, T):

    n = (T + 0.5) // A
    tot_biscuits = B * n

    
    return int(tot_biscuits)

Submission status: Wrong Answer

Solution code:
import math


def main(A, B, T):

    n = (T + 0.5) // A
    tot_biscuits = B * n

    
    return int(tot_biscuits)


if __name__ == "__main__":
    answer = main(3, 2,  9)
    print(answer)

Submission status: Wrong Answer

Solution code:
import math


def Main(A, B, T):

    n = (T + 0.5) // A
    tot_biscuits = B * n

    print(tot_biscuits)
    return  int(tot_biscuits)


if __name__ == "__main__":
    Main(3, 2,  9)

Submission status: Wrong Answer

Solution code:
import math


def Main(A, B, T):

    n = (T + 0.5) // A
    tot_biscuits = B * n

    print(tot_biscuits)
    return  tot_biscuits


if __name__ == "__main__":
    Main(3, 5,  7)

Submission status: Wrong Answer

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

if a > t:
    print(0)
elif a == t:
    print(b)
else:
    n = 2
    while (a * n) < t:
        n += 1
    print(b * (n-1))

Submission status: Wrong Answer

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

if a > t:
    print(0)
else:
    n = 1
    while (a * n) < t:
        n += 1
    print(b * (n-1))

Submission status: Wrong Answer

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

for n in range(20):
    if a > (t + 0.5):
        print(0)
        break
    elif a < (t + 0.5):
        if (a * n) >= (t + 0.5):
            print(int(b * (n-1)))
            break
        if (a * n) < (t + 0.5):
            continue

Submission status: Wrong Answer

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

for n in range(20):
    if a > (t + 0.5):
        print(0)
        break
    elif a < (t + 0.5):
        if (a * n) > (t + 0.5):
            print(int(b * (n-1)))
            break
        if (a * n) < (t + 0.5):
            continue

Submission status: Wrong Answer

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

for n in range(20):
    if a > (t + 0.5):
        print(0)
    elif a < (t + 0.5):
        if (a * n) > (t + 0.5):
            print(int(b * (n-1)))
            break
        if (a * n) < (t + 0.5):
            continue

Submission status: Wrong Answer

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

for n in range(20):
    if a < (t + 0.5):
        if (a * n) > (t + 0.5):
            print(int(b * (n-1)))
            break
        if (a * n) < (t + 0.5):
            continue

Submission status: Wrong Answer

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

for n in range(20):
    if a < (t + 0.5):
        if (a * n) > (t + 0.5):
            print(b * (n-1))
            break
        if (a * n) < (t + 0.5):
            continue

Submission status: Wrong Answer

Solution code:
A,B,T = map(int,input().split())
for i in range(0,21):
    if (T+0.5)-A*i < 0:
        print(A*(i-1))
        break

Submission status: Wrong Answer

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

sum = 0

while a < t+0.5:
    sum += b
    a += 3

print(sum)

Submission status: Wrong Answer

Solution code:
import math

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

freq = math.floor(((T+0.5)/A))

print(A*freq)

Submission status: Wrong Answer

Solution code:
biscuit_make = input().split()
A = biscuit_make[0]
B = biscuit_make[1]
T = biscuit_make[2]
T = int(T)                          # TをInt型に
result = []                         # 空のリストresultを作成
for num in range(T):                # for文でT回Aに掛けていく

    num2 = num * int(A)             # 掛けた結果をnum2に格納
    if num2 <= T + 0.5:             # num2が(T+0.5)以下であればresultに格納
        result.append(num * int(B))
    else:
        result.append(0)
print(max(result))                  # 結果の最大値を出力

Submission status: Wrong Answer

Solution code:
biscuit_make = input().split()
A = biscuit_make[0]
B = biscuit_make[1]
T = biscuit_make[2]
time = [1, 2, 3, 4, 5, 6, 7, 8, 9]  # 秒数をリスト化
T = int(T)                          # TをInt型に
result = []                         # 空のリストresultを作成
for num in time:                    # for文でtime配列をAに掛けていく

    num2 = num * int(A)             # 掛けた結果をnum2に格納
    if num2 <= T + 0.5:             # num2が(T+0.5)以下であればresultに格納
        result.append(num * int(B))
    else:
        result.append(0)
print(max(result))                  # 結果の最大値を出力

Submission status: Wrong Answer

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

k=a
sum=0
cnt=0
while k<=t+0.5:
	sum+=b
	cnt=cnt+1
	k+=cnt*a
	
print(sum)

Submission status: Wrong Answer

Solution code:
biscuit_make = input().split()
A = biscuit_make[0]
B = biscuit_make[1]
T = biscuit_make[2]
time = [1, 2, 3, 4, 5, 6, 7, 8, 9]
T = int(T)
result = []
for num in time:
    num2 = num * int(A)
    if num2 <= T + 0.5:
        result.append(num * int(B))
    else:
        result.append(0)
print(max(result))

Submission status: Wrong Answer

Solution code:
A = input()
print(A)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,b,t=map(int,input().split(" "))
count=0
tt=0
while tt<=t+0.5:
  count=count+1
  tt=tt+count*a
print(b*(count-1))

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 = input().split()
A = int(A)
B = int(B)
T = int(T)

t = T + 0.5
bisket = t // A * B

print(bisket)

Submission status: Wrong Answer

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

t = T + 0.5
k = t // A
bisket = k * B

print(bisket)

Submission status: Wrong Answer

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

t = T + 0.5
k = t // A
bisket = k * B

print(bisket)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a > t+0.5 : 
	print("0")
else :
	n = int(t/a)
	amari = float(t/a-n+0.5)
	if int(amari) > 0 :
		n += int(amari)
	print(n*b)

Submission status: Wrong Answer

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

if a > t : 
	print("0")
else :
		
	n = int(t/a)
	amari = float(t/a-n+0.5)
	if int(amari) > 0 :
		n += int(amari)

	print(n*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def biscuit(A,B,T):
  	(T/A)*B

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
into = input()
into = into.split()
A = int(into[0])
B = int(into[1])
C = int(into[2])

coef = 1

while C + 0.5 > (coef + 1) * A:
    coef += 1

print(B * coef)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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


def algorithm(A: int, B: int, T: int):
    x = int((T + 0.5) / A)
    return x*B

problem()

Submission status: Wrong Answer

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

a = abt[0]
b = abt[1]
t = abt[2]

t05 = t + 0.5
times = t05 // a

total = b * times

print(str(total))

Submission status: Wrong Answer

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

a = abt[0]
b = abt[1]
t = abt[2]

t05 = t + 0.5
times = t05 // a

total = b * times

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:
from functools import reduce
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())
biscuit = 0

if a == 0 or b == 0 or t == 0:
    pass
elif t>a:
    x = t//a
    biscuit = x * b

print(biscuit)

Submission status: Wrong Answer

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

if a == 0:
    pass
elif t>a:
    x = t//a
    biscuit = x * b
else:
    pass

print(biscuit)

Submission status: Wrong Answer

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

if a == 0:
    pass
elif t>a:
    for i in range(a, t+1):
        if i % a == 0:
            biscuit += b
        else:
            pass
else:
    pass

print(biscuit)

Submission status: Wrong Answer

Solution code:

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

if t>a:
    for i in range(a, t+1):
        if i % a == 0:
            biscuit += b
        else:
            pass
else:
    pass

print(biscuit)

Submission status: Wrong Answer

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

def main(A,B,T):
    time = A
    sum = 0
    while time <= T+0.5:
        if time%A == 0:
            sum += B
            time += 1
    print(sum)
    return 0

Submission status: Wrong Answer

Solution code:
def main(A,B,T):
    time = A
    sum = 0
    while time <= T+0.5:
        if time%A == 0:
            sum += B
            time += 1
    print(sum)
    return 0

Submission status: Wrong Answer

Solution code:
def Biscuit_Generater(A,B,T):
    time = A
    sum = 0
    while time <= T+0.5:
        if time%A == 0:
            sum += B
            time += 1
    print(sum)
    return 0

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
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())
print((t%a)*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(A/T)*B)

Submission status: Wrong Answer

Solution code:
def biscuit(inputs):
  number=inputs[2]//inputs[0]*inputs[1]
  return number

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

biscuit(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A= 3
B= 5
T= 7

sum=0

for num in range(0,T,A):
  if(num%A==0 and num != 0):
        sum+=B
print(sum)

Submission status: Wrong Answer

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

Tmax = T + 0.5

count = B * A // T

print(count)

Submission status: Wrong Answer

Solution code:
A, B, T = map(int, input().split())
for i in range(20):
    if A * i < (T + 0.5):
        continue
    else:
        print(B * (i - 1))
        break

Submission status: Wrong Answer

Solution code:
print("!!")

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
A = a[0]
B = a[1]
T = a[2]
(T+0.5)//A*B

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
A = a[0]
B = a[1]
T = a[2]
((T+0.5)//A)*B

Submission status: Wrong Answer

Solution code:
# coding:UTF-8

# 入力値の受け取り
'''
input_list[0]→A
input_list[1]→B
input_list[2]→T
'''
input_list = input().split()

num_A = int(input_list[0])
num_B = int(input_list[1])
num_T = int(input_list[2])

# 合計枚数の算出
print((num_T + 0.5) // num_A * num_B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(((t+0.5)//a)*5)

Submission status: Wrong Answer

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

print((t//a)*5)

Submission status: Wrong Answer

Solution code:
A, B, T = map(int, input().split())
N=(T+1)//A
M=(T+1)%A
if M == 0:
    print(B*(M-1))
else:
    print(B*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
A, B, T = [int(x) for x in stdin.readline().rstrip().split()]
print(B*T/A)

Submission status: Wrong Answer

Solution code:
from sys import stdin  
A, B, T = [int(x) for x in stdin.readline().rstrip().split()]
print(int((0.5 + T)*B/A))

Submission status: Wrong Answer

Solution code:
from sys import stdin
A, B, T = [int(x) for x in stdin.readline().rstrip().split()]
print(int((0.5 + T)*B/A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
s = input().split()

A=int(s[0])
B=int(s[1])
C=int(s[2])

tmp=C/A + 0.5
if A > C:
  answer = 0
else:
  answer = math.floor(tmp) *B
print(answer)

Submission status: Wrong Answer

Solution code:
#import sys,os

#f = open('a.txt', 'r')
#sys.stdin = f

li = list(input().split())

A=int(li[0])
B=int(li[1])
T=int(li[2])

print(B*(T/A))

Submission status: Wrong Answer

Solution code:
hoge = input()
a, b, t = [int(x) for x in hoge.split(' ')]
print(((t+1)%a)*b)