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:
a,b,t=map(int,input().split())
x=0
num=0
c=a
for i in range(21):
    x=c
    c=a*(i+2)
    #print(x)
    if(x>t):
        break
    num+=b

print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input().split(" ")
A=int(n[0])
B=int(n[1])
T=int(n[2])
 
bis=int((T+0.5)/A)*B
print(bis)

Submission status: Accepted

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

Submission status: Accepted

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

print((T//A)*B)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(T // A * B)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(int(nums[2]) / int(nums[0])) * int(nums[1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, t = list(map(int, input().split()))
#a, b, t = 3, 5, 7
total = 0

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

print(total)

Submission status: Accepted

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

print(B*(T//A))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(999):
    if now < T+0.5:
        result = result + B
        now = now + A 
        
print(result)

Submission status: Accepted

Solution code:
#coding:utf-8

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

	while c < t:
		n += b
		c += a
	print(n)
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

counter = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Solution code:
# coding: utf-8

import sys
input = sys.stdin.readline

# N = int(input())
# L = list(map(int, input().split()))
A, B, T = map(int, input().split())
# S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
target = input().split()
per_second = int(target[0])
cokies = int(target[1])
times = int(target[2])
target_time = times + 0.5

print(int((target_time // per_second) * cokies) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from collections import deque
import heapq
import math
import bisect


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(bis)

Submission status: Accepted

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

biscuits = 0

end = int(T) + 0.5

count = int(A)
while end > count:
  biscuits += int(B)
  count += int(A)

print(biscuits)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = (t+0.5)//a

print(int(cnt*b))

Submission status: Accepted

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

Submission status: Accepted

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

num_of_biscuits = (T + 0.5) // A * B
print(round(num_of_biscuits))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
from sys import stdin

readline = stdin.readline

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

print(t // a * b)

Submission status: Accepted

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

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())
Bis = 0;
for i in range(T+1):
    if i ==0:
        continue
    elif i % A == 0:
        Bis =Bis+B;
print(Bis)

Submission status: Accepted

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

import math
n = math.floor((int(T) + 0.5)/int(A))


print(n*int(B))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((c//a)*b)

Submission status: Accepted

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

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

i = 1
c = 0
while i*A < T+0.5:
    c = c + B
    i = i + 1

print(c)

Submission status: Accepted

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


def count_total_biscuit(A, B, T):
    return (T // A) * B


print(count_total_biscuit(A, B, T))

Submission status: Accepted

Solution code:
#0WA n==1 mod saikikilimit exit
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
import math;
str=input().split(" ");
ans=math.floor(int(str[2])/int(str[0]))*int(str[1]);
print(ans);

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = a
ans = 0
while True:
    if count > t + 0.5:
        break
    count += a
    ans += b
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, t = input().split()
a = int(a)
b = int(b)
t = int(t)
ans = 0
for i in range(t + 1):
    if i > t:
        break
    elif i >= a and i % a == 0:
        ans += b
    else:
        ans += 0
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
args = input().split(" ")
s = 0
t = 0
while(t+int(args[0]) < int(args[2]) + 0.5):
    t += int(args[0])
    s += int(args[1])
print(s)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Solution code:
A, B, T = map(int, input().split())
tmp = A
ans = 0
while True:
    if tmp > T:
        break
    tmp += A
    ans += B    
print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
s=0
t=a
d = c +0.5
for num in range(100):
    
    if t>d:
        break
    s +=b
    t += a
    
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,T= (int(i) for i in input().split()) 
cooky=0
t=a
while(t<T+0.5):
  cooky=cooky+b
  t=t+a
print(cooky)

Submission status: Accepted

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

Submission status: Accepted

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

C = T // A
D = B * C

print(D)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3.4
# -*- coding: utf-8 -*-

# abc125_a

# input
a, b, t = [int(s) for s in input().split()]
# get ans
k = t//a
ans = k*b
# output
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = map(int,input().split())
sum = 0
if A>T:
    print("0")
    exit()
for i in range(1,T+1,1):
    if i%A==0:
        sum += B
print(sum)

Submission status: Accepted

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):
    return math.floor((t + 0.5) / a) * b


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime,random
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

A,B,T = inpl()
print(T//A*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sums=0
for i in range(t/a):
    sums+=b
print sums

Submission status: Accepted

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

# スペース区切りの整数の入力
A,B,T = map(int, input().split())

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

T2 = T + 0.5
Biscuits = int(T2 // A * B)

print(Biscuits)

Submission status: Accepted

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

while a <= c:
  e = e + b
  a = a + d
print(e)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#

import itertools
from collections import Counter
from collections import defaultdict
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(int(t/a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    s+=b
print(s)

Submission status: Accepted

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

def main():
    sp = [int(e) for e in input().split(" ")]
    a = sp[0]
    b = sp[1]
    t = sp[2]

    print(int(t/a) * b)
    # if int(b/a) > c:
    #     print(c)
    # else:
    #     print(int(b/a))

main()

Submission status: Accepted

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

ans = int((int (a[2])/ int (a[0]))) * int(a[1])
print(ans)

Submission status: Accepted

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

print(t // a * b)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
read_ints = lambda : map(int, raw_input().strip().split())

a, b, t = read_ints()
t += 0.5

ans = 0
timer = 1
while timer < t:
    if timer % a == 0:
        ans += b
    timer += 1

print ans

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main(inp):
    a,b,t=map(int,next(inp).split())
    print(int(t/a)*b)
    
main(sys.stdin)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
time, cookie, totaltime = (int(i) for i in input().split())
print(cookie*(totaltime//time))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

t = int(T/A)
bisket = B*t
print(int(bisket))

Submission status: Accepted

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

if A>T:
	print(0)
else:
	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())
print(int((t+0.5)//a)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
count = 1
time = 0
while 1:
    time = count * A
    if T < time:
        print(ans)
        exit()
    ans += B
    count += 1

Submission status: Accepted

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

Submission status: Accepted

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


print((T//A)*B)

Submission status: Accepted

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

x =int((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:
tmp=list(map(int,input().split()))

print((tmp[2]//tmp[0])*tmp[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split()
span = data[0]
num = data[1]
limit = data[2]
times = int(limit) / int(span)
import math
times = math.floor(times)
x = int(num) * int(times)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
a = n[0] # 3
b = n[1] # 5
c = n[2] # 7

r= int((c + 0.5)/a) * b

print(r)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

i = 0
while True:
    if i*a <= t:
        i += 1
    else:
        break
print((i-1)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

intA, intB, intT = map(int, input().split())
print(intT // intA * intB)

Submission status: Accepted

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

while t - a >= 0:
    c += b
    t -= a

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
nums = map(int ,raw_input().split())
print str(int(np.trunc((nums[2]+0.5)/nums[0])*nums[1]))

Submission status: Accepted

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

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

Submission status: Accepted

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

print( int(T / A) * B )

Submission status: Accepted

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

Submission status: Accepted

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

input_line = input().split()
inputInt = [int(i) for i in input_line]
#print(inputInt)
A = inputInt[0]
maisuu = inputInt[1]
timeLimit = inputInt[2] + 0.5

i = 0
while A*i < timeLimit:
    i += 1
i -= 1

print(maisuu*i)

Submission status: Accepted

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

biscuit_generator()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, B, T = map(int, input().split())
print(sum([B for x in range(A, int(math.ceil(T+0.5)), A)]))

Submission status: Accepted

Solution code:
def main():
  A,B,T=map(int, input().split())
  sum=0
  
  for i in range(1,100):
    if A*i <= T+0.5:
      sum=sum+B
      #print(A*i,",",sum)
    else:
      break

  print(sum)
  
main()

Submission status: Accepted

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

a = int(str[0])
b = int(str[1])
t = int(str[2])

times = (t-(t%a))/a

print(int(times*b))

Submission status: Accepted

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

Submission status: Accepted

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

ans = B * (t // A)
print(int(ans))

Submission status: Accepted

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

count = t // a

print(count * b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
l = list(map(int,input().split()))
A = l[0]
B = l[1]
T = l[2]
ans = 0
for i in range(1, 30):
    if i >= T + 0.5:
        break
    elif i % A == 0:
        ans += B
        

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(bis)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

value[2] = value[2] + 0.5

if value[0] <= value[2]:
  a = int(value[2] / value[0])
  print(value[1] * a)

else:
  print(0)

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

Submission status: Accepted

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


solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t = list(map(int, input().split()))
print(str(int((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, t = (int(i) for i in input().split())
 
times = int(t / a)
 
num = times * b
 
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  val = input()
  input_num = val.split(' ')
  
  a,b,t = input_num
  cuccki = 0
  
  for i in range(10000):
    if int(a)*(i+1) < (float(t)+0.5):
	    cuccki += int(b)
    else:
      break
      
  print(cuccki)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

bai = (C + 0.5) // A
cnt = bai * B

print(int(cnt))

Submission status: Accepted

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

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

Submission status: Accepted

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

secs=T+0.5

count=secs//A

print(round(count*B))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
cookie = (T // A) * B
print("{}".format(cookie))

Submission status: Accepted

Solution code:
l = list(map(int, input().split(" ")))
a = l[0]
b = l[1]
t = float(l[2])

ans = 0
i = 0

while i <= (t+0.5):
    if (i%a) == 0 and i != 0:
        ans += b
    
    i += 1

print(ans)

Submission status: Accepted

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

while(True):
    current = a*count
    if(current < t):
        biscuits += b
        count += 1
    else:
        break

print(biscuits)

Submission status: Accepted

Solution code:
from sys import stdin
from collections import deque, defaultdict as ddic
from itertools import combinations, permutations, product
import bisect
import heapq


rs = lambda: stdin.readline().strip()
ri = lambda: int(rs())
rsl = lambda: stdin.readline().split()
rim = lambda: map(int, rsl())
ril = lambda: list(rim())

A, B, T = rim()
seconds = A
if T < A:
    print(0)
else:
    cookies = 0
    while seconds <= T:
        cookies += B
        seconds += A

    print(cookies)

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())
cnt = 0
lists = []
for i in range(1,T+1):
    if i * A <= T:
        lists.append(i*A)
print(len(lists) * B)

Submission status: Accepted

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 sum_

print(count(li))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

    return biscuit

print(biscuit_generator(A, B, T))