Problem:


Score : 100 points

Problem Statement

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

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

Constraints

All values in input are integers.

1 \leq A, B, T \leq 20

Input

Input is given from Standard Input in the following format:

A B T

Output

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

Sample Input 1

3 5 7

Sample Output 1

10

Five biscuits will be produced three seconds after activation.

Another five biscuits will be produced six seconds after activation.

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

Sample Input 2

3 2 9

Sample Output 2

6

Sample Input 3

20 20 19

Sample Output 3

0



Sample input:
3 5 7


Sample output:
10

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B,T = inputIL()

print((T//A)*B)

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

Solution code:
from operator import itemgetter
import sys
sys.setrecursionlimit(1000000)


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

cookie = (t+0.5) // a

print(int(b*cookie))

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print((C//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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


a, b, t = Is()
n = (t+0.5)//a
print(int(b*n))

Submission status: Accepted

Solution code:
import sys
from bisect import insort_left
def input(): return sys.stdin.readline().strip()


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



if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':

    ABC_125_A()

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

Submission status: Accepted

Solution code:
import itertools
import math
a, b, t = map(int, input().split())
sum = 0
for i in range(1,21):
    if a * i <= t:
        sum += b
print(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 * int((t + 0.5) // a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,t=map(int,input().split())
ans=0
for i in range(1,t+100):
    if i*a>t:
        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 = map(int,input().split())
time = 0
bis = 0
while (time + A <= T+0.5):
  bis += B
  time += A
print(bis)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, T = 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 + 0.5) // A * B))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# N = int(input())
# S = input()
A, B, T= map(int, input().split())
# A = list(map(int, input().split()))
i = 0
while (i + 1) * A <= T + 0.5:
    i += 1
print(B * i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC125A

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

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

Submission status: Accepted

Solution code:
def biscuit_generator(a, b, t):

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1,t+1):
    #print(i)
    if a*i<t+0.5:
        count+=b
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
n=len([i for i in range(1,c+1) if i%a==0])
print(b*n)

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

Submission status: Accepted

Solution code:
a, b, t = map(int, input().split())
if a > t:
    print("0")
else:
    s = t//a
    print(b*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())
print(int(T/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 = 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 = [int(x) for x in input().split()]
print(b * (t // a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x = input().split()
a = int(x[0])
b = int(x[1])
t = int(x[2])
print(math.floor(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 - Biscuit Generator

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

print(b * (t//a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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=[int(i)for i in 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())
cnt = T//A
print(cnt*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())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

A, B, T = MAP()

t = 0
ans = 0


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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

time=a
cnt=0
i=1
while time <= t+0.5:
    cnt+=b
    i +=1
    time += a

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
a,b,t = map(int, input().split())
a_ = a
cnt = 0
while a_<=t+0.5:
    a_ += a
    cnt += b
print(cnt)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if 1 <= a <= 20 :
    if 1 <= b <= 20:
        if 1 <= t <= 20:
            intera = a
            while intera <= t:
                qtd = qtd + b
                intera = intera + a
            print(qtd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s, b, e = [int(x) for x in input().split()]
    e += 0.5
    levas = e // s
    print(int(levas*b))
main()

Submission status: Accepted

Solution code:
a,b,t=[int(x) for x in input().split()]
x=2
total=a
biscoito=0
while total<=(t+0.5):
    biscoito+=b
    total=x*a
    x+=1
print(biscoito)

Submission status: Accepted

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

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

Submission status: Accepted

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

a,b,t = list(map(float, i))

c = 1
bisc = 0
na = a

while(na <= t):
    bisc = bisc + b
    c += 1
    na = a * c

print(int(bisc))

Submission status: Accepted

Solution code:
numerosStr = input().split(" ")
numeros=[]
contador=0
i=0
for j in numerosStr:
    numeros.append(int(j))

A = numeros[0]
B = numeros[1]
T = numeros[2]+0.5

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

Submission status: Accepted

Solution code:
line = input()
A, B, T = [int(n) for n in line.split()]
T+=0.5
i = 0
while A*(i+1) <= T:
    i+=1
print(i*B)

Submission status: Accepted

Solution code:
line = input()
a, b, c = [int(n) for n in line.split()]
soma=0
for a in range(a, c+1, a):
    soma=b+soma
print(soma)

Submission status: Accepted

Solution code:
line = input()
numbers = [int(n) for n in line.split()]
time = numbers[2]*10 + 5
biscuits = numbers[1]
time_taken = numbers[0] * 10
predicted_value = 0
while time >= 0:
    if time - time_taken >= 0:
        predicted_value += biscuits
    time -= time_taken
print(predicted_value)

Submission status: Accepted

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

Submission status: Accepted

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

s = 0
x = a
while x <= t + 0.5:
    s += b
    x += a

print(s)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(((t + .5) // a) * b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(n*b)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

Submission status: Accepted

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

print((1+(T-A)//A)*B)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

while 1:
  
  f=a*e
  if c+0.5>=f:
    e+=1
    
    d+=b
  else:
    break
print(d)

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

Submission status: Accepted

Solution code:
A,B,T = map(int,input().split())
ans = 0
second = 0
while second <= T - A:
  ans += B
  second += 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:
import math
import collections
import sys

input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

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:
a,b,t = map(int,input().split())
if a > t:
  print(0)
else:
  L = t // a
  print(L*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, t = map(int, input().split())
tmp = a
ans = 0
while (True):
    for i in range(100):
        if a >= t + 0.5:
            print(ans)
            exit()
        a += tmp
        ans += 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(B*(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,input().split())
co=(t+0.5)//a
print(int(b*co))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,m,k = map(int, input().split())
print((k//n)*m)

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
 
ans = 0
for i in range(1, c+1):
    if i%a == 0:
        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:
x,y,z=map(int,input().split())
c=0
for i in range(100000):
    c=z-i*x
    if c<0:
        break
print((i-1)*y)

Submission status: Accepted

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

print(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:
# python 3.4.3
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# library
# -------------------------------------------------------------



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

ans = 0
for _ in range(A,T+1,A):
    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())
ans = T//A*B
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,t = LI()
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:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    A, B, T = input_nums()
    time = 0
    total = 0
    while True:
        time += A
        if time > T +0.5: break
        total += B
    print(total)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,T=list(map(int,input().split()))
ans=0
for t in range(1,T+1):
    if t%A==0:
        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=map(int,input().split())


count=0
i=1
t=A
while t<T+0.5:
  count=count+B
#  print(i,t,count)
  i=i+1
  t=i*A  

print(count)

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())
c = 0
for number in range(1, 21):
    if a * number < t + 0.5:
        c += b
    else:
        pass
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b, t = map(int, input().split())
    time = t/a
    ans = int(time) * b
    print(int(ans))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math 

a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
p = math.floor(z / x)
print(int(p * y))

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, t = map(int, readline().split())
  print((t//a)*b)
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  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())

time = t
count = time//a
amount = count*b
print(amount)

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

ans = int(t/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:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

T = T + 0.5

times = T // A

print(int(B*times))

Submission status: Accepted

Solution code:
import sys

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

def main():
    res = b * (t // a)
    print(res)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,T=map(int,input().split())
bis=T//A
print(bis*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
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    count = (a[2] // a[0]) *a[1]
    print(count)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

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

Submission status: Accepted

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

time=0
biscuits=0

while True:
    time+=A
    if time>T+0.5:
        break
    biscuits+=B
print(biscuits)

Submission status: Accepted

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

Submission status: Accepted

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

res = 0
cnt = 0
t = T + 0.5

loop = T // A

for i in range(loop):
    if(cnt <= t):
        res += B
        cnt = i * A
    else:
        break
print(res)

Submission status: Accepted

Solution code:
A_interval, B_mai, T_limit = map(int, input().split())

times = T_limit // A_interval

ans = B_mai * times
print(ans)

Submission status: Accepted

Solution code:
#スペース区切りスペース区切りの整数を受け取る
a, b, t = list(map(int, input().strip().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())
n = 0
ans = 0
while n+a <= t:
  ans += b
  n += a
print(ans)

Submission status: Accepted

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

print((T//A)*B)