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: Runtime Error

Solution code:
def make_divisors(n):
	divisors = []
	for i in range(1, int(n**0.5)+1):
		if n % i == 0:
			divisors.append(i)
			if i != n // i:
				divisors.append(n//i)
	divisors.sort(reverse=True)
	return divisors

n = int(input())
a = list(map(int,input().split()))
a.append(0)
a.append(0)
a.sort(reverse=True)
ans1 = 0
ans2 = 0
ans3 = 0

result = make_divisors(a[0] - a[2])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 1) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans1 = result[i]
		break

result = make_divisors(a[0] - a[1])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 2) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans2 = result[i]
		break

result = make_divisors(a[1] - a[2])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 0) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans3 = result[i]
		break
max = ans1
if(ans2 > max):
	max = ans2
if(ans3 > max):
	max = ans3
print(max)

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce
import random
import copy

def gcd(numbers):
    return reduce(fractions.gcd, numbers)

n = int(input())
a = list(map(int, input().split()))
ans = 1

if n < 100:
  for i in range(n):
    b = copy.copy(a)
    b.pop(i)
    t = gcd(b)
    if ans < t:
      ans = t
else:
  for _ in range(100):
    t = gcd(random.sample(a, 50))
    if ans < t:
      ans = t

print(ans)

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

n = int(input())
a_list = list(map(int,input().split()))


ans = 0
for i in range(n):
    init = a_list[:]
    init.pop(i)
    gcd = gcd_list(init)
    if ans < gcd:
        ans = gcd

print(ans)

Submission status: Runtime Error

Solution code:
import sys
import os
import math
from functools import reduce
from fractions import gcd

def test(x,k,m):
    #print("i=",k)
    tmp=[0]*len(x)
    for j in range(m):
        tmp[j]=x[j]
    #print('a=',x)
    #print('tmp=',tmp)
    del tmp[k]
    #print('tmp=',tmp)
    #print("a==",x)
    XX=gcd(*tmp)
    #print("XX=",XX)
    return XX

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

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

yakusu=[0]*len(a)
for i in range(n):
    yakusu[i]=test(a,i,n)

ans=max(yakusu)
print(ans)

Submission status: Runtime Error

Solution code:
def make_divisors(n):
	divisors = []
	for i in range(1, int(n**0.5)+1):
		if n % i == 0:
			divisors.append(i)
			if i != n // i:
				divisors.append(n//i)
	divisors.sort(reverse=True)
	return divisors

n = int(input())
a = list(map(int,input().split()))
a.append(0)
a.append(0)
a.sort(reverse=True)
ans1 = 0
ans2 = 0
ans3 = 0

result = make_divisors(a[0] - a[2])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 1) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans1 = result[i]
		break

result = make_divisors(a[0] - a[1])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 2) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans2 = result[i]
		break

result = make_divisors(a[1] - a[2])
for i in range(len(result)):
	next = 0
	for j in range(n):
		if((j != 0) & (a[j] % result[i] != 0)):
			next = 1
			break
	if(next == 0):
		ans3 = result[i]
		break
max = ans1
if(ans2 > max):
	max = ans2
if(ans3 > max):
	max = ans3
print(max)

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

N = int(input())
A = (input()).split()
# N = int('2')
# A = ('1000000000 1000000000').split()
A = [int(a) for a in A]
max=0

for i in range(N):
    B = A.copy()
    del B[i]
    for j in range(N-1):
        if max < gcd(*B):
            max = gcd(*B)
            
print(max)

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce
import random
import copy

def gcd(numbers):
    return reduce(fractions.gcd, numbers)

n = int(input())
a = list(map(int, input().split()))
ans = 1

if n < 100:
  for i in range(n):
    b = copy.copy(a)
    b.pop(i)
    t = gcd(b)
    if ans < t:
      ans = t
else:
  for _ in range(100):
    t = gcd(random.sample(a, 30))
    if ans < t:
      ans = t

