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

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())
bis = 0
for i in range(1,20):
    time = a * i
    if time < t + 0.5:
        bis += b
print(bis)

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

Submission status: Wrong Answer

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


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


def main():
    a, b, k = Input()
    ans = 0
    for i in range(1, k, a):
        ans += b
    print(ans)


main()

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
print(b*n*(n+1)//2)

Submission status: Wrong Answer

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

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())
time = 0
cnt = 0
while time < T + 0.5:
    time += A 
    cnt += B 
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(the_number_of_biscuits)

Submission status: Wrong Answer

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

T = t + 0.5

print((T // a)*b)

Submission status: Wrong Answer

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

if A > T:
    pass
elif A == T:
    cnt += 1
else:
    while tc < T + 0.5:
        n += B
        cnt += 1
        tc += cnt*A

print(n)

Submission status: Wrong Answer

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

if A >= T:
    pass
else:
    while tc < T + 0.5:
        n += B
        cnt += 1
        tc += cnt*A

print(n)

Submission status: Wrong Answer

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

if A > T + 0.5:
    pass
else:
    while tc < T + 0.5:
        n += B
        cnt += 1
        tc += cnt*A

print(n)

Submission status: Wrong Answer

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

if A > T:
    pass
else:
    while tc <= T:
        n += B
        cnt += 1
        tc += cnt*A

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

a,b,t=I()
if a > t:
    print(0)
    sys.exit()
time=0
cnt=1
while t+0.5 > time:
    ans +=b
    time+=a*cnt
    cnt+=1

print(ans)

Submission status: Wrong Answer

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

a,b,t=I()
time=0
cnt=1
while t+0.5 > time:
    ans +=b
    time+=a*cnt
    cnt+=1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

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

print(cout)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(cnt*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(b*(a//t))

Submission status: Wrong Answer

Solution code:
a,b,t = map(int,input().split())
if t + 0.5 < a:
    print('0')
elif a<= t + 0.5 < 2*a:
    print(b)
elif 2*a <= t + 0.5 < 3*a:
    print(2*b) 
else:
    print(3*b)

Submission status: Wrong Answer

Solution code:
a,b,t = map(int,input().split())
if t < a:
    print('0')
elif a<= t < 2*a:
    print(b)
elif 2*a <= t < 3*a:
    print(2*b) 
else:
    print(3*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, t = rm()
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())
cnt=0
c=a
for i in range(a,t,c):
  cnt=cnt+b
print(cnt)

Submission status: Wrong Answer

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

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=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())
a=T+0.5
b=(a//A)
print(b*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

turn = t // a
count = a * turn

print(count)

Submission status: Wrong Answer

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

turn = (t + 0.5) // a
count = b * turn

print(count)

Submission status: Wrong Answer

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

turn = (t + 0.5) // a
count = a * turn

print(count)

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

Submission status: Wrong Answer

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

for i in range(1,90):
  if i*a > t+ (1/2):
    ans = i-1
    break
    
for j in range(1,i):
  sum += j*b
  
  
print(sum)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
a=float(a)
t=float(t)
c=0
n=2.0
while True:
    if a<=t+0.5:
        c+=b
        k=a*n
        a=k
        n+=1.0
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
a,b,t=map(float,input().split())
c=0
n=2.0
while True:
    if a<=t+0.5:
        c+=b
        k=a*n
        a=k
        n+=1.0
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
a,b,t=map(float,input().split())
c=0
n=2
while True:
    if a<=t+0.5:
        c+=b
        k=a*n
        a=k
        n+=1
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
c=0
n=2
while True:
    if a<=t+0.5:
        c+=b
        a=a*n
        n+=1
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
c=0
n=2
while True:
    if a<=t:
        c+=b
        a=a*n
        n+=1
    else:
        break
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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


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

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 = b
c = a
if a  > t -1 :
    print(0)
    exit()
while True:
    ans += b
    c += a
    if c  > t + 1:
        ans -= b
        break
print(ans)

Submission status: Wrong Answer

Solution code:
a, b, t = map(int, input().split())
ans = b
c = a
if a > t:
    print(0)
    exit()
while True:
    ans += b
    c += a
    if c  > t + 1:
        ans -= b
        break
print(ans)

Submission status: Wrong Answer

Solution code:
print(sum(max(x-y,0)for x,y in zip(*[map(int,t.split())for t in open(0)][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=map(int,input().split());print(T/A*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,t = map(int, input().split())
print(b*((t+0.5)//a))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=len([i for i in range(1,c) if i%a==0])
print(b*n)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=len([i for i in range(c) if i%a==0])
print(b*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t += 0.5

print(b*(t//a))

Submission status: Wrong Answer

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

t += 0.5
set_su = t // a

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

A, B, T = MAP()
i = 0
t = 0
ans = 0

if A > T + 0.5:
	print(0)
	exit()

while t < T+0.5 :
	ans += 1
	t += A*ans

print(ans*B)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(int(B/A * T))

Submission status: Wrong Answer

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

print(int(B/A) * T)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print( (T+1//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 = t//a*5
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

T = T + 0.5

times = T // A

print(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:
a,b,t = map(int,input().split())
now = 0
ans = 0
while now < t:
  ans += b
  now += a
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(round(T/a)*b)

Submission status: Wrong Answer

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

    return 0


if __name__ == '__main__':
    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:
a, b, t = map(int, input().split())
c = 0
while a <= t + 0.5:
  c +=b
  a*=2
print(c)

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,D=map(int,input().split())
count=0
D+=0.5
while True:
    if D-A>=1:
        count+=1
        D-=A
    else:
        print(count*B)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

t = 1
ans = 0

if A > T:
    print(0)
    sys.exit()

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

print(ans)

Submission status: Wrong Answer

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

A, B, T = MAP()

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
first = input().split(' ')
per_time = int(first[0])
per_make = int(first[1])
time = int(first[2]) + 0.5

made = int(per_make / per_time * time)

print(made)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
d=0
e=1
while 1:
  a*=e
  if c+0.5>a:
    e+=1
    
    d+=b
  else:
    break
print(d)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
d=0
e=1
while 1:
  if c+0.5>a:
    a*=e
    e+=1
    d+=b
  else:
    break
print(d)

Submission status: Wrong Answer

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

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:
import math
A, B, T = map(int, input().split())

print(int(math.floor(T / A) + B))

Submission status: Wrong Answer

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

if A < T:
    x = 0
    for i in range(1, T, A):
        x += B
    print(x)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
import sys
import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print t/b*a

Submission status: Wrong Answer

Solution code:
import math

a, b, t = [int(x) for x in input().split()]
print(math.ceil((t + 0.5) % a) * b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(1,20):
  if a*i*(i+1)/2 >=t+0.5:
    if i==1:
      print(0)
      break
    else:
      print(b*i)
      break

Submission status: Wrong Answer

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

for i in range(1,20):
  if a*i*(i+1)/2 >t+0.5:
    if i==1:
      print(0)
      break
    else:
      print(b*i)
      break

Submission status: Wrong Answer

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

for i in range(1,20):
  if a*i*(i+1)/2 >t+0.5:
    print(b*i)
    break

Submission status: Wrong Answer

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

for i in range(1,20):
  if i*(i+1)/2 >t+0.5:
    print(b*(i-1))
    break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    A, B, T = map(int, input().split(" "))
    result = 0
    if T > A:
        while T > A - 1:
            result += B
            T -= A
    print(result)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    A, B, T = map(int, input().split(" "))
    result = 0
    if T > A:
        while T > 0:
            result += B
            T //= A
    print(result)


if __name__ == '__main__':
    main()

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+0.5)//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())

total_t = 0
i = 0
ans = 0

while total_t < t+1/2:
  total_t += (i+1)*a
  ans += b
  i += 1
  
print(ans if i>1 else 0)

Submission status: Wrong Answer

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

total_t = 0
i = 1
ans = 0

while total_t < t+1/2:
  total_t += i*a
  ans += b
  i += 1
  
print(ans)

Submission status: Wrong Answer

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

sum = 0
sum = sum + ((T+1)//A)*B
print(sum)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lst = list(map(int,input().split()))
a,b,c = lst[0],lst[1],lst[2]
if a > b:
    print(0)
else:
    print((c//a) * b)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(round(t+0.5)):
    if (i+1) % a == 0:
        biscut += b;

print(biscut)

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 solve():
    a,b,t = map(int, input().split())
    for i in range(1,t):
        if i*a == t:
            print(b*t//a)
            exit()
        elif i*a > t:
            print(b*(i-1))
            exit()
            

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
def solve():
    a,b,t = map(int, input().split())
    for i in range(1,t):
        if i*a > t+0.5:
            print(b*(i-1))
            exit()
            

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
def solve():
    a,b,t = map(int, input().split())
    for i in range(1,t):
        if a*i>t+0.5:
            print(b*(i-1))
            exit()

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = 0
i = 0 - A[1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
print(0 if a>t else 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+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:
s=list(input().split())
a=int(s[0])
b=int(s[1])
c=int(s[2])

print(int(b*c/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while time + a < t + 1/2:
  time += a

print(b*time)

Submission status: Wrong Answer

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

while time + a < t + 1/2:
  time += a

time += a
print(b*time)

Submission status: Wrong Answer

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