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

show = c//a

print(int(b*show))

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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


c = int(t/a)
d = c*b
print(d)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())	#1 2 3 4 5 ... n  li=[1,2,3,4,5,...,n]
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())
num = (T+0.5) // A
ans = int(B * num)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(A: int, B: int, T: int):
    print((T // A) * B)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, B, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

kaisuu=C//A
kotae=kaisuu*B
print(kotae)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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())
t = A
count = 0
while t <= T:
    count += B
    t += A
print (count)

Submission status: Accepted

Solution code:
a,b,t = map(int,input().split())
res = 0
i = 1
while True:
    if a*i < t+0.5:
        res += b
    else:
        break
    i += 1
print(res)

Submission status: Accepted

Solution code:
from sys import stdin
a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
print(int(c/a)*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import os
import random
import re
import sys

def solve(a, b, t):
	x = 0
	if t < a:
		return 0
	for i in range(t//a):
		x += b
	return x

if __name__ == '__main__':
    a, b, t =  map(int, input().split())
    print(solve(a,b,t))

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
A,B,T = [int(x) for x in input().split()]
count = A
ans = 0
while count < T+0.5:
    ans += B
    count += A

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

s = 0
for i in range(a, t+1, a):
    s += b

print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, t = list(map(int, input().split(' ')))
x = 1
ans = 0
while True:
    if x * a < t + 0.5:
        ans += b
        x += 1
    else:
        break

print(ans)

Submission status: Accepted

Solution code:
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    A, B, T = getIntList()
    d.dmp((A, B, T),'A, B, T')
    return T//A*B

ans = prob()
print(ans)

Submission status: Accepted

Solution code:
# 2019/04/27
# AtCoder Beginner Contest 125 - A

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

# Calc
ans = int(t / a) * b

# Output
print(ans)

Submission status: Accepted

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

p=(t+0.5)//a

print(int(p*b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, B, T = map(int,input().split())
c = math.floor(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())
ans=t//a*b
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

time = A
res = 0

while(time <= T+0.5):
    time += A
    res += B

print(res)

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

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,T = [int(i) for i in input().split()]
if 1 <= A and B and T <= 20:
    print(int((T + 0.5) // A * B))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt*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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split(" ")))
A = l[0]
B = l[1]
T = l[2]

print((T//A)*B)

Submission status: Accepted

Solution code:
"""
ビスケット生産装置を起動すると、起動してから A 秒後、2A 秒後、3A 秒後、... (A の倍数秒後) に B

枚ずつビスケットを生産します。

ビスケット生産装置を起動してから T+0.5
秒後までに生産されるビスケットの合計枚数を求めてください。

return int(T/A) * B

test : A = 3 , B = 2 , T = 6
kotae : 4
"""

s = input().split(" ")
s = [int(s[i]) for i in range(3)]
A = s[0]
B = s[1]
T = s[2]
print(int(T/A) * B)

Submission status: Accepted

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

print(b*(t//a))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

a, b, t = na()
print(b * (t // a))

Submission status: Accepted

Solution code:
A, B, T = map(int, input().split())
ans = 0
for i in range(T // A):
    ans += B

print(ans)

Submission status: Accepted

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


def solve(A: int, B: int, T: int):
    count = 0
    for i in range(1,T+1,1):
        if i%A == 0:
            count += B
    print(count)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, B, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(int(T / A)* B)

Submission status: Accepted

Solution code:
A, B, T = [int(i) for i in 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())
t += 0.5
print(int((t//a)*b))

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
F = T // A
print(F * 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())
ans = 0
i = 0
while True:
    i += A
    if i <= T + 1/2:
        ans += B
    else:
        break
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Ans = (T // A) * B

print(Ans)

Submission status: Accepted

Solution code:
import math
[A,B,T] = [int(i) for i in input().split()]
print(B * math.floor(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())

count = 0
a_ = A

while a_ <= T+0.5:
    count += B
    a_ += A

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

ans = 0
count = 0

while True:
    count += A
    if count > T:
        break
    ans += B

print(ans)

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

Submission status: Accepted

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

mul = (t + 0.5) // a

print(int(b * mul))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t//a * b)

Submission status: Accepted

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

Submission status: Accepted

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

T = T + 0.5

times = int(T // A)

out = B * times

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

C = int(T / A)

print(C * B)

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

m = int((T+0.5)//A)

print(m*B)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 125
# https://atcoder.jp/contests/abc125
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main(A, B, T):
    n = int((T + 0.5) / A) * B
    print(n)

A, B, T = i2nn()
main(A, B, T)

Submission status: Accepted

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

Submission status: Accepted

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

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

tt=t+0.5

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

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

Submission status: Accepted

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

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

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().split())
c=0
time = 0
while time<=t:
  time+=a
  if time>t:
    break
  c+=b
print(c)

Submission status: Accepted

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

d = int(inp[2]) // int(inp[0])
c = d * int(inp[1])

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

lim = t + 0.5

print(int(lim / a)*b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
python3 main.py < input.txt
"""
import math
import itertools as it
import heapq

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():
    a, b, t = [int(i) for i in input().split()]
    #b = input()
    ans = 0
    for i in range(t):
        if (i+1)%a == 0:
            ans += b

    print(ans)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools


# いくつか入力
a, b, t = (int(i) for i in input().split())  

print(b* (t//a))

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    A, B, T = map(int, input().split())
    n = T // A
    return n * B


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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ans = 0
time = A

while time < T+0.5:
    ans += B
    time += A

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

# -*- coding: utf-8 -*-
"""
Created on Sat Apr 13 09:53:12 2019

@author: Owner
"""

import numpy as np
import sys
""""
import collections
import scipy.misc
import sys
import numpy as np
import math
from operator import itemgetter
import itertools
import copy
import bisect
"""

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default


"""
N, X = map(int, input().split())

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

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

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

def main():
    print((T//A)*B)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

def readInts():
  return [int(s) for s in input().split(" ")]

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

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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
 
input = sys.stdin.readline
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:
from sys import stdin
A,B,T=[int(x) for x in stdin.readline().rstrip().split()]
ans=(T//A)*B
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(c/a) * b)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#A
import numpy as np
import math
import re

n = input()
n = re.split(" ",n)

x = int(int(n[2])/int(n[0]))

print(x*int(n[1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B, T = [int(n) for n in input().split()]
    time = A
    res = 0
    while True:
        if time > T + 0.5:
            break
        res += B
        time += A
    print(res)
main()

Submission status: Accepted

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


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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
input = sys.stdin.readline

# bisect_left(lists, 3)
# bisect_right(lists, 3)

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

	tmp = T // A
	ans = tmp * B


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

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

Submission status: Accepted

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

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

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

print '{}'.format( int((T+0.5)/A) * B)

Submission status: Accepted

Solution code:
A,B,T=[int(x) for x in 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    a, b, t = LI()
    res = 0
    for i in range(a, 21, a):
        if i < t + 0.5:
            res += b

    return res


print(main())

Submission status: Accepted

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

now = 0
for i in range(a, 1000, a):
    if i >= t + 0.5:
        break
    now += b
print(now)

Submission status: Accepted

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

ans = 0
time = 0
while True:
    time += A
    if time > T:
        break
    ans += B
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = int(float(T+0.5)/A) * B

print(n)

Submission status: Accepted

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

t = t + 0.5
ans = 0
while t > a:
    ans += b
    t -= a

print(ans)

Submission status: Accepted

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

ans = 0
t = 0

while True:
    t += A
    if t > T +0.5:
        break
    else:
        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 = [int(_) for _ in input().split()]
print(B * (T // A))

Submission status: Accepted

Solution code:
from sys import stdin

a, b, t = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

s = (T + 0.5) // A

ans = int(s * B)

print(ans)

Submission status: Accepted

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

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