print(ans)

Submission status: Runtime Error

Solution code:
import fraction
from functools import reduce

def gcd(*numbers):
    return reduce(fraction.gcd, numbers)

def gcd_list(numbers):
    return reduce(fraction.gcd, numbers)

N = int(input())
A = (input()).split()
# N = int('2')
# A = ('1000000000 1000000000').split()
A = [int(a) for a in A]
max=0

for i in range(N):
    B = A.copy()
    del B[i]
    for j in range(N-1):
        if max < gcd(*B):
            max = gcd(*B)
            
print(max)

Submission status: Runtime Error

Solution code:
import fractions
import itertools
n = int(input())
x = list(map(int,input().split()))
p = list(itertools.combinations(x,2))
ar = []
for n in range(0,len(p)):
	ar.append(fractions.gcd(p[n][0],p[n][1]))
print(max(ar))

Submission status: Runtime Error

Solution code:
import math
import functools

n = int(input())
v = list(map(int, input().split()))

if max(v) % 2 ==0:
	b = True
else:
	b = False
		
v.sort()

for index,_ in enumerate(v):
	if _  % 2 ==0:
		if not b:
			v[index] = v[-1]
			break
			
	else:
		if b:
			v[index] = v[-1]
			break
			
ans = functools.reduce(math.gcd,v)
print(ans)

Submission status: Runtime Error

Solution code:
import copy
import fractions
from functools import reduce

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)
  
# 整数の入力
a = int(input())
# 数値のリスト化
xList = [int(i) for i in input().split()]
keisanList = copy.deepcopy(xList)
saidai = max(xList)
saidaiKoyakuSu = 0
koyakuSu = 0
listIndex = 0

for i in range(a):
    keisanList = copy.deepcopy(xList)
    keisanList[i] = saidai
    koyakuSu = gcd_list(keisanList)
    if(saidaiKoyakuSu < koyakuSu):
        saidaiKoyakuSu = koyakuSu
        listIndex = i

xList[listIndex] = saidai
print(gcd_list(xList))

Submission status: Runtime Error

Solution code:
import fractions
N = int(input())
l = list(map(int,input().split()))

if len(l) == 2:
    memo = max(l)
else:
    memo = 1
    for i in range(N):
        g = fractions.gcd(*(l[:i]+l[i+1:]))
        if g > memo:
            memo = g

print(memo)

Submission status: Runtime Error

Solution code:
a, b, t = map(int, imput().split())
print(sum([b for _ in range(a, t+1, a)]))

Submission status: Runtime Error

Solution code:
import math

n = int(input())
a = []
tmp = input().split()
for i in range(n):
    a.append(int(tmp[i]))

if n == 2:
    if a[0] > a[1]:
        print(a[0])
    else:
        print(a[1])
    exit()

rev = []
rev.append(a[n-1])
prev_gcd = a[n-1]
for i in range(n-2, 0, -1):
    prev_gcd = math.gcd(prev_gcd, a[i])
    rev.append(prev_gcd)

ans = math.gcd(a[0], rev[-2])
if ans < rev[-1]:
    ans = rev[-1]
        
prev_gcd = a[0]
for i in range(1, n-1):
    prev_gcd = math.gcd(prev_gcd, a[i])
    cand_ans = math.gcd(prev_gcd, rev[-1 - i])
    if cand_ans > ans:
        ans = cand_ans

print(ans)

Submission status: Runtime Error

Solution code:
a, b, t = map(int, imput().split())
if a > t:
    print(sum([b for _ in range(a, t+1, a)]))
else:
    print(0)

Submission status: Runtime Error

Solution code:
import fraction
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

N = int(input())
A = (input()).split()
# N = int('2')
# A = ('1000000000 1000000000').split()
A = [int(a) for a in A]
max=0

for i in range(N):
    B = A.copy()
    del B[i]
    for j in range(N-1):
        if max < gcd(*B):
            max = gcd(*B)
            
