Problem:


Score : 100 points

Problem Statement

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

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

Constraints

All values in input are integers.

1 \leq A, B, T \leq 20

Input

Input is given from Standard Input in the following format:

A B T

Output

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

Sample Input 1

3 5 7

Sample Output 1

10

Five biscuits will be produced three seconds after activation.

Another five biscuits will be produced six seconds after activation.

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

Sample Input 2

3 2 9

Sample Output 2

6

Sample Input 3

20 20 19

Sample Output 3

0



Sample input:
3 5 7


Sample output:
10

Submission status: Accepted

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

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

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

print(bisc)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A,B,T=[int(i) for i in input().split()]
c=math.floor((T+0.5)/A)
print(c*B)

Submission status: Accepted

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

ABT = input().split(' ')
A = int(ABT[0])
B = int(ABT[1])
T = int(ABT[2])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(t / a) * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
argA,argB,argT = list(map(int,input().split()))
print(int(argT / argA) * argB)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split()) #三個の数
biscuit = 0
i = A
while i <= T + 0.5:
  biscuit += B
  i += A
print(biscuit)

Submission status: Accepted

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

print(t//a*b)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
a, b, t = input().strip().split(' ')
a, b, t = [int(a), int(b), int(t)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
x = x.split(" ")
a = int(x[0])
b = int(x[1])
c = int(x[2])
n = c // a 
print(n * b)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

times = T//A
ans = B * times

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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
        if time > c+0.5:
            biscuit -= b
            break
    print(biscuit)

Submission status: Accepted

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

Submission status: Accepted

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

tt = t+0.5

print(int(tt/a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

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

	
print(c)

Submission status: Accepted

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

count_a = (int(t) + 0.5) / int(a)

total = int(count_a) * int(b)

print( int(total))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
time = 0
sum = 0
while a[2] >= time + a[0]:
    sum += a[1]
    time += a[0]
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print( int(T/A)*B )

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

times = int(t / a)

print(times*b)

Submission status: Accepted

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

Submission status: Accepted

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

num = int(T/A)

print(num*B)

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    a = int(token[0])
    b = int(token[1])
    t = int(token[2])

    return (a, b, t)


def solve(a, b, t):


    return t // a * b


def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

print(bsk_cnt)

Submission status: Accepted

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


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

  print((t // a) * b, flush=True)


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

num = B * math.floor((T + 0.5)/A)

print(num)

Submission status: Accepted

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

c=int((t+0.5)/a)

print(c*b)

Submission status: Accepted

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

print(T // A * B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(t+1):
    if i != 0 and i % a == 0:
        sum += b

print(sum)

Submission status: Accepted

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

if not(t < a):
    sum = int(b * int((t / a)))

print(sum)

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
A_count = 0
while T >= A:
    T -= A
    A_count += 1
    
print(A_count*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
 # A - Biscuit Generator
 
a, b, t = map(int, input().split())
a_ = a
cookie=0
while a_ < t+0.5:
	cookie += b
	a_  += a

print(cookie)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

div = C // A
print(div * B)

Submission status: Accepted

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

time=0
out=0

while True:
  time+=A
  if T < time:
    break
  out+=B

print(out)

Submission status: Accepted

Solution code:
x = input().split()
a, b,t = int(x[0]),int(x[1]),int(x[2])
t += 0.5
num = t//a
sum = int(num * b)
print(sum)

Submission status: Accepted

Solution code:
A, B, T = [int(i) for i in input().split()]
count = 0
for t in range(T//A):
    count += B
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
input=stdin.readline().rstrip().split()
#print(input)
for i in range(len(input)):
    input[i]=int(input[i])

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

x=0
output=0
while x<100:
    x+=A
    if x>T:
        break
    output+=B

print(output)

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
i = 1
count = 0
while i <= T:
    if i % A == 0:
        count += B
    i += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sum = ( (T + 0.5) / A )

print(int(sum)*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

bisket = math.floor((T / A))* B

print(bisket)

Submission status: Accepted

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

A = int(A)
B = int(B)
T = float(T) + 0.5

t = T // A

print(int(B * t))

Submission status: Accepted

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

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

bisk = 0
for t in range(T):
    t = t + 1
    if t % A == 0:
        bisk += B
    else:
        continue

print(bisk)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(t//a * b)

Submission status: Accepted

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

c = t // a

ans = b*c
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
  if 'get_ipython' not in globals():  
    # For Subsession
    A,B,T = map(int, input().split())
  else:
    # A = 3
    # B = 5
    # T = 7
    # A,B,T = 3,2,9
    A,B,T = 20,20,19
  
  print(T//A*B)
    
main()

Submission status: Accepted

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

ans = 0
now = 1

while t + 0.5 > a * now:
    ans += b
    now += 1

print(ans)

Submission status: Accepted

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

print(int(t/a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

print((T//A)*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(cookie)

Submission status: Accepted

Solution code:
import math

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

result = math.floor(((t+0.5)/a))*b

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#conding utf-8
ABT =input().split()
a = int(ABT[0])
b = int(ABT[1])
t = int(ABT[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
raw_input = input()
a, b, t = map(int, raw_input.split())
counter = (t+0.5)//a #クッキを焼く回数
number = b * counter #枚数
print('%d' % number)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (T // a) *b

print(ans)

Submission status: Accepted

Solution code:
a, b, T = map(int, input().split(" "))
print("{}".format(int((T+0.5)//a)*b))

Submission status: Accepted

Solution code:
#ABC125A-BiscuitGenerator.py

from sys import stdin

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

C = T // A

print(C * B)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    input_list = list(map(int, input().split()))
    A = input_list[0]
    B = input_list[1]
    T = input_list[2]

    cnt = int(T+0.5)//int(A)
    answer = 0

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

    print(answer)

Submission status: Accepted

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

x = (t + 0.5) // a

print(int(b * x))

Submission status: Accepted

Solution code:
import numpy as np

if __name__ == "__main__":
    a, b, t = map(int, input().split())
    print(b * (t // a))

Submission status: Accepted

Solution code:
# coding: utf-8

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

print(T // A * B)

Submission status: Accepted

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

total = 0

for i in range(1, 1000):

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

print(total)

Submission status: Accepted

Solution code:
a, b, t = (int(i) for i in input().split())
x=1
flag=True
while(flag):
    if(x*a>t):
        flag=False
    x+=1
print(b*(x-2))

Submission status: Accepted

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

time = 0
c = 0

while True:
    time += a
    if time <= t:
        c += b
    else:
        break

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
while True:
    try:
        listA=list(map(int,input().split()))
    except:
        break;
value = int((listA[2]+0.5)/listA[0])
print(listA[1] * value)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, T = map(int, input().split())
ans = int((T + 0.5) // A * B)
# 出力
print("{}".format(ans))

Submission status: Accepted

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

print(b*(t//a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def split_returner(chardata):
        chardata = str(chardata).split(" ")
        for i in range(0,len(chardata)):
            chardata[i] = int(chardata[i])
        return chardata

a = split_returner(input())
result = int((a[2]+0.5)/a[0]) * a[1]
print(result)

Submission status: Accepted

Solution code:

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

make_time = data[0]
num = data[1]
limit = data[2]

make_num = 0
for t in range(limit + 1):
    if t % make_time == 0 and t != 0:
        make_num += num

print(make_num)

Submission status: Accepted

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

print((T // A)*B)

Submission status: Accepted

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


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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t = (t+0.5)//a


bbb = int(t*b)

print(bbb)

Submission status: Accepted

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

x=math.floor((T+0.5)/A) *B

print(x)

Submission status: Accepted

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

print((T // A) * B)

Submission status: Accepted

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

ans=0
for k in range(1,21):
	if k*A<=T:
		ans+=B

print ans

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((cnt-1)*B)

Submission status: Accepted

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

bis = 0

for i in range(1, T+1):
    if i % A == 0:
        bis += B

print(bis)

Submission status: Accepted

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

print((T//A)*B)

Submission status: Accepted

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

ans = 0
for i in range(a,10**10,a):
    if i >= t + 0.5:
        break
    ans += b

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i = input().split()
a = float(i[0])
b = float(i[1])
t = float(i[2])
f = True
n = 0
while(f):

    if t  + 0.5 < n * a:
       f = False
       break
    n = n + 1
n = n-1
print(int(n * b))

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read() for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


A, B, T = read_ints()

print(B*(T//A))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

while i <= t:
    cnt += b
    i += a 


print(cnt)

Submission status: Accepted

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

x = (T + 0.5) / A
y = math.floor(x)

ans = y * B

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split())) #input from array of integer like "1 2 3"
print((a[2]//a[0])*a[1])

Submission status: Accepted

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

ans = 0
s = 1
while True:
    if s % A == 0:
        ans += B
    s += 1
    if s > T + 0.5:
        break

print(ans)

Submission status: Accepted

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

print(int(T/A) * B)

Submission status: Accepted

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

Submission status: Accepted

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

# input
# 5 3

A, B, T = [int(i) for i in input().split()]

time = T/A

if time < 0:
    ans = 0
else:
    ans = B*int(time)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

m = int(t / a)

print(m * b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

res = 0

if A <= T:
    for i in range(T//A):
        res+=B
    print(res)
else:
    print(0)

Submission status: Accepted

Solution code:
from collections import Counter
from functools import reduce
import bisect
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]  # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()]  # LIST FLOAT
def LS(): return sys.stdin.readline().split()  # LIST STRING
def MI(): return map(int, sys.stdin.readline().split())  # MAP INT
def II(): return int(sys.stdin.readline())  # INPUT INT
def IS(): return input()  # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers):  # Greatest Common Divisor
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):  # Least Common Multiple
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))


a, b ,t = MI()
sum = 0
for i in range(a,t+1,a):
    sum += b
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x=(t+0.5)//a

print(round( x*b))

Submission status: Accepted

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

b = 0
s = 0
i = 1
while True:
  s = int(A)*i
  if float(s) > float(T)+0.5:
    break
  i+=1
  b += int(B)
print(b)

Submission status: Accepted

Solution code:
import math

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

c = t/a
print(math.floor(c)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = input().split(" ")
a = input[0]
b = input[1]
t = input[2]
sec = float(t) + 0.5
import math
time = math.floor(sec/int(a))
result = time*int(b)
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

if t < a: ans = 0
elif t == a: ans = b
else:
  ans = (t // a) * b
  
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 0
time = 0
for i in range(1, 22):
    time += A
    if time > T:
        break
    ans += B

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

v = math.floor(t / a) * b
print int(v)

Submission status: Accepted

Solution code:
import math

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

tem=math.floor((t+0.5)/a)
print(tem*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result = t//a*b

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

while not end:
    time += A
    if  time <= T:
        biscuit += B
    else:
        end = True

print(biscuit)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().split()

num = (int(N[2]) // int(N[0])) * int(N[1] )
print(num)

Submission status: Accepted

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

Submission status: Accepted

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


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

print(int(ans))

Submission status: Accepted

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

for i in range(a, t+1, a):
    cnt += b
print(cnt)