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 = list(map(int,input().split()))
print("{:}".format(t//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:
a, b, c = map(int, input().split())
print(b * (c // a))

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

print("{}".format((T//A)*B))

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
a,b,t = map(int,input().split())

ans = t//a * b

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

Submission status: Accepted

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

tt = 0
x = 0
while True:
    tt += a
    if tt > t + 0.5:
        break
    x += 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 = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
k = 2
val = A
while True:
  if val > T + 0.5:
    break
  else:
    val = k * A
    k += 1
print((k - 2) * B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        


#a = [int(x) for x in input().split()]
#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#V, E, r = map(int, input().split())
#INF = V * 10001

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

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

print(int(ans))

Submission status: Accepted

Solution code:
#どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

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 // a * b))

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    print((t//a) * b)

if __name__ == '__main__':
    main()

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

print(T//A * B)

Submission status: Accepted

Solution code:
# ABC125 A

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

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

Submission status: Accepted

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

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 = map(int,input().split())
T = t + 0.5

print(round(T // a * b))

Submission status: Accepted

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

    return 0


if __name__ == '__main__':
    main()

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())
print(B * (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:
N, M, K = map(int, input().split())
print((K//N)*M)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=list(map(int, input().split()))
print(z//x*y)

Submission status: Accepted

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

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

print(cnt)

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

Submission status: Accepted

Solution code:

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

print(n // a * b)

Submission status: Accepted

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

print((t // a) * b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from sys import stdin

a, b, t = (int(i) for i in stdin.readline().rstrip().split())
total = 0
time = a
while time <= t+0.5:
    total += b
    time += a
print(total)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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())

print(c // a * 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 = input().split()
A,B,T = int(A),int(B), int(T)
print(B*(T//A))

Submission status: Accepted

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

ans = 0
time = 1
while time * A < T + 0.5:
  ans += B
  time += 1

print(ans)

Submission status: Accepted

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

ans = B * (T//A)

print(ans)

Submission status: Accepted

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

from math import ceil

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

t = 1
ans = 0

while t <= T:
    if t % A == 0:
        ans += B
    t += 1

print(ans)

Submission status: Accepted

Solution code:
a, b, t = [int(i) for i in 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] = list(map(int,input().split()))
print(T//A*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(T//A*B)

Submission status: Accepted

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

count= 0
for i in range(1,10**12):
    if t + 0.5 <= i * a:
        break
    else:
        count += b

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#125_A
a,b,t=map(int,input().split())
print((t//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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A, B, T = MAP()
 
bis = 0
for i in range(1, 100):
  if A*i <= T:
    bis += B
  else:
    break
print(bis)

Submission status: Accepted

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


cnt = 1
tcnt = 0
bis = 0
while tcnt <= t+0.5:
    tcnt = cnt * a
    bis += b
    cnt += 1
print(bis-b)

Submission status: Accepted

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

x = (t+0.5)//a

print(int(x*b))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
cnt = 0
i = 1
while i <= t+0.5:
    if i%a == 0:
        cnt+=b
    i+=1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while cnt < T + 0.5:
	if cnt % A == 0:
		sum += B
	cnt += 1

print(sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc125/tasks/abc125_a

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

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

Submission status: Accepted

Solution code:
A,B,T = [int(i) for i in input().split()]
t = 0
count = 0
while True:
    t += A
    if t > T:
        break
    count +=B
print(count)

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())
now_time = 0
i = 0
while now_time < t + 0.5:
    now_time += a
    i += 1
print(b * (i-1))

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(int(c)//int(a)*int(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(x) for x in input().split()]

sum = 0
for i in range(1, 21):
    if (t + 0.5) < a * i:
        break
    else:
        sum += b

print(sum)

Submission status: Accepted

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

print(t // a * b)

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    A, B, T = MAP()
    print((T//A)*B)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

    ans = 0

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

    print(ans)

if __name__ == '__main__':
    main()

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())
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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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())
print(int(B * ((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 = map(int, input().split())

print(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:
first = input().split(' ')
per_time = int(first[0])
per_make = int(first[1])
time = int(first[2]) + 0.5

made = per_make * int(time / per_time)

print(made)

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

Submission status: Accepted

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

ans = 0
time = A
while time <= T:
  ans += B
  time += A
print(ans)

Submission status: Accepted

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

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,c=map(int,input().split())
print(c//a*b)

Submission status: Accepted

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

print(c//a * b)

Submission status: Accepted

Solution code:
s = input().split()
a=int(s[0])
b=int(s[1])
t = int(s[2])
i=0
while True :
    if i*a>t:
        break
    i+=1

print((i-1)*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
ans = 0
time = A
while T+0.5 >= time:
    ans = ans+B
    time = time+A
print(ans)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

mod = 1000000007
inf = 1 << 60

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

a, b, t = na()
k = 1
ans = 0
while a * k <= t:
    k += 1
    ans += b

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans * b)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, t = map(int, open(0).read().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:
import sys

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

def main():
    return b * (t // a)

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

print(B*(T//A))

Submission status: Accepted

Solution code:
import sys
import math

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

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

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

Submission status: Accepted

Solution code:
t, mai, lim = (int(x) for x in input().split())
total = 0
for i in range(1,lim+1):
    if i%t == 0:
        total += mai
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())

n = t//a

N = b*n
print(N)

Submission status: Accepted

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

print(T//A*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(b*((t+.5)//a)))

Submission status: Accepted

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

print t/a*b

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8 
#Author:Code

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

print t / a * b

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:
import os, sys, re, math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = list(map(int, input().split()))
print(int(((T + .5) // 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:
import os, sys, re, math

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

print(T // A * B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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

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 = T // A * B

print(ans)

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(lambda x: int(x), input().split())

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

Submission status: Accepted

Solution code:
def main():
    a, b, t = 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())
if A <= T:
    print(int((T + 0.5)) // A * B)
else:
    print('0')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 12, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A,B, T = map(int, readline().split())
print(B*(T//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())
u = t//a

print(u*b)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
x_list = x.split(" ")
a = int(x_list[0])
b = int(x_list[1])
t = int(x_list[2])

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

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(b*(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 = map(int, input().split())

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

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

Submission status: Accepted

Solution code:
A, B, T = map(int, open(0).read().split())

print(B*(T//A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    print(c//a*b)
if __name__ == '__main__':
    do()

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

Submission status: Accepted

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

total_t = 0
i = 1
count = 0

while True:
  total_t += a*i
  if t+1/2 <= total_t:
    break
  else:
    count += b

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

total = 0
j = a
for i in range(1, 100):
    if j < t + 0.5:
        total += b
        j = a*(i+1)
    else:
        print(total)
        break

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
ans=0
k=1
while k<=(li[2]+0.5)/li[0]:
    ans+=li[1]
    k+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC-125-A
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=int((t+0.5)/a)*b
print(ans)

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

Submission status: Accepted

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

# print(a)
# print(b)
# print(c)
e=int(c/a)
# print(e)
print(e*b)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)