print(max)

Submission status: Runtime Error

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


if N == 2:
    print(max(A[0], A[1]))
else:
    m = min(A)

    ans = -1
    for i in range(1, m+1):
        count = 0
        for n in range(N):
            if count > 1:
                break
            if A[n] % i != 0:
                count += 1
        if count <= 1 and i > ans:
            ans = i

    print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
V = [int(n) for n in input().split(" ")]
C = [int(n) for n in input().split(" ")]
ret = 0
for i in range(N):
    if V[i] - C[i] > 0:
        ret += V[i] - C[i]

print(ret)

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce



def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

N = int(input())
A = [int(x) for x in input().split()]
list = []
max = 1

for x in range(N):

    for y in range(N):
        if x != y:
            list.append(A[y])

    gcd = gcd_list(list)
    if gcd > max:
        max = gcd

print(max)

Submission status: Runtime Error

Solution code:
def gcd(a, b):
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    c = a % b
    return gcd(b, c)
  
n = int(input())
arr = list(map(int,input().split(" ")))
list.sort(arr)

memoa = [None for i in range(n)]
memoa[0] = arr[0]
memob = [None for i in range(n)]
memob[0] = arr[-1]
for i in range(1,n):
  memoa[i] = gcd(memoa[i-1],arr[i])
  memob[i] = gcd(memob[i-1],arr[i])

m = 0
for i in range(len(arr)):
  if i is 0:
    ans = memob[n-2]
  elif i is n-1:
    ans = memoa[n-2]
  else:
    ans = gcd(memoa[i-1],memob[n-i-2])
      
  m = max(m, ans)
print(m)

Submission status: Runtime Error

Solution code:
import functools
import fractions
import copy

N = int(input())
A_list = list(map(int, input().split()))
vlaues = []
values_list = []

for i in range(N):
    values = copy.copy(A_list)
    del values[i]
    gcd = functools.reduce(fractions.gcd, values)
    values_list.append(gcd)

print(max(values_list))

Submission status: Runtime Error

Solution code:
import itertools
import numpy as np
import fractions
from functools import reduce

N = int(input())
A = np.array(input().split()).astype(int)

def gcd(numbers):
    return reduce(fractions.gcd, numbers)
rt = 1
for i in range(N):
    ind = np.ones(N, dtype=bool)
    ind[i]=False
    A_tmp = A[ind]
    f = gcd(A_tmp)
    if rt < f:
        rt = f
