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:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, t = LI()
    print(b * (t // a))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [A, B, T] = string_to_int(inputs[0])
    return B * (T // A)


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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()))
c=0
for i in range(1,T+1):
    if i%A==0:
        c+=1
print(c*B)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B,T = [int(i) for i in input().split()]
X = (T + 0.5) // A
Y = (B * X)//1
Z = int(Y)
print(Z)

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split(' '))
sec = 0
biscuit = 0
while True:
    sec += 0.5
    if sec >= t + 0.5:
        break
    if sec % a == 0:
        biscuit += b
print(biscuit)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque  # 双方向キュー
from collections import defaultdict  # 初期化済み辞書
from heapq import heapify, heappush, heappop, heappushpop  # プライオリティキュー
from bisect import bisect_left, bisect_right  # 二分探索
#import numpy as np  # 1.8.2
#import scipy  # 0.13.3
#sys.setrecursionlimit(int(1e+6))
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
MOD = int(1e+9) + 7

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

main()

Submission status: Accepted

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

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

# solve & output
print(B * int((T + 0.5) / A))

Submission status: Accepted

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

s = []
cnt = 1
while (A * cnt <= T + 0.5):
    s.append(A * cnt)
    cnt += 1
biscuit = B * len(s)

print(biscuit)

Submission status: Accepted

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

sum_count = 0
sum_time = 0

while True:
    sum_time += a
    if sum_time > t + 0.5:
        break
    sum_count += b

print(sum_count)

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

time = int(t / a)

print(b * time)

Submission status: Accepted

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

