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

Submission status: Wrong Answer

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

for i in range(2,t-1):
    if a > t+0.5:
        break

    count += b
    a = a * i

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

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

Submission status: Wrong Answer

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
s = 0
for X in range(1,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
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.5:
        tot_bisc += b
        t -= (counter * a)
        counter += 1

print(tot_bisc)

Submission status: Wrong Answer

Solution code:
print(sum)

Submission status: Wrong Answer

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
s = int()
for X in range(0,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
s = 0
for X in range(0,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
print(s)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
for X in range(0,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
print(s)

Submission status: Wrong Answer

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

print(a,b,t)

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
input = input()
sp_input = input.split(" ")
A = int(sp_input[0])
B = int(sp_input[1])
T = int(sp_input[2]) + 0.5

ret = B
i = 0
while A <= T:
  ret += B
  A += A


print(ret)

Submission status: Wrong Answer

Solution code:
a, b, t = list(map(int, input().split()))
#a, b, t = 20, 20, 19
total = 0

mul = 1
while mul * a >= t+0.5:
    total += b
    mul += 1

print(total)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, t = list(map(int, input().split()))
#a, b, t = 20, 20, 19
total = 0
for mul in range(1, a+1):
    if mul*a >= t+0.5:
        break
    total += b

print(total)

Submission status: Wrong Answer

Solution code:
a,b,T = input().split()
a = int(a)
b = int(b)
T = int(T)
for X in range(20):
  if a*X <= T + 0.5:
    b += b
  if a*X >T + 0.5:
    break
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
a, b, t = list(map(int, input().split()))
#a, b, t = 20, 20, 19
total = 0
for mul in range(1, a+1):
    if mul*a >= t+0.5:
        break
    total +=  b

print(total)

Submission status: Wrong Answer

Solution code:
def main(A, B, T):
    print(B*(T//A))
    return B*(T//A)

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
A = a[0]
B = a[1]
T = a[2]
bis = 0
time = 0
while T - A > 0:
  bis += B
  time += 1
  A = A * time
  T -= A
print(bis)

Submission status: Wrong Answer

Solution code:
List=[int(i) for i in input().split()]
ans = 0
counter = 1

for i in range(20):
    if counter % int(List[0]) == 0:
      ans += int(List[1])
    if counter >= int(List[2]) + 0.5:
      break
    counter += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, T = map(int, input().split())
if A ==0 or B == 0 or T == 0:
  print(0)
else:
  num = int(T / A) * B

  if T % A == 0:
    num -= B
  
  print(num)

Submission status: Wrong Answer

Solution code:
def main(A, B, T):
    print(B*(T//A))
    return

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
x=0
num=0
i=1
'''
for i in range(t+100):
    x+=a
    a=a*(i+1)
    if(x>t):
        break
    num+=b
'''
while x<t:
    x+=a
    a=a*(i+1)
    num+=b
    i+=1


print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,T = input().split()
a = int(a)
b = int(b)
T = int(T)
for X in range(20):
  if a*X <= T + 0.5:
    b = b + 1
  if a*X >= T + 0.5:
    break
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Wrong Answer

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

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

if t%a==0:
  p=(t/a)*b
  print(p)
else:
  q=((t-(t%a))/a)*b
  print(q)

Submission status: Wrong Answer

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

num = int(T / A) * B

if T % A == 0:
  num -= B
  
print(num)

Submission status: Wrong Answer

Solution code:
# coding:utf-8
A,B,T  = map(int, input().split())
bis = 0
for i in range(1,T):
	if i % A == 0:
		bis = bis + B
print(bis)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

C = T // A
D = A * C

print(D)

Submission status: Wrong Answer

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

for i in range(1,21):
  S=i*A
  if T<S:
    
    print((i-1)*B)
    exit()

Submission status: Wrong Answer

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


print(num)

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

for i in range(1,21):
  S=i*A
  if T<=S:
    
    print((i-1)*B)
    exit()

Submission status: Wrong Answer

Solution code:
import math
import sys


def parse(file):
    a, b, t = map(int, file.readline().split())
    return a, b, t


def main(a, b, t):
    k = 0
    while (k + 1) * a < t:
        k += 1
    return k * b


if __name__ == '__main__':
    print(main(*parse(sys.stdin)))

Submission status: Wrong Answer

Solution code:
List=[int(i) for i in input().split()]

counter = 1

ans = 0

for i in range(20):
    if i == 0:
      continue
    if i % int(List[0]) == 0:
      ans += int(List[1])
    if i >= int(List[2]) + 0.5:
      break
      
    counter += 1

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

# input
l = list(map(int, input().split()))

A = l[0] # Aの値が出力される
B = l[1] # Bの値が出力される
T = l[2] # Cの値が出力される

t = 0
created = 0

while 1:
    t += 1

    if t%A == 0:
        print("create t:", t)
        created += B

    if t >= T:
        break

print(created)

Submission status: Wrong Answer

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


print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(1,21):
  S=i*A
  if T<S:
    
    print((i-1)*B)
    exit()

Submission status: Wrong Answer

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

for i in range(1,21):
  S=i*A
  if T<S:
    
    print((i-1)*B)
    exit()
  if T>=S:
    print(S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print(num)

Submission status: Wrong Answer

Solution code:
list = [int (x) for x in input().split()]
a= list[0]
b= list[1]
c=list[2]
ans= (b*c)//a
print(ans)

Submission status: Wrong Answer

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

print(B_max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,T=map(int,input().split())
T=float(T)
sum=0
count=0.0
while  count<=T:
    count+=0.5
    if count>=A:
        sum+=B
        A+=A
print(sum)

Submission status: Wrong Answer

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

x =int((t+0.5)//a)*b

print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

# input
l = list(map(int, input().split()))

A = l[0] # Aの値が出力される
B = l[1] # Bの値が出力される
T = l[2] # Cの値が出力される

t = 1
created = 0

while 1:

    if A%t == 0:
        created += B

    t += 1
    if t >= T:
        break

print(created)

Submission status: Wrong Answer

Solution code:
def main(A, B, T):
    return print(B*(T//A))

Submission status: Wrong Answer

Solution code:
fq, num, max_time = map(int, input().split())
time = 0
_sum = 0
while 1:
    time += fq
    if(time >= max_time + 0.5):
        break
    else:
        _sum += num
        fq += fq
print(_sum)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
s=0
d = c +1//2
for num in range(a,d,a):
    s += b
    
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
anser = 0
a = 0
b = 0
t = 0
a, b, t = input().split()
if(a<=t):
  anser += 5
if(b<=t):
  anser += 5
print(anser)

Submission status: Wrong Answer

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

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:
a, b, t = (int(i) for i in input().split())  
print(int(t/(a*3))* b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = input().split()
list = [int(i) for i in l]
x = int(list[-1] / list[0])
num = list[1] * x

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

if A>T:
	print(0)
else:
	print(int(((T-0.5)/A)*B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = t + 0.5

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,T=input().split()
a=int(A)
b=int(B)
t=int(T)
if t%3==0:
  p=(t/3)*b
  print(p)
elif t%3==1:
  y=t-1
  q=y/3
  print(q*b)
else:
  z=t-2
  r=z/3
  print(r*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = 0
time = 0 
for i in range(20):
  time += (i) * A
  if time < T+0.5:
    s += B
  else:
    break
print(s)

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

Submission status: Wrong Answer

Solution code:
A,B,T=input().split()
a=int(A)
b=int(B)
t=int(T)
if t%3==0:
  p=(t/3)*b
  print(p)
elif t%3==1:
  y=t-1
  q=y/3
  print(q*b)
else:
  z=t-1
  r=z/3
  print(r*b)

Submission status: Wrong Answer

Solution code:
def biscuit_generator():
    number = [int(x) for x in input().split()]
    A = number[0]
    B = number[1]
    T = number[2]
    return int(((T + 0.5) // A) * B)

biscuit_generator()

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

def biscuit_generator(a, b, t):
    biscuit = 0
    n = 1
    t -= a
    while (t+0.5) > 0:
      biscuit += b
      n +=1

      t -= a * n
    return biscuit

print(biscuit_generator(A, B, T))

Submission status: Wrong Answer

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

def count(s):
    a = int(s[0])
    b = int(s[1])
    t = int(s[2])
    a_now = a
    sum_ = 0
    while a_now< t+0.5:
        sum_ += b
        a_now += a
    
    return t

print(count(li))

Submission status: Wrong Answer

Solution code:
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
d = c + 0.5
bis = 0
byou = 0

for i in range(20):
    byou = i * a
    if byou > d:
        break
    bis = i * b

print(bis)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while t + 0.5 > tt + a:
	c+= b
	tt += a	

	
print(c)

Submission status: Wrong Answer

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

a, b, t = map(int, input().split())
i = 1
time = 0
limit = t + 0.5
bisc = 0

while True:
    if time <= limit:
        time += a*i
        bisc += b
        i += 1
    else:
        break

print(bisc)

Submission status: Wrong Answer

Solution code:
l = input().split()
list = [int(i) for i in l]
x = list[-1] / list[0]
num = list[1] * x
print(num)

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:
n = input().split(" ")
 
a = int(n[0])
b = int(n[1])
t = int(n[2])
 
w = (t / a)
print(w * b)

Submission status: Wrong Answer

Solution code:
import sys


def parse(file):
    a, b, t = map(int, file.readline().split())
    return a, b, t


def main(a, b, t):
    k = 0
    while (k + 1) * a < t:
        k += 1
    return k * b


if __name__ == '__main__':
    print(main(*parse(sys.stdin)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
fq, num, max_time = map(int, input().split())
time = 0
_sum = 0
while time <= max_time + 0.5:
    _sum += num
    time += fq
    fq += fq
print(_sum)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

    i = 1
    sum = 0
    while(True):
        if (i > t + 0.5):
            break
        sum += b

        i *= a

    print(sum)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

for i in range(0, int(t+0.5), a):
    c += b

print(c)

Submission status: Wrong Answer

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


def main():
  a, b, t = map(int, input().split())
  c = 0
  s = 0

  while c <= t:
    c += a
    s += b
    a *= 2

  print(s, flush=True)


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

print(cookie)

Submission status: Wrong Answer

Solution code:
a, b, t = [int(i) for i in input().split()]
ans = 0
for i in range(1, 30):
    if t < i*a:
        break
    t = t - i*a
    ans += b
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
fq, num, max_time = map(int, input().split())
time = 0
_sum = 0
while time + 0.5 <= max_time:
    _sum += num
    time += fq
    fq += fq
print(_sum)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

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

for i in range(1,T):
    if A * i > T+0.5:
        print(ans)
        break
    ans+=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 ==0:
        ans = ans + b

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = int(t / a)

ans = a*c
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
time = 0
biscuit = 0
kakeru = 1

if c < a:
    print(0)
else:
    while time < c+0.5:
        biscuit += b
        time += a*kakeru
        kakeru += 1
    print(biscuit)

Submission status: Wrong Answer

Solution code:
a, b, t = [int(i) for i in input().split()]
ans = 0
for i in range(1, 20):
    if t < i*a:
        break
    t = t - i*a
    ans += b
print(ans)

Submission status: Wrong Answer

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

print(time)
print(b * time)

Submission status: Wrong Answer

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

ans = [i for i in range(1,20) if i%a == 0 and i<t+0.5]
print(len(ans)*b)

Submission status: Wrong Answer

Solution code:
x,y, T = map(int,input().split())

result = 0;
for i in range(1,T):
	if(i%x == 0):
		result += y;
	
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

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

print(biscket)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, t = (int(i) for i in input().split())  

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import bisect
from datetime import datetime as dt

a, b, t = map(int, raw_input().split())
c = 0
while float(a) <= float(t) + 0.5:
    c += b
    a += a
print c

Submission status: Wrong Answer

Solution code:
a,b,t=map(int,input().split())
print(max([b*i for i in range(4)if t+0.5>=a*i]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve(a, b, t):
    result = int(t/a) * b
    return result

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

    return a, b, t


def main():
    a, b, t = input_from_console()
    print(solve(a, b, t))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

total = 0

for i in range(1,20):

    if A * i < T + 1:
        total += B

print(total)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
time = 0
biscuit = 0
kakeru = 1

while time < c+0.5:
    biscuit += b
    time += a*kakeru
    kakeru += 1
    
print(biscuit)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
c += 0.5
print(c//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
import re
import bisect
from datetime import datetime as dt

a, b, t = map(int, raw_input().split())
c = 0
while a <= t:
    c += b
    a += a
print c

Submission status: Wrong Answer

Solution code:
a, b, t = map(int, input().split())
ans = 0
for i in range(100000000):
    if i * a <= t:
        ans += b
    else:
        exit(print(ans))

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

Submission status: Wrong Answer

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    #n=int(input())
    a,b,t= map(int, sys.stdin.readline().split(' '))
    ans=0
    p=0
    while(p<t+0.5):
        p+=a
        ans+=b
    print(ans)
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Wrong Answer

Solution code:
a, b, t = map(int, input().split())
ans = 0
for i in range(100000000):
    if i * a >= t:
        ans += b
    else:
        exit(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())
n = (T+0.5)//A
print(B*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import time

time.sleep(2)
print(4)

Submission status: Time Limit Exceeded

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

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