print(rt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import os, sys, re, math

inary = [int(s) for s in raw_input().split(' ')]

t = inary[0]
ret = 0
while t < inary[2]:
  ret += inary[1]
  t += inary[0]

print(ret)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = np.array([int(i) for i in input().split()])

# cm = np.prod(A)
# max_gcd = 0
# for i in range(len(A)):
#     Am = A.copy()
#     Am[i] = cm
#     gcd = np.gcd.reduce(Am)
#     if gcd > max_gcd:
#         max_gcd = gcd
print(sum(A))

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = np.array([int(i) for i in input().split()])

cm = np.prod(A)
max_gcd = 0
# for i in range(len(A)):
#     Am = A.copy()
#     Am[i] = cm
#     gcd = np.gcd.reduce(Am)
#     if gcd > max_gcd:
#         max_gcd = gcd
print(max_gcd)

Submission status: Runtime Error

Solution code:
import math
a = int(input("A"))
b = int(input("B"))
c = int(input("T"))
0 <= a and b and c <=20
e = 1/2
f = c + e
c = math.floor(f / a)
d = b * c
print(d)

Submission status: Runtime Error

Solution code:
a, b, t = map(int, imput().split())
total = 0
for _ in range(a, t+1, a):
    total += b
print(total)

Submission status: Runtime Error

Solution code:
N = int(input())
V = list(map(int, input().split()))
C = list(map(int, input().split()))
X = 0
for i in range(N):
    if(V[i]-C[i] > 0):
        X += V[i] - C[i]
print(int(X))

Submission status: Runtime Error

Solution code:
import math
a = int(input("A"))
b = int(input("B"))
c = int(input("T"))
e = 1/2
f = c + e
c = math.floor(f / a)
d = b * c
print(d)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import os
import math
import itertools
import math
import fractions
from functools import reduce

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

n = int(input())
nums = [int(i) for i in input().split()]
gcds = []
for num in nums:
    tmp = nums.copy()
    tmp.remove(num)
    gcds.append(gcd(*tmp))
print(max(gcds))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import os
import math
import itertools
import math
import fraction
from functools import reduce

def gcd(*numbers):
    return reduce(fraction.gcd, numbers)

n = int(input())
nums = [int(i) for i in input().split()]
gcds = []
for num in nums:
    tmp = nums.copy()
    tmp.remove(num)
    gcds.append(gcd(*tmp))
print(max(gcds))

Submission status: Runtime Error

Solution code:
N = int(input())
V = list(map(int, input().split()))
C = list(map(int, input().split()))
X = 0
for i in range(N):
    if(V[i]-C[i] > 0):
        X += V[i] - C[i]
print(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
A = int(input())
B = int(input())
T = int(input())
0 <= A and B and T <=20
e = 1/2
f = int(T) + e
c = math.floor(f / A)
d = B * c
print(d)

Submission status: Runtime Error

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
for X in range(1,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
print(s)

Submission status: Runtime Error

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

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

print(int(B * i))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
V=list(map(int, input().split()))
C= list(map(int, input().split()))
X = 0
for i in range(N):
  if(V[i]-C[i]>0):
    X += V[i] -C[i]
print(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
A = [int(i) for i in input().split()] 
Acnt = 0
for i in range(N):
	if A[i] < 0:
		Acnt += 1
res = np.sum(np.abs(A)) - np.min(np.abs(A))*2
print(res)

Submission status: Runtime Error

Solution code:
A,B,T = input().split()
A = int(A)
B = int(B)
T = int(T)
s = int(s)
for X in range(0,20):
  if A*X <= T + 0.5:
    s = B*X
  if A*X >=T + 0.5:
    break
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = int(input())

B = int(input())

T = int(input())

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

print(int(B * i))

Submission status: Runtime Error

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

import fractions
from functools import reduce
from copy import copy

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

gcds=[]
for i in range(N):
    A_=copy(A)
    A_=pop(i)
    gcds.append(gcd(*A_))

print(max(gcds))

Submission status: Runtime Error

Solution code:
import math
import fractions
from functools import reduce
from copy import copy

N = int(input())
A = list(map(int, input().split()))

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

gcds = []
for i in range(N):
    A_ = copy(A)
    A_.pop(i)
    gcds.append(gcd(*A_))

print(max(gcds))

Submission status: Runtime Error

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

import fraction
from functools import reduce
from copy import copy

def gcd(*numbers):
    return reduce(fraction.gcd, numbers)

gcds=[]
for i in range(N):
    A_=copy(A)
    A_=pop(i)
    gcds.append(gcd(*A_))

print(max(gcds))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
A = int(input())
B = int(input())
T = int(input())
e = 1/2
f = T + e
if A != 0:
    c = math.floor(f / A)
else:
    c = 0
d = B * c
print(d)

Submission status: Runtime Error

Solution code:
from collections import*
def dv(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
 
    # divisors.sort()
    return Counter(divisors)
 
n,*a=map(int,open(0).read().split())
ans=Counter()
for i in range(n):
    ans+=dv(a[i])
l=[]
for k,v in ans.items():
    if v==n-1 or v==n:
        l.append(k)
print(max(l))

Submission status: Runtime Error

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

a=int(A)
b=int(B)
t=int(T)

p=t%a
q=t/p
print(q*b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

bis=int((T+0.5)/A)*B

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
pal =1
minabs = 10**9
for i in range(n):
    if a[i] <0:
        pal *=-1
        a[i] = -1*a[i]
    minabs = min(minabs,a[i])
if pal ==1:
    print(sum(a))
else:
    print(sum(a)-2*minabs)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = int(input())
T = int(input())
i = int((T + 0.5)/A)
biscuit = A * i

print(biscuit)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
n = 0
a, b, t = input().split()

for n in range(int(t)):
  if(a % t == 0):
    anser += b
print(anser)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
A = int(input())
B = int(input())
T = int(input())
e = 1/2
f = int(T) + e
c = math.floor(f / A)
d = B * c
print(d)

Submission status: Runtime Error

Solution code:
n = int(input())
v = map(int,input().split())
c = map(int,input().split())
cnt = 0
for i in range(n):
    if v[i] > c[i]:
        cnt += (v[i] - c[i])
    else:
        cnt += 0    
print(cnt)

Submission status: Runtime Error

Solution code:
A, B, T map(int, input().split()) 
t_max = int((T+0.5)/A)
bis = 0
for t in range(t_max):
  bis += B*(t+1)
print(bis)

Submission status: Runtime Error

Solution code:
# B
n = int(input())
v = list(map(int, input().split()))
c = list(map(int, input().split()))

ans = 0
for i in range(n):
    gain = v[i] - c[i]
    if gain > 0:
        ans += gain
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import fractions
# import math
from functools import reduce

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

n = int(input())
a = [int(value) for value in input().split(" ")]


a = sorted(a)

b = []
c = []

for value in a:
    if value % 2 != 0:
        b.append(value)
    else:
        c.append(value)

if len(b) == 0:
    a.remove(c[0])
    print(gcd_list(a))
else:
    a.remove(b[0])
    print(gcd_list(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,T=map(int, input().split())
t_max = int((T+0.5)/(A))
for t in range(t_max):
	bis += B*(t+1)
print(bis)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
n = 0
a, b, t = input().split()
for n <= t :
  if(a % t == 0):
    anser += b
  n++
print(anser)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
num = int(input())
V = list(input().split(" "))
C = list(input().split(" "))
result = 0

for i in range(num):
    Vi = int(V[i])
    Ci = int(C[i])
    if Vi <= Ci:
        continue
    result += (Vi - Ci )

print(result)

Submission status: Runtime Error

Solution code:
import math
A = input()
B = input()
T = input()
e = 1/2
f = int(T) + e
c = math.floor(f / int(A))
d = int(B) * c
print(d)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
n = 0
a, b, t = input().split()
for n <= t :
  if(t%a==0):
    anser += b
  n ++
print(anser)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import math
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
b * math.floor((t+0.5)/a)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
n = 0
a, b, t = input().split()
for n <= t :
  if(t%a):
    anser += b
  n ++
print(anser)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
a, b, t = input().split()
for 0 <= t :
  if(t%a):
    anser += b
print(anser)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
V = list(map(int,input().split()))
C = list(map(int,input().split()))
goods_list = []
for i in range (n):
    x = V[i] - C[i]
    if x > 0:
        goods_list.append(x)
print(sum(goods_list))

Submission status: Runtime Error

Solution code:
#C問題
N=int(input())
A=list(map(int,input().split()))
def gcd(GCD1,GCD2):
    x = min(GCD1,GCD2)
    y = max(GCD1,GCD2)
    if y%x == 0:
        return x
    else:
        return gcd(x,y%x)
def gcdlist(xlist):
    xlen=len(xlist)
    GCD=0
    for i in range(xlen-1):
        GCD=gcd(xlist[i],xlist[i+1])
        xlist[i+1]=GCD
    return GCD
MAX=0
kari=0
for i in range(N):
    B=A[::]
    del B[i]
    kari=gcdlist(B)
    MAX=max(MAX,kari)
if N == 2:
    MA=max(A)
    g=gcd(A[0],A[1])
    MAX=max(MA,g)
print(MAX)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())

V=list(map(int,input().split()))
C=list(map(int,input().split()))

ans=0
for i in range(N):
	if(V[i]-C[i]>0):
		ans+=V[i]-C[i]
print(ans)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
a, b, t = input().split()
  if(a<=t):
    anser += 5
  if(b<=t):
    anser += 5
print(anser)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, t = (int(i) for i in input())

times = int(t / a)

num = times * b

print(num)

Submission status: Runtime Error

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


solve()

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
    int a, b, t;
    cin >> a >> b >> t;
    int ans = 0;
    for (int i = a; i <= t; i += a) {
        ans += b;
    }
    cout << ans;
}

Submission status: Runtime Error

Solution code:
3 2 9

Submission status: Runtime Error

Solution code:
print((T//A)*B)

Submission status: Runtime Error

Solution code:
anser = 0
a = 0
b = 0
t = 0
a, b, t = input().split()
	if(a<=t):
    	anser += 5
    if(b<=t):
      	anser += 5
print(anser)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
t = int(input())

x = (t+0.5)%a
return b*x

Submission status: Runtime Error

Solution code:
x = input()
x = x.split(" ")
a = x[0]
b = x[1]
c = x[2]
n = c // a 
return(n * b)

Submission status: Runtime Error

Solution code:
anser = 0
a, b, t = input().split()
	if(a<=t):
    	anser += 5
    if(b<=t):
      	anser += 5
print(anser)

Submission status: Runtime Error

Solution code:
import numpy as np
A =int(raw_input())
B =int(raw_input())
T =int(raw_input())
print str(int(np.trunc((T+0.5)/A)*B))

Submission status: Runtime Error

Solution code:
return (T//A)*B

Submission status: Runtime Error

Solution code:
x = input().split()¥a, b,t = int(x[0]),int(x[1]),int(x[2])
t += 0.5
num = t//a
sum = int(num * b)
print(num)

Submission status: Runtime Error

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

def count(s):
    a = int(s[0])
    b = int(s[1])
    t = int(s[2])
    a_now = a
    sum_ = 0
    while a_now< t+0.5:
        sum_ += b
        a_now += a
    
    return t
  
 print(count(li))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(1,t):
    if A*i<=t:
        count+=B    
    
print(count)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
A =int(raw_input())
B =int(raw_input())
T =int(raw_input())
print str(int(np.trunc((T+0.5)/A)*B))

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
T=int(input())
print(T//A*B)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
T=int(input())
print(T/A*B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, T = [input(), input(), input()]

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

Submission status: Runtime Error

Solution code:
anser = 0
a, b, t = input()
	if(a<=t):
    	anser += 5
    if(b<=t):
      	anser += 5
print(anser)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print( B * int((T + 0.5)/A) )

Submission status: Runtime Error

Solution code:
A, B, T = [int(x) for x in input().split(" ")]
s = 0
i = A
while i <= T + 0.5:
    s += B
    i += A

print(s)

N = int(input())

Submission status: Runtime Error

Solution code:
import numpy as np
A =int(raw_input())
B =int(raw_input())
T =int(raw_input())
print int(np.trunc((T+0.5)/A)*B)

Submission status: Runtime Error

Solution code:
n = input().split(" ")

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

w = (t / a)
pritn(w * b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, T = map(int, input().split())
int sum = 0
int t = 0
while(t < T+0.5):
  if t%A == 0:
    sum += B
  t += 1
print(sum)

Submission status: Runtime Error

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits


def input(): return sys.stdin.readline().strip()


def INT(): return int(input())


def MAP(): return map(int, input().split())


def LIST(): return list(map(int, input().split()))


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

a,b,t=MAP()

print(int((t+0.5)/a)*b)
                                                                                    
                                                                            32,0-1       全て

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

print(int(num))

Submission status: Runtime Error

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

print(B*(T//A))

Submission status: Runtime Error

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