ans = 0
while True:
    if T < A:
        break;
    T -= A
    ans += 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, 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(b*(t//a))
"""
切り捨て除算なので場合分けはいらない
input()にしなかった私が悪うございました(￣^￣)
"""

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 秒後、2A 秒後、3A 秒後、... (A の倍数秒後) に B 枚ずつビスケットを生産します。
#ビスケット生産装置を起動してから T+0.5 秒後までに生産されるビスケットの合計枚数を求めてください。

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

out = 0
temp = a

for i in range(2, 100):
    if temp < t + 0.5:
        out += b
        temp = a * i

print(out)

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())
sum = 0

for i in range(T):
  if T + 0.5 < A * (i + 1):
    break
  sum = sum + B

print(sum)

Submission status: Accepted

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

time = 0
cnt = 0
while True:
    if time >= T+0.5:
        break
    cnt += 1
    time = cnt*A
print((cnt-1)*B)

Submission status: Accepted

Solution code:
time, piece, total = map(int, input().split())
print(total//time * piece)

Submission status: Accepted

Solution code:
Biscuit_factory_0, Biscuit_factory_1, Biscuit_factory_2 = (int(a)for a in input().split())

Number_of_sheets = (Biscuit_factory_2 // Biscuit_factory_0) * Biscuit_factory_1
print(Number_of_sheets)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((t // a)*b)

Submission status: Accepted

Solution code:
#ABC125-A
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( ))

n=t//a

print(n*b)

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

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

unit = T // A

print(unit * B)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import defaultdict
import math
import re

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

    num = 0
    for t in range(100):
        t += 1
        if t > T + 0.5:
            break
        if t % A == 0:
            num += B

    print(num)

if __name__ == '__main__':
    main()

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:
from sys import stdin


A, B, T = [int(x) for x in stdin.readline().rstrip().split()]

biscket = 0
time = A
while time < T+0.5:
    biscket += B
    time += A

print(biscket)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
baisu = (T+0.5) // A
print(int(baisu*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:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
A, B, T = map(int, input().split())
# 積を計算する
Z = T // A
count = Z*B
# 偶奇判定
print(count)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a,b,t = map(int, input().split())
cnt = 0
time = a
while time <= t:
    cnt += b
    time += a
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def main():
    A, B, T = map(int, input().split())
    ans = 0
    for i in range(1, T + 1):
        if i % A == 0:
            ans += B
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=s[2]%s[0]
c=s[2]-a
d=c/s[0]
b=d*s[1]
print(int(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 / A) * B)

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

t = int(t)

num = b*(t//a)

print(num)

Submission status: Accepted

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

for i in range(a):
  total += B
  
print(total)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(bis)

Submission status: Accepted

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

print(c // a * b)

Submission status: Accepted

Solution code:
A,B,T = list(map(float,input().split()))
T += 0.5
print(int(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 = list(map(int,input().split()))

bis = t + 0.5
sum = 0
while bis >= a:
    bis -= a
    sum += b
print(sum)

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc125/tasks/abc125_a

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

Submission status: Accepted

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

Submission status: Accepted

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

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


abc()

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())
print((c//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:
n1, n2, n3 = [int(i) for i in input().split()]

s1 = n2 * (n3 // n1)
print(s1)

Submission status: Accepted

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

def main(A,B,T):
    sum = B*(math.floor(T/A))
    print(sum)
    return 0

main(A,B,T)

Submission status: Accepted

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

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

number = round(((T+0.5)//A)*B)

print(number)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(b * (t // a))

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

print(int((t-(t%a))/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,2A,3A..秒後に
#B枚ずつビスケットが作られる
#T＋0.5秒後までに作られるビスケットの合計は
A,B,T = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc125/tasks/abc125_a
from sys import stdin


def main():
    A, B, T = [int(x) for x in stdin.readline().split()]

    print(T // A * B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    A, B, T = [int(x) for x in stdin.readline().split()]

    print((T // A * B))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = [int(e) for e in input().split()]

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

ans = 0

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

Submission status: Accepted

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

A = int(A)
B = int(B)
T = int(T)

time = A
ans = 0

while T >= time :
    ans += B
    time += A

print (ans)

Submission status: Accepted

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

time = A
res = 0
while time <= T + 0.5:
    res += B
    time += A

print(res)

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

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split(" "))
#print(A,B,T)
c=0
limit=0
while(limit<T+0.5):
    c+=B
    limit+=A
    #print(c,limit)

print(c-B)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''

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

Submission status: Accepted

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

Submission status: Accepted

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


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

time=t//a

print(time*b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 30 18:00:51 2019

@author: またの
"""

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

C = int((T + 1/2)//A)
ans = B*C

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

Submission status: Accepted

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

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

print(sum)

Submission status: Accepted

Solution code:
import math

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

if isinstance(A,int) and isinstance(B,int) and isinstance(T,int) :
    num_biscuit=0
    if 1<=A<=20 and 1<=B<=20 and 1<=T<=20:
        for i in range(math.floor(T/A)):
            num_biscuit=num_biscuit+B
        print(num_biscuit)
    # else :                                                                               
    #     print(0)                                                                         

else :
    print("ERROR")
    exit()

Submission status: Accepted

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


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(int(T/A)*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

t = A
b = 0
while t <= T:
  b += B
  t += A
  
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

print(T//A*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# a=100
# b=0.987654321
# print('{0:06d}-{1:6f}'.format(a,b))  # 0埋めのときの出力
# 000100-0.987654

import numpy as np
import math
import copy

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((T // A)*B)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import math
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''

a, b, t = map(int, input().split())
time = float(t) + 0.5
s = math.floor(time / a)
ans = s * b
print(ans)

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
for x in range(1, 21):
    if (x*A < T+0.5) & ((x+1)*A > T+0.5):
        print(B*x)
        break
    elif x*A > T+0.5:
        print(0)
        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())

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

Submission status: Accepted

Solution code:
A, B, T  =  (int(_) for _ in input().split())
ans = (T + 0.5) // A
ans = int(ans * B )
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 + 0.5) // A) * B))

Submission status: Accepted

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

if a > t:
    print(0)
else:
    n = 1
    while (a * n) <= t:
        n += 1
    print(b * (n-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, t = (int(_) for _ in input().split())
c = a
sum = 0
i = 1
while a < t+0.5:
    sum += b
    i += 1
    a = i * c

print(sum)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
A, B, T = map(int, raw_input().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:
#!/usr/bin/env python3

if __name__ == '__main__':
    a, b, t = list(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())
ans =0
for i in range(A,T+1,A):
    ans += B
print(ans)

Submission status: Accepted

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

sum=(t+0.5)//a*b
list=[0,int(sum)]
print(max(list))

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().split()
biscuit = 0
for i in range(1, int(T)+1):
    if(i % int(A) == 0):
        biscuit += int(B)
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())

print((t//a) * b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,t=map(int,input().split(" "))
count=0
tt=0
while tt<=t+0.5:
  count=count+1
  tt=tt+a
print(b*(count-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,T = [int(s) for s in input().split(' ')]
next_product = A
times = 2
biscuits = 0

while next_product <= T:
    biscuits += B
    next_product = A*times
    times += 1
#print("Biscuits are {} pieces".format(biscuits))
print(biscuits)

Submission status: Accepted

Solution code:
inputABT = input().split()     #数値を入力

#a,b,tの値をそれぞれに代入
a = float(inputABT[0])
b = inputABT[1]
t = float(inputABT[2])


end =  t + 0.5    #終了時刻を算出
second = 1    #秒数のカウント
biscuit = 0    #ビスケットの枚数

while second * int(a) < end:    #secondが終了時刻になるまで繰り返す
    second += 1
    biscuit += int(b)


print(biscuit)

Submission status: Accepted

Solution code:
inputABT = input().split()
a = float(inputABT[0])
b = inputABT[1]
t = float(inputABT[2])

end =  t + 0.5
n = 1
bisket = 0

while n * int(a) < end:
    n = n + 1

    bisket = bisket + int(b)


print(bisket)

Submission status: Accepted

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

t = T + 0.5
bisket = t // A * B

print(int(bisket))

Submission status: Accepted

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

total = 0

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

Submission status: Accepted

Solution code:
input1 = input().split()
a = input1[0]
b = input1[1]
t = input1[2]
a = float(a)
b = float(b)
t = float(t)
total = 0 #ビスケットの総数
T = t + 0.5 #0.5足した後のタイム

T -= a
while T > 0:
    total += b
    T -= a

total = int(total)

print(total)

Submission status: Accepted

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

print(t//a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a > t+0.5 : 
	print("0")
else :
	n = (t+0.5)/a
	print(int(n)*b)

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

Submission status: Accepted

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

while t+0.5 > i*a:
    bisket += b
    i += 1

print(bisket)

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
li = input().split()
li = [int(s) for s in li]

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

Submission status: Accepted

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

A, B, T = map(int, input().split())
i=1
total = 0
while i*A < T+0.5:
    total += B    
    i+=1
print(total)

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:
import sys

def main():
    input = sys.stdin.readline
    A, B, T= map(int, input().split())
    
    print(T // A * B)
    
if __name__ == '__main__':
    main()

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())
count = 0
while True:
    if count*A+A > T:
      break
    count += 1
print(B*count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A, B, T = [int(x) for x in stdin.readline().rstrip().split()]
i = A
bis = 0
while(i<T+0.5):
	i = i + A
	bis = bis + B
print(bis)