TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
N = int(input())

n = [0]*(N+1)
for i in range(2, N+1):
    for j in range(2, i+1):
        while i%j == 0:
            i//=j
            n[j] += 1

def num(m):
return len(list(filter(lambda x: x>=m-1, n)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)14+num(5)*(num(5)-1)*(num(3)-2)//2)

N = int(input())

n = [0]*(N+1)
for i in range(2, N+1):
    for j in range(2, i+1):
        while i%j == 0:
            i//=j
            n[j] += 1

def num(m):
    return len(list(filter(lambda x: x>=m-1, n)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)14+num(5)*(num(5)-1)*(num(3)-2)//2)

N = int(input())

n = [0]*(N+1)
for i in range(2, N+1):
    for j in range(2, i+1):
        while i%j == 0:
            i//=j
            n[j] += 1

def num(m):
return len(list(filter(lambda x: x>=m-1, e)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)14+num(5)*(num(5)-1)*(num(3)-2)//2)

N = int(input())

n = [0]*(N+1)
for i in range(2, N+1):
    x = i
    for j in range(2, i+1):
        while x%j == 0:
            x//=j
            n[j] += 1

def num(m):
return len(list(filter(lambda x: x>=m-1, n)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)14+num(5)*(num(5)-1)*(num(3)-2)//2)

N = int(input())

n = [0]*(N+1)
for i in range(2, N+1):
    for j in range(2, i+1):
        while i%j == 0:
            i//=j
            n[j] += 1

def num(m):
    return len(list(filter(lambda x: x>=m-1, n)))

print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)+num(5)*(num(5)-1)*(num(3)-2)//2)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
from collections import defaultdict as dd
from itertools import permutations as p

def factorize(n):
    d = dd(int)
    for i in range(2, int(n**0.5)+1):
        while n%i==0:
            d[i] += 1
            n //= i
        if not n:
            break
    if n>1:
        d[n] += 1
    return d

N = int(input())
d = defaultdict(int)
for i in range(1, N+1):
    e = factorize(i)
    for i,j in e.items():
        d[i] += j

ans = 0
for i, j, k in p(d.values(), 3):    
    if i>=2 and j>=4 and k>=4:
        ans += 1
ans //= 2

for i, j in p(d.values(), 2):
    if i>=2 and j>=24:
        ans += 1
    if i>=4 and j>=14:
        ans += 1

for i in d.values():
    if i>=74:
        ans += 1

print(ans)

from collections import Counter as c

def fact(n):
    d=[]
    for i in range(2,int(n**0.5)+2):
        while n%i==0:
            n//=i
            d.append(i)
    if n!=1:d.append(n)
    return c(d)

n=int(input())
d=c()
for i in range(1,n+1):
    d+=fact(i)

f=lambda n,x:sum(1 for i in p(d.values(),n) if all(map(lambda x,y:x>=y,i,x)))
print(f(3,(2,4,4))//2+f(2,(2,24))+f(2,(4,14))+f(1,(74,)))

from collections import defaultdict, Counter
from itertools import permutations as p

def factorize(n):
    d = defaultdict(int)
    for i in range(2, int(n**0.5)+1):
        while n%i==0:
            d[i] += 1
            n //= i
        if not n:
            break
    if n>1:
        d[n] += 1
    return d

N = int(input())
d = Counter()
for i in range(1, N+1):
    d += factorize(i)
vl = d.values()

ans = sum(1 for i, j, k in p(vl, 3) if i>=2 and j>=4 and k>=4)//2
ans += sum(1 for i, j in p(vl, 2) if i>=2 and j>=24)
ans += sum(1 for i, j in p(vl, 2) if i>=4 and j>=14)
ans += sum(1 for i in vl if i>=74)
print(ans)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
n = int(input())
f=list()

for i in range(1,n+1):
  b=2
  while b*b <= i:
    while i%b==0:
      i //= b
      f.append(b)
    b += 1
  if i > 1:
    f.append(i)

o2=o4=0

for i in range(2,n+1):
  d=f.count(i)
  if d>=2:
    o2 += 1
  if d>=4:
    o4 += 1
  if d:
    print(i,d)

print(o4*(o4-1)//2*(o2-2))

n = int(input())
f=list()

for i in range(1,n+1):
  b=2
  while b*b <= i:
    while i%b==0:
      i //= b
      f.append(b)
    b += 1
  if i > 1:
    f.append(i)

o2=o3=o4=o14=o24=o74=0

for i in range(2,n+1):
  d=f.count(i)
  if d>=2:
    o2 += 1
  if d>=4:
    o4 += 1
  if d>=14:
    o14 += 1
  if d>=24:
    o24 += 1
  if d>=74:
    o74 += 1

print(o4*(o4-1)//2*(o2-2)+o14*(o4-1)+o24*(o2-1)+o74)

Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
def era(n):
    table = [0] * (n + 1)
    prime_list = []
    
    for i in range(2, n + 1):
        if table[i] == 0:
            prime_list.append(i)
            for j in range(2*i, n + 1, i):
                table[j] = 1
    
    return prime_list

def f(n):
    cnt = 0
    for i in data:
        if i[1] >= n-1:
            cnt += 1
    return cnt
 
N = int(input())
s = era(N)
data = []
 
for i in s:
    k = i
    c = 0
    while N // k >= 1:
        c += N // k
        k = k*i
        print(c,k)
 
    data.append([i,c])
 

print(f(75)+f(15)*(f(5)-1)+f(25)*(f(3)-1)+f(5)*(f(5)-1)*(f(3)-2)//2)

def era(n):
    table = [0] * (n + 1)
    prime_list = []
    
    for i in range(2, n + 1):
        if table[i] == 0:
            prime_list.append(i)
            for j in range(2*i, n + 1, i):
                table[j] = 1
    
    return prime_list


N = int(input())
s = era(N)
data = []

for i in s:
    k = i
    c = 0
    while N // k >= 1:
        c += N // k
        k = k*i
        print(c,k)

    data.append([i,c])

cnt = 0
L = len(data)
print(data)
#2,4,4
for i in range(L-2):
    for j in range(i+1,L-1):
        for k in range(j+1,L):
            if (data[i][1] >= 4)and(data[j][1] >= 4)and(data[k][1] >= 2):
                print(data[i][1],data[j][1],data[k][1])
                cnt += 1
print(cnt)
#4,14
for i in range(L-1):
    for j in range(i+1,L):
        if (data[i][1] >= 14)and(data[j][1] >= 4):
            print(data[i][1],data[j][1])
            cnt += 1
print(cnt)
#2,24
for i in range(L-1):
    for j in range(i+1,L):
        if (data[i][1] >= 24)and(data[j][1] >= 2):
            print(data[i][1],data[j][1])
            cnt += 1
print(cnt)
#74
for i in range(L):
    if data[i][1] >= 74:
        print(data[i][1])
        cnt+=1

print(cnt)


def era(n):
    table = [0] * (n + 1)
    prime_list = []
    
    for i in range(2, n + 1):
        if table[i] == 0:
            prime_list.append(i)
            for j in range(2*i, n + 1, i):
                table[j] = 1
    
    return prime_list

def f(n):
    cnt = 0
    for i in data:
        if i[1] >= n-1:
            cnt += 1
    return cnt
 
N = int(input())
s = era(N)
data = []
 
for i in s:
    k = i
    c = 0
    while N // k >= 1:
        c += N // k
        k = k*i
 
    data.append([i,c])
 

print(f(75)+f(15)*(f(5)-1)+f(25)*(f(3)-1)+f(5)*(f(5)-1)*(f(3)-2)//2)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
import collections

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

N = int(input())
Prime=[]
for i in range(2,N+1):
  Prime +=prime_factorize(i)
  
c=collections.Counter(Prime)
P_count=c.values()

count_2=len([1 for x in P_count if x>=2])
count_4=len([1 for x in P_count if x>=4])
count_14=len([1 for x in P_count if x>=14])
count_24=len([1 for x in P_count if x>=24])
count_74=len([1 for x in P_count if x>=74])
answer=(count_2-1)*(count_4-1)*count_4//2+count_4*count_14+(count_2-1)*count_24+count_74
print(answer)

import collections

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

N = int(input())
Prime=[]
for i in range(2,N+1):
  Prime +=prime_factorize(i)
  
c=collections.Counter(Prime)
P_count=c.values()

count_2=len([1 for x in P_count if x>=2])
count_4=len([1 for x in P_count if x>=4])
count_14=len([1 for x in P_count if x>=14])
count_24=len([1 for x in P_count if x>=24])
count_74=len([1 for x in P_count if x>=74])
answer=(count_2-2)*(count_4-1)*count_4//2+(count_4-1)*count_14+(count_2-1)*count_24+count_74
print(answer)

Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
n = int(input())
lis=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
li=[]
a=0
b=0
c=0
d=0
e=0
for i in range(15):
    p=n
    q=0
    while(p>0):
        q+=p//lis[i]
        p=p//lis[i]
    if q>=74:
        e+=1
    if q>=24:
        print(lis[i])
        a+=1
    if q>=14:
        print(lis[i])
        b+=1
    if q>=4:
        print(lis[i])
        c+=1
    if q>=2:
        print(lis[i])
        d+=1
ans=a*(d-1)+b*(c-1)+(c*(c-1))//2*(d-2)+e
print(ans)

n = int(input())
lis=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
li=[]
a=0
b=0
c=0
d=0
e=0
for i in range(15):
    p=n
    q=0
    while(p>0):
        q+=p//lis[i]
        p=p//lis[i]
    if q>=74:
        e+=1
    if q>=24:
        a+=1
    if q>=14:
        b+=1
    if q>=4:
        c+=1
    if q>=2:
        d+=1
ans=a*(d-1)+b*(c-1)+(c*(c-1))//2*(d-2)+e
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
from collections import Counter

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def multiply_primes(a, b):
    
    res = Counter([])
    keys = a.keys() | b.keys()
    for k in keys:
        res[k] = a[k] + b[k]
    return res

N = int(input())



f = Counter([])  
for n in range(2, N+1):
    f = multiply_primes(f, Counter(prime_factorize(n)))

print(f)

cand2 = [item for item in f.items() if (item[1] >= 2)]  
cand4 = [item for item in f.items() if (item[1] >= 4)]  

print(cand2, cand4)


ans = (len(cand4) * (len(cand4)-1))//2 * (len(cand2) - 2)
print(ans)


from collections import Counter

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def multiply_primes(a, b):
    
    res = Counter([])
    keys = a.keys() | b.keys()
    for k in keys:
        res[k] = a[k] + b[k]
    return res

N = int(input())








f = Counter([])  
for n in range(2, N+1):
    f = multiply_primes(f, Counter(prime_factorize(n)))

c2, c4, c14, c24, c74 = 0, 0, 0, 0, 0

for item in f.items():
    k = item[1]
    c2 += (k >= 2)
    c4 += (k >= 4)
    c14 += (k >= 14)
    c24 += (k >= 24)
    c74 += (k >= 74)

ans_2_4_4 = (c4 * (c4 - 1))//2 * (c2 - 2)
ans_74 = c74
ans_2_24 = c24 * (c2 - 1)
ans_4_14 = c14 * (c4 - 1)

ans = ans_2_4_4 + ans_74 + ans_2_24 + ans_4_14
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
N=int(input())


from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under


from collections import defaultdict
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

count=1
D=defaultdict(int)
for i in range(1,N+1):
    f=factorization(i)
    for t in f:
        num,con=t
        D[num]+=con
threes=0
fives=0
num_15=0
num_25=0
num_75=0

for v in D.values():
    if v>=2:
        threes+=1
    if v>=4:
        fives+=1
    if v>=14:
        num_15+=1
    if v>=24:
        num_25+=1
    if v>=74:
        num_75+=1
#3*5*5
ans=(threes-fives)*fives*(fives-1)//2
if fives>=3:
    ans+=cmb(fives, 3)
#75*1
ans+=num_75+(N-num_75)+num_75*(num_75-1)//2
#5*15
ans+=(fives-num_15)*(num_15-num_75)+(num_15-num_75)*(num_15-num_75)//2
#3*25
ans+=(threes-num_15)*(num_25-num_75)+(num_25-num_75)*(num_25-num_75)//2
print(ans)
#print(D)
#print(threes, fives, num_15, num_25, num_75)
#print(factorization(32400))

N=int(input())



from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under


from collections import defaultdict
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

count=1
D=defaultdict(int)
for i in range(1,N+1):
    f=factorization(i)
    for t in f:
        num,con=t
        D[num]+=con
threes=0
fives=0
num_15=0
num_25=0
num_75=0

for v in D.values():
    if v>=2:
        threes+=1
    if v>=4:
        fives+=1
    if v>=14:
        num_15+=1
    if v>=24:
        num_25+=1
    if v>=74:
        num_75+=1
#3*5*5
ans=(threes-fives)*fives*(fives-1)//2
if fives>=3:
    #ans+=cmb(fives, 3)
    ans+=fives*(fives-1)*(fives-2)//2
#75*1

ans+=num_75
#5*15

ans+=num_15*(fives-1)
#3*25
ans+=num_25*(threes-1)
print(ans)
#print(D)
#print(threes, fives, num_15, num_25, num_75)
#print(factorization(32400))

Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
import math
from collections import Counter
from scipy.misc import comb
n = int(input())

def primes(m) :
    ps = [2]
    for i in range(3, m) :
        for p in ps :
            if i%p == 0 :
                break
        else :
            ps.append(i)
    return ps

def fdivisor(m) :
    ps = primes(m)
    df = {p:0 for p in ps}
    for i in range(1, m+1) :
        ii = i
        while ii != 1 :
            for p in ps :
                if ii%p == 0 :
                    df[p] += 1
                    ii //= p
    return df

ans = 0
df = fdivisor(n)
over2 = len([v for v in df.values() if v >= 2])
over4 = len([v for v in df.values() if v >= 4])
over14 = len([v for v in df.values() if v >= 14])
over24 = len([v for v in df.values() if v >= 24])
over74 = len([v for v in df.values() if v >= 74])
ans += comb(over4, 2, exact=True)*comb(over2-2, 1)
ans += comb(over14, 1)*comb(over4-1, 1)
ans += comb(over24, 1)*comb(over2-1, 1)
ans += comb(over74, 1)

print(int(ans))

import math
from collections import Counter
from scipy.misc import comb
n = int(input())

def primes(m) :
    ps = [2]
    for i in range(3, m) :
        for p in ps :
            if i%p == 0 :
                break
        else :
            ps.append(i)
    return ps

def fdivisor(m) :
    ps = primes(m)
    df = {p:0 for p in ps}
    for i in range(1, m+1) :
        ii = i
        while ii != 1 :
            for p in ps :
                if ii%p == 0 :
                    df[p] += 1
                    ii //= p
    return df

ans = 0
df = fdivisor(n)
over2 = len([v for v in df.values() if v >= 2])
over4 = len([v for v in df.values() if v >= 4])
over14 = len([v for v in df.values() if v >= 14])
over24 = len([v for v in df.values() if v >= 24])
over74 = len([v for v in df.values() if v >= 74])
ans += comb(over4, 2)*comb(over2-2, 1)
ans += comb(over14, 1)*comb(over4-1, 1)
ans += comb(over24, 1)*comb(over2-1, 1)
ans += comb(over74, 1)

print(int(ans))

n = int(input())

def primes(m) :
    ps = [2]
    for i in range(3, m+1) :
        for p in ps :
            if i%p == 0 :
                break
        else :
            ps.append(i)
    return ps

def fdivisor(m) :
    ps = primes(m)
    df = {p:0 for p in ps}
    for i in range(1, m+1) :
        ii = i
        while ii != 1 :
            for p in ps :
                if ii%p == 0 :
                    df[p] += 1
                    ii //= p
    return df

ans = 0
df = fdivisor(n)
over2 = len([v for v in df.values() if v >= 2])
over4 = len([v for v in df.values() if v >= 4])
over14 = len([v for v in df.values() if v >= 14])
over24 = len([v for v in df.values() if v >= 24])
over74 = len([v for v in df.values() if v >= 74])
ans += over4*(over4-1)//2*(over2-2)
ans += over14*(over4-1)
ans += over24*(over2-1)
ans += over74

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n;

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p;
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result;

a = int(input())

b = [0 for i in range(15)]
j = 0
c = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
d = [0 for i in range(101)]
p = 0
pp = 0
g = 0
gg = 0
ggg = 0
co = 0
for i in range(1,101):
  k = i
  while True:
    if k % c[j] == 0 and k >= c[j]:
      b[j] += 1
      k //= c[j]
    else:
      j += 1
      if j == 15:
        j = 0
        break
  for k in range(15):
    if b[k] >= 74:
      g += 1
    if b[k] >= 24:
      gg += 1
    if b[k] >= 14:
      ggg += 1
    if b[k] >= 4:
      p += 1
    if b[k] >= 2:
      pp += 1
  print(g,gg,ggg,p,pp)
  if i >= 10:
    d[i] = cmb(p, 2)*cmb((pp-2), 1) + cmb(g, 1) + cmb(gg, 1)*cmb((pp-1), 1) + cmb(ggg, 1)*cmb((p-1), 1)
  p = 0
  pp = 0
  g = 0
  gg = 0
  ggg = 0
print(d)

def cmb(n, r):
    if n - r < r: r = n - r
    if n <= 0: return 0
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p;
            for k in range(p-1,r,p):
                numerator[k - offset] //= pivot
                denominator[k] //= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

a = int(input())

b = [0 for i in range(15)]
j = 0
c = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
d = [0 for i in range(101)]
p = 0
pp = 0
g = 0
gg = 0
ggg = 0
co = 0
for i in range(1,101):
  k = i
  while True:
    if k % c[j] == 0 and k >= c[j]:
      b[j] += 1
      k //= c[j]
    else:
      j += 1
      if j == 15:
        j = 0
        break
  for k in range(15):
    if b[k] >= 74:
      g += 1
    if b[k] >= 24:
      gg += 1
    if b[k] >= 14:
      ggg += 1
    if b[k] >= 4:
      p += 1
    if b[k] >= 2:
      pp += 1
  if i >= 10:
    d[i] = cmb(p, 2)*cmb((pp-2), 1) + cmb(g, 1) + cmb(gg, 1)*cmb((pp-1), 1) + cmb(ggg, 1)*cmb((p-1), 1)
  p = 0
  pp = 0
  g = 0
  gg = 0
  ggg = 0
print(d[a])


Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
# -*- coding: utf-8 -*-
"""
Created on Sun Dec  2 21:50:38 2018
ABC114D
@author: maezawa
"""

nmax = int(100)
is_prime = [True]*(nmax+1)

is_prime[0] = False
is_prime[1] = False

for i in range(2, nmax//2):
    if is_prime[i] == True:
        for j in range(2*i,nmax+1,i):
            is_prime[j] = False

prime_numbers = [i for i in range(nmax+1) if is_prime[i]]

n = int(input())

prime_exps = [0]*len(prime_numbers)
for i in range(2,n+1):
    for k, p in enumerate(prime_numbers):
        if i<p:
            break
        while i>=p:
            if i%p == 0:
                i = i // p
                prime_exps[k] += 1
            else:
                break

print(prime_numbers)
print(prime_exps)
ans = 0

cnt74 = 0
# searching >=74
for i in prime_exps:
    if i>=74:
        cnt74 += 1

# searching 24 and 2:
cnt24 = 0
cnt24_2 = 0
for i in prime_exps:
    if i>=24:
        cnt24 += 1
    if i>=2:
        cnt24_2 += 1

# searching 4 and 2:
cnt44 = 0
cnt44_2 = 0
for i in prime_exps:
    if i>=4:
        cnt44 += 1
    if i>=2:
        cnt44_2 += 1

cnt = cnt74
if cnt24 > 0 and cnt24_2 > 1:
    cnt += cnt24*(cnt24_2-1)
if cnt44 > 1 and cnt44_2 > 2:
    cnt += cnt44*(cnt44-1)//2*(cnt44_2-2)
    
print(cnt)


# -*- coding: utf-8 -*-
"""
Created on Sun Dec  2 21:50:38 2018
ABC114D
@author: maezawa
"""

nmax = int(100)
is_prime = [True]*(nmax+1)

is_prime[0] = False
is_prime[1] = False

for i in range(2, nmax//2):
    if is_prime[i] == True:
        for j in range(2*i,nmax+1,i):
            is_prime[j] = False

prime_numbers = [i for i in range(nmax+1) if is_prime[i]]

n = int(input())

prime_exps = [0]*len(prime_numbers)
for i in range(2,n+1):
    for k, p in enumerate(prime_numbers):
        if i<p:
            break
        while i>=p:
            if i%p == 0:
                i = i // p
                prime_exps[k] += 1
            else:
                break



ans = 0

cnt74 = 0
cnt24 = 0
cnt14 = 0
cnt4 = 0
cnt2 = 0

# searching >=74
for i in prime_exps:
    if i>=74:
        cnt74 += 1
    if i>=24:
        cnt24 += 1
    if i>=14:
        cnt14 += 1
    if i>=4:
        cnt4 += 1
    if i>=2:
        cnt2 += 1

cnt = cnt74
if cnt24 > 0 and cnt2 > 1:
    cnt += cnt24*(cnt2-1)
if cnt14 > 0 and cnt4 > 1:
    cnt += cnt14*(cnt4-1)
if cnt4 > 1 and cnt2 > 2:
    cnt += cnt4*(cnt4-1)//2*(cnt2-2)
    
print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
from collections import Counter
import math
def P(n, r):
  return math.factorial(n)//math.factorial(n-r)
def C(n, r):
  return P(n, r)//math.factorial(r)
n=int(input())
L=[]
for j in range(2,n+1):
    I=j
    s=0
    R=int(I)
    while s==0:
        for i in range(2,R+1):
            if I%i==0:
                I=I/i
                if I==1:
                    s=1
                L.append(i)
                break
c=Counter(L)
c=[0 for i in range(100)]
for i,j in c.most_common():
  c[j]+=1
 
s=0
s+=sum(c[4:])*(sum(c[4:])-1)*sum(c[2:]-2)//2
s+=sum(c[14:])*(sum(c[4:])-1)
s+=sum(c[24:])*(sum(c[2:])-1)
s+=sum(c[74:])
print(s)

from collections import Counter
import math
def P(n, r):
  return math.factorial(n)//math.factorial(n-r)
def C(n, r):
  return P(n, r)//math.factorial(r)
n=int(input())
L=[]
for j in range(2,n+1):
    I=j
    s=0
    R=int(I)
    while s==0:
        for i in range(2,R+1):
            if I%i==0:
                I=I/i
                if I==1:
                    s=1
                L.append(i)
                break
C=Counter(L)
c=[0 for i in range(100)]
for i,j in C.most_common():
  c[j]+=1
 
s=0
s+=sum(c[4:])*(sum(c[4:])-1)*(sum(c[2:])-2)//2
s+=sum(c[14:])*(sum(c[4:])-1)
s+=sum(c[24:])*(sum(c[2:])-1)
s+=sum(c[74:])
print(s)

Verdicts: Runtime Error

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
def isprime(n):
    if(n<2):
        return False
    for i in range(2,n):
        if(n%i==0):
            return False
    return True

def primelist(n):
    return [i for i in range(n) if isprime(i)]

def factor(n):
    f = {}
    while(n > 1):
        for p in primelist(n+1):
            if(n % p == 0):
                f[p] = f.get(p, 0) + 1
                n //= p
    return f

def factorfactorial(n):
    f = {}
    for i in range(1,n+1):
        fi = factor(i)
        for k, v in fi.items():
            f[k] = f.get(k,0) + v
    return f

# 75 = 3*5*5 = 3*25 = 5*15 
n = int(input())
f = factorfactorial(n)

print(f)
cnt = 0


for i in primelist(n+1):
    if(f[i]>75):
        cnt += 1
    for j in primelist(n+1):
        if(i==j):
            continue
        if(f[i]>=25-1 and f[j]>=3-1):
            cnt += 1
        if(f[i]>=15-1 and f[j]>=5-1):
            cnt += 1
        if(i > j):
            for k in primelist(n+1):
                if k in [i,j]:
                    continue
                if(f[i]>=5-1 and f[j]>=5-1 and f[k]>=3-1):
                    cnt += 1



print(cnt)


def isprime(n):
    if(n<2):
        return False
    for i in range(2,n):
        if(n%i==0):
            return False
    return True

def primelist(n):
    return [i for i in range(n) if isprime(i)]

def factor(n):
    f = {}
    while(n > 1):
        for p in primelist(n+1):
            if(n % p == 0):
                f[p] = f.get(p, 0) + 1
                n //= p
    return f

def factorfactorial(n):
    f = {}
    for i in range(1,n+1):
        fi = factor(i)
        for k, v in fi.items():
            f[k] = f.get(k,0) + v
    return f

# 75 = 3*5*5 = 3*25 = 5*15 
n = int(input())
f = factorfactorial(n)

# print(f)
cnt = 0

for i in f.keys():
    if(f[i]>=75-1):
        cnt += 1
    for j in primelist(n+1):
        if(i==j):
            continue
        if(f[i]>=25-1 and f[j]>=3-1):
            cnt += 1
        if(f[i]>=15-1 and f[j]>=5-1):
            cnt += 1
        if(i > j):
            for k in primelist(n+1):
                if k in [i,j]:
                    continue
                if(f[i]>=5-1 and f[j]>=5-1 and f[k]>=3-1):
                    cnt += 1



print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]
print(len(prime))

prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
s=[0 for i in range(15)]
N=int(input())
for i in range(15):
  j=1
  while N//(prime[i]**j)>0:
    s[i]+=N//(prime[i]**j)
    j+=1
o3,o5,o15,o25,o75=0,0,0,0,0
for item in s:
  if item>=2:
    o3+=1
    if item>=4:
      o5+=1
      if item>=14:
        o15+=1
        if item>=24:
          o25+=1
          if item>=74:
            o75+=1
ans=[0,0,0,0]
if o75>0:
  ans[0]+=1
if o25>0:
  ans[1]+=o25*(o3-1)
if o15>0:
  ans[2]+=o15*(o5-1)
if o5>1 and o3>2:
  ans[3]+=o5*(o5-1)//2*(o3-2)
print(sum(ans))


Verdicts: Wrong Answer

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
from collections import defaultdict

N = int(input())
prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,
        43,47,53,59,61,67,71,73,79,83,89,97]
ans = 0
factor = defaultdict(int)
for i in range(1,N+1):
    for j in prime:
        while i != 1:
            if i % j == 0:
                factor[j] += 1
                i = i // j
            else:
                break

fact_l = list(dict(factor).items())
for i, x in enumerate(fact_l):
    if x[1] >= 74:
        n_74 = i + 1
    if x[1] >= 24:
        n_24 = i + 1
    if x[1] >= 14:
        n_14 = i + 1
    if x[1] >= 4:
        n_4 = i + 1
    if x[1] >= 2:
        n_2 = i + 1

print(n_74+n_24*(n_2-1)+n_14*(n_4-1)+n_4*(n_4-1)*(n_2-2)//2)

from collections import defaultdict

N = int(input())
prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,
        43,47,53,59,61,67,71,73,79,83,89,97]
ans = 0
factor = defaultdict(int)
for i in range(1,N+1):
    for j in prime:
        while i != 1:
            if i % j == 0:
                factor[j] += 1
                i = i // j
            else:
                break

fact_l = list(dict(factor).items())
fact_l.sort()
n_74 = 0
n_24 = 0
n_14 = 0
n_4 = 0
n_2 = 0
for i, x in enumerate(fact_l):
    if x[1] >= 74:
        n_74 = i + 1
    if x[1] >= 24:
        n_24 = i + 1
    if x[1] >= 14:
        n_14 = i + 1
    if x[1] >= 4:
        n_4 = i + 1
    if x[1] >= 2:
        n_2 = i + 1

print(n_74+(n_24*(n_2-1))+(n_14*(n_4-1))+(n_4*(n_4-1)*(n_2-2)//2))

Verdicts: Runtime Error

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
N, M = map(int,input().split())

for i in range(1,M+1):
    if M%i == 0:
        if  M//i >= N:
            ans = i
        else:
            break
    
print(ans)

import math
N = int(input())

p = [i for i in range(2,N+1)]
q = []

for i in p:
    for j in range(2,i):
        if i%j==0:
            q.append(i)
            break
        
p = list(set(p)-set(q))

def div(n):
    ret=0
    a=math.factorial(N)
    while a%n == 0:
        a//=n
        ret+=1
    return ret

Ans=0

for n in p:
    if div(n)>=74:
        Ans+=1

for n in p:
    if div(n)>=24:
        for m in p:
            if div(m)>=2 and n!=m:
                Ans += 1

        
for n in p:
    if div(n)>=14:
        for m in p:
            if div(m)>=4 and n!=m:
                Ans += 1

for n in p:
    if div(n)>=2:
        for m in p:
            if n!=m and div(m)>=4:
                for l in p:
                    if l!=n and l>m and div(l)>=4:
                        Ans +=1

print(Ans)

Verdicts: Runtime Error

Accepted
Problem: You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are there?  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Submission attempts (in order):
from collections import defaultdict
n=int(input())
sosu_list=[2]
for i in range(3, 101, 2):
    flag=0
    for j in range(2, int(i**0.5)+2):
        if i%j==0:
            flag=1
    if flag==0:
        sosu_list.append(i)
print(sosu_list)
soinsu=defaultdict(int)
for i in sosu_list:
    temp=n
    while temp>=i:
        temp//=i
        soinsu[i]+=temp
kouho=soinsu.values()
cnt3=0
cnt5=0
cnt15=0
cnt25=0
cnt75=0
for a in kouho:
    if a>=2:
        cnt3+=1
    if a>=4:
        cnt5+=1
    if a>=14:
        cnt15+=1
    if a>=24:
        cnt25+=1
    if a>=74:
        cnt75+=1
ans=0
ans+=cnt75
ans+=cnt15*(cnt5-1)
ans+=cnt25*(cnt3-1)
if cnt3>=2:
    ans+=cnt5*(cnt5-1)*(cnt3-2)//2
        
print(ans)

from collections import defaultdict
n=int(input())
sosu_list=[2]
for i in range(3, 101, 2):
    flag=0
    for j in range(2, int(i**0.5)+2):
        if i%j==0:
            flag=1
    if flag==0:
        sosu_list.append(i)
soinsu=defaultdict(int)
for i in sosu_list:
    temp=n
    while temp>=i:
        temp//=i
        soinsu[i]+=temp
kouho=soinsu.values()
cnt3=0
cnt5=0
cnt15=0
cnt25=0
cnt75=0
for a in kouho:
    if a>=2:
        cnt3+=1
    if a>=4:
        cnt5+=1
    if a>=14:
        cnt15+=1
    if a>=24:
        cnt25+=1
    if a>=74:
        cnt75+=1
ans=0
ans+=cnt75
ans+=cnt15*(cnt5-1)
ans+=cnt25*(cnt3-1)
if cnt3>=2:
    ans+=cnt5*(cnt5-1)*(cnt3-2)//2
        
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
x,y=map(int,input().split())
print(x+y/2)

x,y=map(int,input().split())
print(int(x+y/2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
x=[]
for i in range(n):
    x.append(abs(a-(t-h[i]*0.006)))
print(x.index(min(x))+1)

x,y=map(int,input().split());print(x+y//2)

Verdicts: Runtime Error

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X, Y = map(int, input())
print(X + Y // 2)

X, Y = map(int, input().split())
print(X + Y // 2)

Verdicts: Runtime Error

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
n,m = map(int,input().split( ))
ls_a = []
ls_b = [[] for i in range(n)]
for i in range(m):
    p,y = map(int,input().split( ))
    ls_a.append([p,y])
    ls_b[p-1].append(y)
for i in range(n):
    if len(ls_b[i]) !=0:
        ls_b[i].sort()
for i in range(m):
    print(str(ls_a[i][0]).zfill(6) + str(ls_b[ls_a[i][0]-1].index(ls_a[i][1])+1).zfill(6))

import io
import sys

def solve(x,y):
    return x+y//2

def readQuestion():

    line1 = sys.stdin.readline().rstrip()
    list1 = line1.split(" ")
    return int(list1[0]),int(list1[1])

def main():
    n,x = readQuestion()
    answer = solve(n,x)
    print(answer)
    
if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X,Y = map(int,input().split())
print(X+Y/2)

X,Y = map(int,input().split())
print(int(X+Y/2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
x,y = map(int,input().split())
print(x+y/2)

x,y = map(int,input().split())
print(x+y//2)

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X, Y = map(int, input().split(" "))
print(X + (Y / 2))

X, Y = map(int, input().split())
print(X + Y / 2)

X, Y = map(int, input().split())
print(X + Y // 2)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
a,b = map(int, input().rstrip().split())


print(a + b/2)

a,b = map(int, input().rstrip().split())
print(int(a + b / 2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
a,b=map(int,input().split())
print(a+b/2)

a,b=map(int,input().split())
print(a+(b/2))


a,b=map(int,input().split())
print(int(a+b/2))


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X,Y = map(int,input().split())
x = X + (Y/2)
print(x)

X,Y = map(int,input().split())
x = X + int((Y/2))
print(x)



Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X,Y = map(int, input().split())
# N = int(input())
print(X + Y / 2)

X,Y = map(int, input().split())
# N = int(input())
print(X + Y // 2)

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):

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

print(x+y/2)


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

print(int(x+y/2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X, Y = map(int, input().split())
print(X+Y/2)


X, Y = map(int, input().split())
print(int(X+Y/2))


Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
x,y=map(int,input().split())
print((x+y)//2)

x, y = map(int, input().split())
print(int(x + y/2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X = int(input())
Y = int(input())
a = int(X + Y/2)
print(a)

X,Y = map(int,input().split())
a = int(X + Y/2)
print(a)


Verdicts: Runtime Error

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
x, y = map(int, input().split())
print(x + y / 2)

x, y = map(int, input().split())
print(int(x + y / 2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
X,Y = map(int,input().split(' '))
print(X + Y/2)

X,Y = map(int,input().split(' '))
print(int(X + Y/2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
x,y=map(int,input().split())
print(x+y/2)


x,y=map(int,input().split())
print(int(x+y/2))


Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
a,b=map(int,input().split())
print(a+(b/2))

a,b=map(int,input().split())
print(a+(b//2))

Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
l = list(map(int, input().split()))
print(sum(l)-l[1]/2)

l = list(map(int, input().split()))
print(int(sum(l)-l[1]/2))


Verdicts: Wrong Answer

Accepted
Problem: There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?

Submission attempts (in order):
n = int(input())
t,a = map(int, input().split())
h = [int(i) for i in input().split()]
candidates = list(map(lambda x: abs(a - t - x * 0.006), h))
print(candidates.index(min(candidates)) + 1)


a,b= map(int, input().split())
print(a + int(b/2))

Verdicts: Runtime Error

Accepted