input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input=sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
Devide_N=10**9+7
Rem_2_32_DN=(2**32)%Devide_N
if N%2==1:
if A.count(0)!=1:
print((0))
else:
for ch_n in range(1,(N-1)//2+1):
if A.count(ch_n*2)!=2:
break
else:
A.remove(ch_... | import sys
input=sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
Devide_N=10**9+7
Rem_2_32_DN=(2**32)%Devide_N
if N%2==1:
if (A[0]!=0 or A[1]==0 if N>2 else A[0]!=0):
print((0))
else:
del A[0]
for ch_n in range(1,(N-1)//2+1):
if A[0]!=ch_n*2 or A[... | p03846 |
N=int(eval(input()))
A=list(map(int,input().split()))
mod=10**9+7
A.sort()
ans=1
if N%2==1:
i=1
if A[0]!=0:
print((0))
exit()
while i<N:
if A[i]==A[i+1] and A[i]==(i//2+1)*2:
i+=2
ans*=2
ans%=mod
else:
print((0))
exit()
print(ans)
else:
i=0
... | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
mod=10**9+7
ans=1
A.sort()
if N%2==0:
for i in range(0,N,2):
if A[i]!=A[i+1] or A[i]!=i+1:
print((0))
exit()
ans=ans*2%mod
print(ans)
else:
if A[0]!=0:
print((0))
exit()
... | p03846 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | a=1000000007
n=int(eval(input()))
l=list(map(int,input().split()))
l.sort()
if n%2==1:
if l[0]!=0:
print((0))
exit()
else:
l.remove(0)
sh=2
f=0
for i in l:
if f==0:
if i!=sh:
print((0))
exit()
else:
f=1
else:
... | p03846 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | p03846 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | p03846 |
def index(n:int, a: int):
if a % 2 == 0:
i = n // 2 - a // 2
j = (i + 1) * -1
return (i, j) if i != n // 2 else (i,)
else:
i = (n // 2 - 1) - (a - 1) // 2
j = (i + 1) * -1
return (i, j)
n = int(eval(input()))
line = [0 for _ in range(n)]
for a in map(... | n = int(eval(input()))
a = [int(x) for x in input().split()]
line = [abs(i - (n - i - 1)) for i in range(n)]
if sorted(a) == sorted(line):
print(((2 ** (n // 2)) % (10 ** 9 + 7)))
else:
print((0)) | p03846 |
from collections import Counter
mod = 10 ** 9 + 7
n = int(eval(input()))
A = Counter([int(i) for i in input().split()])
ans = 0
if n % 2 == 1:
for k, v in list(A.items()):
if k == 0 and v != 1:
ans = 0
break
elif v >= 3:
ans = 0
break
... | from collections import Counter
mod = 10 ** 9 + 7
n = int(eval(input()))
A = Counter([int(i) for i in input().split()])
flag = 0
cnt = 0
if n % 2 == 1:
for k, v in list(A.items()):
if k != 0 and v == 2:
cnt += 1
elif k == 0 and v == 1:
pass
else:
... | p03846 |
import queue, math
while True:
l = 0; r = []
try:
inp = list(map(int, input().split()))
l = inp[0]
r = inp[1:]
except EOFError:
break
n = len(r)
if 2*sum(r) < l:
print("OK")
else:
que = queue.PriorityQueue()
dp = [[1000.0 for ... | import queue, math
while True:
l = 0; r = []
try:
inp = list(map(int, input().split()))
l = inp[0]
r = inp[1:]
except EOFError:
break
n = len(r)
if 2*sum(r) <= l:
print("OK")
else:
n2 = 2**n-1
que = queue.PriorityQueue()
... | p00120 |
import sys
from math import sqrt
def rec(state, v):
if state == (1 << N) - 1:
return cakes[v]
if dp[state][v] != -1:
return dp[state][v]
ret = INF
for i in range(N):
if not (state >> i & 1):
ret = min(ret, rec(state | 1 << i, i) + sqrt(pow(cakes[i] + c... | import sys
from math import sqrt
def rec(state, v):
if state == (1 << N) - 1:
return cakes[v]
if dp[state][v] != -1:
return dp[state][v]
ret = INF
for i in range(N):
if state == 0:
ret = min(ret, rec(1 << i, i) + cakes[i])
elif not (state >> i... | p00120 |
import sys
from math import sqrt
testcases = [[int(x) for x in line.split()] for line in sys.stdin.readlines()]
for testcase in testcases:
box, *cakes = testcase
N = len(cakes)
INF = box + 1
dp = [[INF] * N for _ in range(1 << N)]
dp[(1 << N) - 1][0] = 0
for state in reversed(list(r... | import sys
from math import sqrt
def rec(state, v):
if state == (1 << N) - 1:
return cakes[v]
if dp[state][v] != -1:
return dp[state][v]
ret = INF
for u in range(N):
if state == 0:
ret = min(ret, rec(1 << u, u) + cakes[u])
elif not (state >> u... | p00120 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0120
"""
import sys
from sys import stdin
input = stdin.readline
def calc_width(cakes):
# ??±????????????????????????(?????????)????????????????????????????????????????¨??????????
if len(cakes) == 1:
ret... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0120
"""
import sys
from sys import stdin
input = stdin.readline
def calc_width(cakes):
# ??±????????????????????????(?????????)????????????????????????????????????????¨??????????
if len(cakes) == 1:
ret... | p00120 |
import sys,itertools
for s in sys.stdin:
a=list(map(int,s.split(" ")))
w=a[0]
n=len(a)-1
A=itertools.permutations(a[1:],n)
s0=1e9
for e in A:
s=e[0]+e[-1]
for i in range(n-1): s+=2*(e[i]*e[i+1])**.5
if s<s0: s0=s
if s0<=w: break
print(["OK","NA"][s0>w]) | import sys
for s in sys.stdin:
a=list(map(int,s.split(" ")))
w=a[0]
a=sorted(a[1:])
n=len(a)
A=[]
A.append(a.pop(0))
while a:
A=[a.pop()]+A
if a==[]: break
A+=[a.pop()]
if a==[]: break
A=[a.pop(0)]+A
if a==[]: break
A+=[a.pop(0)]
a=A[0]+A[-1]
for i in range... | p00120 |
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
s=n*a
dp=[[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
dp[0][0][0]=1
for i in range(n):
for j in range(i+2):
for k in range(s+1):
if(k>=x[i]):
dp[i+1][j][k]=dp[i][j-1][k-x[i]]+dp[i][j][k]
else:
... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
y=[]
for i in x:
y.append(i-a)
s=2*n*a
dp=[[0 for i in range(s+1)] for j in range(n+1)]
dp[0][n*a]=1
for i in range(n):
for j in range(s+1):
x=j-y[i]
if(0<=x and x<=2*n*a):
dp[i+1][j]=dp[i][j-y[i]]+dp[i][j]
else:
... | p04015 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, ... | N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = [x - A for x in X]
dp = [0] * 5010
dp[2500] = 1
for y in Y:
r = []
if y >= 0:
r = list(range(5009, -1, -1))
else:
r = list(range(5010))
for i in r:
if i - y < 0 or i - y >= 5010:
... | p04015 |
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0 for _ in range(50*N + 1)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
# i番目までのカードが選べる時にj-1枚選んでありｊ枚目にiを選ぶとき合計がA*(j)になるかどうか
# dp[i][j][k] : j-1枚選んでいてiを次に選んだ時に合計がｋになる組の数
for i in range(N+1):
for j in r... | N,A = list(map(int, input().split()))
X = list(map(int, input().split()))
# i番目までからｊ枚選んで合計がｋ
dp = [[[0 for _ in range(50*N + 1)] for _ in range(N+1)] for _ in range(N+1)]
# 何も選ばず平均が０
dp[0][0][0] = 1
#全てのカードについてみる
#i-1番までからj-1枚選んで、j番目にiを選択したときの合計がA*jになるかどうか
for i in range(N+1):
#i-1番目までからj-1枚選んであるので、最大で... | p04015 |
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
for i in range(n):
x[i]-=a
dp=[]
for i in range(n+1):
dp.append([])
for i in range(6000):
dp[-1].append(0)
dp[0][3000]=1
for i in range(n):
for j in range(6000):
if j+x[i]<6000 and j+x[i]>=0:
dp[i+1][j+x[i]]+=dp[i][j]... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
dic={}
dic2=dic.copy()
for i in range(n):
for j in dic:
if j+x[i]-a in dic2:
dic2[j+x[i]-a]+=dic[j]
else:
dic2[j+x[i]-a]=dic[j]
if x[i]-a in dic2:
dic2[x[i]-a]+=1
else:
dic2[x[i]-a]=1
dic=dic2.copy()
i... | p04015 |
N, A = (int(i) for i in input().split())
x = [int(i) for i in input().split()]
sumx = sum(x)
DP = [[[0] * (N+1) for i in range(sumx+1)] for i in range(N+1)]
DP[0][0][0] = 1
for i in range(N):
for j in range(sumx+1):
for k in range(N):
if j - x[i] >= 0:
DP[i+1][j][k+1] +=... | N, A = (int(i) for i in input().split())
x = [int(i) for i in input().split()]
sumx = sum(x)
DP = [[[0] * (N+1) for i in range(sumx+1)] for i in range(N+1)]
DP[0][0][0] = 1
for i in range(N):
for j in range(sumx+1):
for k in range(i+1):
if j - x[i] >= 0:
DP[i+1][j][k+1] ... | p04015 |
# ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple(map(int, input().split()))
# dp[i][j][k] := patterns to make k with j cards from X1, X2, ..., Xi
dp = [[[0] * (N * 50 + 1) for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0][0] = 1
... | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple([int(x) - A for x in input().split()])
D = {0: 1}
for i in X:
for j, k in list(D.items()):
D[i + j] = D.get(i + j, 0) + k
ans = D[0] - 1
print(ans)
if __n... | p04015 |
from collections import Counter
def inpl():
return list(map(int, input().split()))
N, A = inpl()
X = inpl()
cX = Counter(X)
dp = [[[0 for _ in range(N * max(X) + 1)] for j in range(i + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(1, N + 1):
x = X[i - 1]
for j in ran... | def inpl():
return list(map(int, input().split()))
N, A = inpl()
X = inpl()
maxX = max(X)
dp = [[[0 for _ in range(N * maxX + 1)] for j in range(i + 1)]
for i in range(51)]
dp[0][0][0] = 1
for i in range(N):
x = X[i - 1]
for j in range(i + 1):
for k in range(N * maxX + 1):
... | p04015 |
N,A = list(map(int,input().split()))
X = [int(x)-A for x in input().split()]
z = 0
dic = {}
for x in X:
if x==0:
z += 1
else:
dic[x] = dic.get(x,0) + 1
line = {}
line[0] = 1
for k in dic:
line_k = {}
for i in range(dic[k]+1):
line_k[k*i] = 1... | N,A = list(map(int,input().split()))
X = [int(x)-A for x in input().split()]
d = {0:1}
for x in X:
d_tmp = d.copy()
for k in d_tmp:
d[k+x] = d.get(k+x,0)+d_tmp[k]
print((d[0]-1))
| p04015 |
import sys
import itertools
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl... | import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split(... | p04015 |
import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split(... | import sys
import copy
readline = sys.stdin.buffer.readline
def main():
N, A = list(map(int, readline().split()))
X = list(map(int, readline().split()))
X = [x - A for x in X]
dp = [0] * 5050
dp[2525] = 1
for i in range(N):
next_dp = copy.copy(dp)
for t in ... | p04015 |
MAX=2500
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
# dp[i][j][k] := x[0:i]のカードからj枚とって合計がkとなる取り方の数
dp = [[[0] * (MAX+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
for j in range(0,n+1):
for k in range(0, MAX+1):
dp[i+1][j][k] += dp[i][j][... | MAX=2500
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
# dp[i][j][k] := x[0:i]のカードからj枚とって合計がkとなる取り方の数
dp = [[[0] * (MAX+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
for j in range(0,n+1):
for k in range(0, MAX+1):
dp[i+1][j][k] += dp[i][j][... | p04015 |
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
table = [[[0]*(N*A+1) for i in range(N+1)] for j in range(N+1)]
table[0][0][0] = 1
for j in range(1,N+1):
for k in range(N+1):
for s in range(N*A+1):
c = x[j-1]
if s-c<0:
table[j][k][s] = table[j-1][k][s]... | N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
table = [[[0]*(N*A+1) for i in range(N+1)] for j in range(N+1)]
table[0][0][0] = 1
for j in range(1,N+1):
for k in range(j+1):
for s in range(N*A+1):
c = x[j-1]
if s-c<0:
table[j][k][s] = table[j-1][k][s]... | p04015 |
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
ans = 0
dp = [[[0]*(50*N+1) for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for j in range(1,N+1):
for k in range(N+1):
for s in range(50*N+1):
dp[j][k][s] = dp[j-1][k][s]
if s>=x[j-1]:
dp[j][k]... | N, A = list(map(int, input().split()))
x= [int(i) for i in input().split()]
X = max(x)
dp = [[[0]*(X*N+1) for i in range(N+1)] for j in range(N+1)]
dp[0][0][0] = 1
ans = 0
for j in range(1,N+1):
for k in range(j+1):
for s in range(X*N+1):
dp[j][k][s] = dp[j-1][k][s]
if s >= x[j-1]:
... | p04015 |
n, A = list(map(int,input().split()))
x = list(map(int,input().split()))
dp = [list( [0 for _ in range(10**4)] for _ in range(n+1)) for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
for k in range(n):
for s in range(sum(x)+1):
dp[i+1][k][s] += dp[i][k][s]
... | n, A = list(map(int,input().split()))
x = list(map(int,input().split()))
dp = [list( [0 for _ in range(3000)] for _ in range(n+1)) for _ in range(n+1)]
dp[0][0][0] = 1
for i in range(n):
for k in range(n):
for s in range(sum(x)+1):
dp[i+1][k][s] += dp[i][k][s]
d... | p04015 |
n, a =list(map(int, input().split()))
x=list(map(int, input().split()))
x=[i-a for i in x]
memo=[[-1]*6000 for i in range(60)]
def dp(k, value):
if k==n:
if value==0:
return 1
else:
return 0
if memo[k][value]>0:
return memo[k][value]
memo[k][value]... | n, a =list(map(int, input().split()))
x=list(map(int, input().split()))
x=[i-a for i in x]
memo=[[-1]*6000 for i in range(60)]
def dp(k, value):
if k==n:
if value==0:
return 1
else:
return 0
if memo[k][value]>=0:
return memo[k][value]
memo[k][value... | p04015 |
N, A = list(map(int, input().split(' ')))
X = list(map(int, input().split(' ')))
X = [x - A for x in X]
from collections import defaultdict
counter = defaultdict(int)
counter[0] = 1
for x in X:
copy = dict(counter)
for d,c in list(copy.items()):
counter[d+x] += c
print((counter[0]-1)) |
from collections import defaultdict
N, A = list(map(int, input().split()))
X = [int(s) - A for s in input().split()]
counter = defaultdict(int)
counter[0] = 1
for x in X:
for d,c in list(counter.items()):
counter[d+x] += c
print((counter[0]-1)) | p04015 |
n,a=list(map(int,input().split()))
X=list(map(int,input().split()))
dp=[[[0]*(sum(X)+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0]=1
for i in range(1,n+1): #x_1,x_2...x_n
for k in range(i): #k枚数選ぶ
for j in range(sum(X)+1): #合計
if dp[i-1][k][j]:
dp[i][k+1][j+X[i-1]]+=dp[i-1][... | n,a=list(map(int,input().split()))
X=list(map(int,input().split()))
dp=[[[0]*(sum(X)+1) for _ in range(n+1)] for _ in range(n+1)]
dp[0][0][0]=1
for i in range(1,n+1): #x_1,x_2...x_n
for k in range(i): #k枚数選ぶ
for s in range(sum(X)+1): #合計
if dp[i-1][k][s]:
dp[i][k+1][s+X[i-1]]+=dp[i-1... | p04015 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
from copy import copy
def resolve():
n,a=list(map(int,input().split()))
X=list([int(x)-a for x in input().split()])
dp=defaultdict(int)
dp[0... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,a=list(map(int,input().split()))
dp=defaultdict(int)
dp[0]=1
for x in map(int,input().split()):
x-=a
ndp... | p04015 |
N, A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[ 0 for _ in range(50*N + 1)] for _ in range(N+1) ] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(N+1):
for k in range(50*N+1):
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[... | N, A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[0 for _ in range(50*N + 1)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(i+1):
for k in range(50*N+1):
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[i-1]... | p04015 |
N, A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[0 for _ in range(50*N + 1)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(i+1):
for k in range(50*N+1):
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[i-1]... | N, A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[0 for _ in range(50*50 + 1)] for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(1, N+1):
for j in range(i+1):
for k in range(50*j+1):
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k-X[i-1... | p04015 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | p04015 |
N, A = list(map(int, input().split()))
X = list([int(x)-A for x in input().split()])
X_MAX = max(max(X), -min(X))
NX = N * X_MAX
dp = [[[0] * (N+1) for i in range(N+1)] for _ in range(NX * 2 + 1)]
dp[NX][0][0] = 1
for i in range(1, N+1):
for j in range(0, i+1):
for k in range(NX * 2 + 1):
... | N, A = list(map(int, input().split()))
X = list([int(x)-A for x in input().split()])
X_MAX = max(max(X), -min(X))
NX = N * X_MAX
dp = [[0] * (X_MAX * (N+1) * 2 + 1) for i in range(N+1)]
dp [0][NX] = 1
for i in range(1, N+1):
for j in range(NX*2+1):
dp[i][j] += dp[i-1][j]
dp[i][j] += dp[i-1... | p04015 |
N,A = list(map(int,input().split()))
x = list(map(int,input().split()))
X = N*50
dp = [[[0 for i in range(X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for k in range(1,N+1):
for j in range(k+1):
for i in range(X+1):
if i - x[k-1] < 0:
dp[k][j][i] = dp[... | N,A = list(map(int,input().split()))
x = list(map(int,input().split()))
X = N*50
dp = [[[0 for i in range(X+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for k in range(1,N+1):
for j in range(k+1):
for i in range(j*50+1):
if i - x[k-1] < 0:
dp[k][j][i] = ... | p04015 |
# -*- coding: utf-8 -*-
line = input().split(" ")
n = int(line[0])
a = int(line[1])
x = [int(i) for i in input().split(" ")]
X = max(max(x), a)
dp = [[[0 for s in range(n*X+1)] for k in range(n+1)] for j in range(n+1)]
dp[0][0][0] = 1
for j in range(n+1):
for k in range(n+1):
for s in rang... | n,a = list(map(int, input().split()))
xl = list(map(int, input().split()))
offset = 300
dp = [[0]*600 for _ in range(n+1)]
dp[0][offset] = 1
for i in range(1,n+1):
x = xl[i-1]-a
for j in range(-300,300):
dp[i][offset+j] = dp[i-1][offset+j]
if 600>offset+j-x>=0:
dp[i][offs... | p04015 |
n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
dp=[[[0 for i in range(2501)] for j in range(n+1)] for k in range(n+1)]
#dp[i][j][k]:=i枚目まで見てj枚選んで和がkとなるようなカードの取り方の数
dp[0][0][0]=1
for i in range(n):
see=x[i]
for j in range(i+2):
for k in range(2501):
dp[i+1][j][k]... | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
dp=[[[0 for i in range(2501)] for j in range(k+2)] for k in range(n+1)]
#dp[i][j][k]:=i枚目まで見てj枚選んで和がkとなるようなカードの取り方の数
dp[0][0][0]=1
for i in range(n):
see=x[i]
for j in range(i+2):
for k in range(2501):
dp[i+1][j][k]... | p04015 |
def main():
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
x.insert(0, 0)
dp = [[[0 for _ in range(N * A + 1)] for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(N + 1):
dp[i][0][0] = 1
for i in range(1, N + 1):
for j in range(1... | def main():
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
x.insert(0, 0)
dp = [[[0] * (N * A + 1) for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(N + 1):
dp[i][0][0] = 1
for i in range(1, N + 1):
for j in range(1, i + 1):
... | p04015 |
def main():
N, A = list(map(int, input().split()))
x = list(map(int, input().split()))
x.insert(0, 0)
dp = [[[0] * (N * A + 1) for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(N + 1):
dp[i][0][0] = 1
for i in range(1, N + 1):
for j in range(1, i + 1):
... | def main():
N, A = list(map(int, input().split()))
x = [0]
x.extend(list(map(int, input().split())))
dp = [[[0 for _ in range(N * A + 1)] for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(N + 1):
dp[i][0][0] = 1
for i in range(1, N + 1):
for j in range(1, i... | p04015 |
N,A=list(map(int,input().split()))
x=list(map(int,input().split()))
dp=[[[0 for i in range(50*50+1)] for j in range(N+1) ]for k in range(N+1)]
dp[0][0][0]=1
for i in range(1,N+1):
for j in range(N+1):
for k in range(50*50+1):
dp[i][j][k]=dp[i-1][j][k]
if x[i-1]<= k and j>0: dp[i][j][k]+=dp[i-1... | N,A=list(map(int,input().split()))
x=list(map(int,input().split()))
X=max(max(x),A)
y=[x[i]-A for i in range(N)]
dp=[[0 for i in range(2*N*X+1)] for j in range(N+1)]
dp[0][N*X]=1
for j in range(1,N+1):
for k in range(2*N*X+1):
dp[j][k]=dp[j-1][k]
if 0<= k-y[j-1] and k-y[j-1]<=2*N*X:
dp[j][k]+=... | p04015 |
n,a,*x=list(map(int,open(0).read().split()));dp={0:1}
for i in x:
for k,v in set(dp.items()):
dp[i+k-a]=dp.get(i+k-a,0)+v
print((dp[0]-1)) | n,a,*X=list(map(int,open(0).read().split()))
y=[a-x for x in X]
dp={0:1}
for i in y:
for k,v in set(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print((dp[0]-1)) | p04015 |
n,a=list(map(int,input().split()))
y=[a-int(x) for x in input().split()]
dp={0:1}
for i in y:
for k,v in list(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print((dp[0]-1)) | def main():
n,a=list(map(int,input().split()))
y=[a-int(x) for x in input().split()]
dp={0:1}
for i in y:
for k,v in list(dp.items()):
dp[i+k]=dp.get(i+k,0)+v
print((dp[0]-1))
if __name__=="__main__":
main() | p04015 |
def solve():
ans = 0
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
x = sum(X)
dp = [[[0]*2550 for _ in range(N+1)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(i+1):
for k in range(x):
dp[i+1][j][k] += dp[i][j][k]
... | N, A = list(map(int, input().split()))
X = list([int(x)-A for x in input().split()])
dp = [0]*10000
dp[0] = 1
for i in range(N):
new_dp = dp[:]
for j in range(-3000,3000):
if dp[j]>0:
new_dp[j+X[i]] += dp[j]
dp = new_dp
print((dp[0]-1))
| p04015 |
N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [[[0 for k in range(2501)] for j in range(N+1)] for i in range(N+1)]
for i in range(1,N+1):
x = X[i-1]
dp[i][1][x] += 1
for j in range(1,i+1):
for k in range(1,2501):
if k-x > 0:
d... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
for i in range(N):
X[i] -= A
from collections import defaultdict
counter = defaultdict(int)
counter[0] = 1
for x in X:
copy = dict(counter)
for k,v in list(copy.items()):
counter[k+x] += v
print((counter[0]-... | p04015 |
from collections import Counter
N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
dp = [Counter() for i in range(N+1)]
dp[0][0] = 1
for i,x in enumerate(X):
for j in range(i,-1,-1):
for k,v in list(dp[j].items()):
dp[j+1][k+x] += v
ans = 0
for i in range(1,N... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
from collections import defaultdict
dp = [defaultdict(lambda: 0) for _ in range(N+1)]
dp[0][0] = 1
for i,x in enumerate(X):
for j in range(i,-1,-1):
for k,v in list(dp[j].items()):
dp[j+1][k+x] += v
ans = 0
for... | p04015 |
n, a = list(map(int, input().split()))
xlist = list(map(int, input().split()))
j = n
k = n
t = n * a
dp = [[[0 for t in range(t + 1)] for k in range(k + 1)] for j in range(j + 1)]
dp[1][0][0] = 1
dp[0][0][0] = 1
# for d in dp:
# print(d)
# print(dp[1][1][15])
for ji in range(1, j + 1):
... | n, a = list(map(int, input().split()))
xlist = list(map(int, input().split()))
j = n
k = n
t = n * a
maxv = max(a, max(xlist))
dp = [[[0 for t in range(n*maxv + 1)] for k in range(k + 1)] for j in range(j + 1)]
dp[1][0][0] = 1
dp[0][0][0] = 1
# for d in dp:
# print(d)
# print(dp[1][1][15])
f... | p04015 |
import sys
from collections import defaultdict
def main():
N, A, *xlst = list(map(int, sys.stdin.read().split()))
x_p = []
x_n = []
x_z = 0
xlst.sort()
for i in xlst:
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
... | import sys
from collections import defaultdict
def main():
N, A, *xlst = list(map(int, sys.stdin.read().split()))
x_p = []
x_n = []
x_z = 0
for i in xlst:
if A < i:
x_p.append(i - A)
elif i < A:
x_n.append(A - i)
else:
x_z ... | p04015 |
n, a = list(map(int, input().split()))
xs = list(map(int, input().split()))
na = n*a
DP = [[0]*(na+1) for i in range(n+1)]
DP[0][0] = 1
for _ in range(n):
x = xs[_]
next = [[0]*(na+1) for i in range(n+1)]
for i in range(n):
for j in range(na+1):
# xを使わないとき
next... | n, a = list(map(int, input().split()))
xs = list(map(int, input().split()))
na = n*a
DP = [[0]*(na+1) for i in range(n+1)]
DP[0][0] = 1
for _ in range(n):
x = xs[_]
next = [[0]*(na+1) for i in range(n+1)]
for i in range(_+1):
for j in range(na+1):
# xを使わないとき
... | p04015 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# ありえる平均は1..50のいずれか
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
N, A = list(map(int, input().split()))
Xs = list(sorted(m... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 終了後に自力AC
#
# カードを「Aより小さい」「Aに等しい」「Aより大きい」に分ける。
#
# 「Aより小さい」カードで「和がSになる組み合わせの数」は容易に計算できる。
# 「Aより大きい」カードで「和がTになる組み合わせの数」も計算できる。
#
# あとはこれらを組み合わせるだけ
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools i... | p04015 |
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
# import numpy as np
# dp = np.full((n + 1, n + 1, n * max(x + [a]) + 1), None).tolist()
#
def full(shape, value):
if not shape:
return value
return [full(shape[1:], value) for _ in range(shape[0])]
dp = full((n + 1, n... | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
for i in range(n):
x[i] -= a
def full(shape, value):
if not shape:
return value
return [full(shape[1:], value) for _ in range(shape[0])]
minus_cnt = 0
plus_cnt = 0
for v in x:
if v < 0:
minus_c... | p04015 |
N, A = list(map(int, input().split()))
x = sorted(map(int, input().split()))
def solve(n):
mem = {}
def rec(i, a, d):
if (i, a, d) in mem:
return mem[(i, a, d)]
if i >= N:
return 0
if a < x[i]:
return 0
if d > n:
retur... | N, A = list(map(int, input().split()))
a = sorted([int(x)-A for x in input().split()])
mem = {}
def rec(p, acm):
if (p, acm) in mem:
return mem[(p, acm)]
if p >= N:
return 0
if a[p] > 0 and acm > 0:
return 0
mem[(p, acm)] = rec(p+1, acm+a[p]) + rec(p+1, acm)
if a... | p04015 |
import itertools
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
xa = []
xb = []
count = 0
for i in x:
if i > a:
xa.append(i-a)
elif i < a:
xb.append(i-a)
else:
count += 1
ans = 0
if len(xa) == 0 or len(xb) == 0:
print((2**count-1))
else:... | n,a = list(map(int, input().split()))
x = list(map(int,input().split()))
x = [i-a for i in x]
d = {}
d[0] = 1
for i in x:
for j,k in list(d.items()):
d[j+i] = d.get(j+i,0)+k
print((d[0]-1)) | p04015 |
n,a=list(map(int,input().split()))
l=list(map(int,input().split()))
dp=[0]*5300
dp[l[0]-a]=1
for x in l[1:]:
b=x-a
if b>=0:
for i in range(2500,-2501,-1):
dp[i+b]+=dp[i]
else:
for i in range(-2500,2501):
dp[i+b]+=dp[i]
dp[b]+=1
print((dp[0])) | n,a=list(map(int,input().split()))
from collections import defaultdict
dp=defaultdict(int)
dp[0]=1
for i in map(int,input().split()):
i-=a
for k in sorted(list(dp.keys()),reverse=(i>=0)):
dp[k+i]+=dp[k]
print((dp[0]-1)) | p04015 |
def makelist(n,m,p):
return [[[0 for k in range(p)]for i in range(m)]for j in range(n)]
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
X = max(x)
X = max(X,a)
dp = makelist(n+1,n+1,n*X+1)
dp[0][0][0] = 1
for j in range(n+1):
for k in range(n+1):
for s in range(n*X+... | def makelist2(n,m):
return[[0 for k in range(m)]for i in range(n)]
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
X = max(x)
X = max(X,a)
b=[]
for i in range(n):
b.append(x[i]-a)
dp =makelist2(n+1,2*n*X+1)
dp[0][n*X] = 1
for j in range(n+1):
for t in range(2*n*X+1)... | p04015 |
"""
普通に数え上げDPで行けそう
dp[i][j][k] -> カードをi枚使う/j種類目のカードまで見る/カードの数字の合計がkになる
j種類目のカードを使う場合：
dp[i][j][k] += dp[i-1][j-1][k-x]
j種類目のカードを使わない場合：
dp[i][j][k] += dp[i][j-1][k]
という風に計算していって、最終的に各iごとにk/i=Aとなるようなkを見出して、dp[i][-1][k]をanswerとして加算する。
"""
N,A = list(map(int,input().split()))
X = list(map(int,input().split()))... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
Y = [x-A for x in X]
t = sum(X)
dp = [[0]*(t*2+1) for _ in range(N+1)]
#dp[i][j] -> i枚目まで見る。合計をj-tにするパターン数
#i枚目を使う場合 -> dp[i][j] += dp[i-1][j-Yi]
#i枚目を使わない場合 -> dp[i][j] += dp[i-1][j]
dp[0][t] = 1
for i in range(1,N+1):
y = Y[i-1]
... | p04015 |
N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
X = [x-A for x in X]
dp = [[0]*(5001) for _ in range(N+1)]
dp[0][2500] = 1
for i in range(1,N+1):
x = X[i-1]
for j in range(5001):
dp[i][j] += dp[i-1][j]
if 0<=j-x<5001:
dp[i][j] += dp[i-1][j-x]
prin... | N,A = list(map(int,input().split()))
X = list(map(int,input().split()))
X = [A-x for x in X]
dp = [[0]*(5001) for _ in range(N+1)]
dp[0][2500] = 1
for i in range(1,N+1):
x = X[i-1]
for j in range(5001):
if 0<=j-x<5001:
dp[i][j] = dp[i-1][j-x]+dp[i-1][j]
else:
d... | p04015 |
n,a=list(map(int,input().split()))
X=list(map(int,input().split()))
dp=[[[0]*52 for _ in range(2505)] for _ in range(52)]
ans=0
dp[0][0][0]=1
for i in range(n):
for j in range(52+50*i):
for k in range(51):
ni=i+1
nj=j+X[i]
nk=k+1
dp[ni][nj][nk]+=dp[... | n,a=list(map(int,input().split()))
X=list(map(int,input().split()))
dp=[[[0]*55 for _ in range(2555)] for _ in range(55)]
ans=0
dp[0][0][0]=1
for i in range(n):
for j in range(52+50*i):
for k in range(n):
ni=i+1
nj=j+X[i]
nk=k+1
dp[ni][nj][nk]+=dp[i... | p04015 |
N = list(map(int,input().split()))[0]
lis = [[] for i in range(N)]
for a_i,b_i in [ list(map(int,input().split())) for _ in range(N-1) ]:
lis[a_i-1].append(b_i-1)
lis[b_i-1].append(a_i-1)
flag = False
while True:
flag = False
sumsum = 0
for x in lis:
sumsum += sum(x)
if sumsum == 0:
print("S... | N = list(map(int,input().split()))[0]
lis = [[] for i in range(N)]
for a_i,b_i in [ list(map(int,input().split())) for _ in range(N-1) ]:
lis[a_i-1].append(b_i-1)
lis[b_i-1].append(a_i-1)
while True:
sumsum = 0
for x in lis:
sumsum += sum(x)
if sumsum == 0:
print("Second")
quit()
for i i... | p03726 |
import collections
class Dinic:
def __init__(self, vnum):
self.edge = [[] for i in range(vnum)]
self.n = vnum
self.inf = float('inf')
def addedge(self, st, en, c):
self.edge[st].append([en, c, len(self.edge[en])])
self.edge[en].append([st, 0, len(self.edge[st])-1]... | from sys import exit
def Fi():
print('First')
exit()
N = int(eval(input()))
dim = [-1]*N
Edge = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
dim[a-1] += 1
dim[b-1] += 1
Edge[a-1].append(b-1)
Edge[b-1].append(a-1)
par = [None] + [0]*(N-1)
... | p03726 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p03726 |
from collections import deque
class BipartiteGraph:
"""二部グラフの最大マッチングを求めるなどする"""
def __init__(self, input_graph: list):
"""重み無し二部グラフinput_graphを入力する"""
n = len(input_graph)
self.INF = float("inf")
self.max_bipartite_matching = -1
# DFSでグラフを2色に彩色する
... | from collections import deque
n = int(eval(input()))
info = [list(map(int, input().split())) for i in range(n - 1)]
tree = [[] for i in range(n)]
for a, b in info:
a -= 1
b -= 1
tree[a].append(b)
tree[b].append(a)
root = 0
par = {root: -1}
q = deque([root])
topo = []
while q:
... | p03726 |
import sys
import random
input = sys.stdin.readline
n = int(eval(input()))
ab = [list(map(int,input().split())) for i in range(n-1)]
graph = [[] for i in range(n+1)]
degorigin = [0]*(n+1)
for a,b in ab:
graph[a].append(b)
graph[b].append(a)
degorigin[a] += 1
degorigin[b] += 1
if n == 2:
print("Se... |
import sys
input = sys.stdin.readline
n = int(eval(input()))
ab = [list(map(int,input().split())) for i in range(n-1)]
graph = [[] for i in range(n+1)]
deg = [0]*(n+1)
for a,b in ab:
graph[a].append(b)
graph[b].append(a)
deg[a] += 1
deg[b] += 1
if n == 2:
print("Second")
exit()
stack = []
r... | p03726 |
a=int(eval(input()))
b=list(map(int,input().split()))
c=max(b)+1
d=[]
ans=0
for i in range(a):
e=0
while c-e>b[i]:
e+=b[i]
d+=[e]
for i in b:
if d.count(i)==1:
ans+=1
print(ans) | n = int(eval(input()))
a = [int(i) for i in input().split()]
max_a = max(a)
cnt_d = [0] * (max_a + 1)
for ai in a:
for multi in range(ai, max_a + 1, ai):
cnt_d[multi] += 1
print((sum(cnt_d[ai] == 1 for ai in a))) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
check = [0] * 1000001
res = 0
for i in range(N):
if not check[A[i]] and (i == N-1 or A[i] != A[i+1]):
res += 1
for j in range(A[i], 1000001, A[i]):
check[j] = 1
print(res) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
check = [0] * 1000001
res = 0
for i in range(N):
if check[A[i]]:
continue
if i == N-1 or A[i] != A[i+1]:
res += 1
for j in range(A[i], 1000001, A[i]):
check[j] = 1
print(res) | p02642 |
import collections
from copy import copy
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])
... |
import collections
def main():
n = int(eval(input()))
A = sorted(map(int, input().split()))
D = collections.defaultdict(int)
for a in A:
D[a] += 1
m = max(A)
S = set()
ans = 0
for i in range(n):
a = A[i]
if a in S:
continue
... | p02642 |
N = int(eval(input()))
nokori = N
kaburi = set()
ans = 0
A = list(map(int,input().rstrip().split(" ")))
A2 = set()
for i in A:
if i in A2:
kaburi.add(i)
else:
A2.add(i)
for i in kaburi:
A2.remove(i)
for i in kaburi:
k = i * 2
while k < 1000000:
A2.discard(k)
... | N = int(eval(input()))
ans = 0
A = list(map(int,input().rstrip().split(" ")))
A.sort()
A2 = [True for i in range(A[-1] + 1)]
for i in range(len(A)):
k = A[i] * 2
if A2[A[i]]:
if i != 0 and A[i-1] == A[i]:
A2[A[i]] = False
while(k < len(A2)):
A2[k] = False
... | p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
l=[0 for i in range(10**6+1)]
for i in range(n):
l[a[i]]+=1
d={}
ans=0
for i in range(n):
x=a[i]
if x not in d:
if l[a[i]]==1:
flag=1
for j in range(1,int(x**0.5)+2):
if x%j==0:
if x!=j and l[j]>0:
f... | n=int(eval(input()))
a=list(map(int,input().split()))
if n!=1 and len(set(a))==1:
print((0))
exit()
l=[0 for i in range(10**6+1)]
for i in range(n):
l[a[i]]+=1
if n!=1 and min(a)>max(a)/2:
ct=0
for i in range(len(l)):
if l[i]==1:
ct+=1
print(ct)
exit()
d={}
ans=0
for i in range(... | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
T = set()
def counter(array):
from collections import Counter
return Counter(array)
c = counter(A)
for x in A:
T.add(x)
cnt = 0
maxi = max(A)
for x in sorted(A):
i = 2
while x * i <= maxi:
if x * i in T:
T.r... | N = int(eval(input()))
A = list(map(int,input().split()))
T = set()
for x in A: T.add(x)
maxi = max(A)
for x in sorted(A):
i = 2
while x * i <= maxi:
if x * i in T:
T.remove(x*i)
i += 1
ans = 0
def counter(array):
from collections import Counter
return C... | p02642 |
N = 1000001
a = [0]* N
eval(input())
for x in input().split():
a[int(x)] += 1
for i in range(1, N):
for j in range(i + i, N, i):
if a[i]:
a[j] = 0
print((a.count(1)))
| N = 1000001
a = [0]* N
eval(input())
for x in input().split():
a[int(x)] += 1
for i in range(1, N):
if a[i]:
for j in range(i + i, N, i):
a[j] = 0
print((a.count(1)))
| p02642 |
N = 1000001
a = [0]* N
_, s = open(0)
for x in s.split():
a[int(x)] += 1
for i in range(1, N):
for j in range(i + i, N, i):
if a[i]:
a[j] = 0
print((a.count(1)))
| N = 1000001
a = [0]* N
_, s = open(0)
for x in s.split():
a[int(x)] += 1
for i in range(1, N):
if a[i]:
for j in range(i + i, N, i):
a[j] = 0
print((a.count(1)))
| p02642 |
N = 1000001
a = [0]* N
_, s = open(0)
for x in s.split():
a[int(x)] += 1
for i in range(1, N):
if a[i]:
for j in range(i + i, N, i):
a[j] = 0
print((a.count(1)))
| N = 1000001
a = [0]* N
eval(input())
for x in input().split():
a[int(x)] += 1
for i in range(1, N):
if a[i]:
for j in range(i + i, N, i):
a[j] = 0
print((a.count(1)))
| p02642 |
n=int(eval(input()))
A=sorted(list(map(int,input().split())))
B=[0]*(1+max(A))
for i in A:
B[i]+=1
if B[i]==1:
for j in range(2*i,max(A)+1,i):
B[j]+=1
else:
continue
ans=0
for i in A:
if B[i]==1: ans+=1
print(ans) | n=int(eval(input()))
A=sorted(list(map(int,input().split())))
B=[0]*(1+A[-1])
for i in A:
B[i]+=1
if B[i]==1:
for j in range(2*i,A[-1]+1,i):
B[j]+=1
else:
continue
ans=0
for i in A:
if B[i]==1: ans+=1
print(ans) | p02642 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,inp... | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,inp... | p02642 |
inf = 1100000
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
detect = [0] *inf
for x in a:
if detect[x] != 0:
detect[x] = 2
for i in range(x, inf, x):
detect[i] += 1
ans = 0
for i in range(N):
if detect[a[i]] == 1:
ans += 1
... | inf = 1100000
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
detect = [0] *inf
for x in a:
if detect[x] != 0:
detect[x] = 2
continue
for i in range(x, inf, x):
detect[i] += 1
ans = 0
for i in range(N):
if detect[a[i]] == 1:
... | p02642 |
N =eval(input())
A = list(map(int, input().split()))
MA =max(A)
N=int(N)
s=0
A2 = [-1]
B =[-1]#重複
LS =[-1]
for i in range(0,N):
k=1
P =A[i]
if P in A2:
B.append(P)
pass
else:
while P*k<=MA:
LS.append(P*k)
k+=1
A2.append(P)
for j in range(0,N):
if A[j] in B:
... | N = eval(input())
A = list(map(int, input().split()))
N = int(N)
MA = max(A)
s=0
LS = [0 for i in range(0,MA)]
for i in range(0,N):
k=1
while A[i]*k<=MA:
LS[A[i]*k-1] +=1
k +=1
for j in range(0,N):
if LS[A[j]-1]==1:
s+=1
print(s) | p02642 |
import sys
import math
N = int(sys.stdin.readline().strip())
A = list(map(int, sys.stdin.readline().strip().split()))
A.sort()
# print(A)
ans = 0
invalid = set()
for i in range(N):
if A[i] in invalid:
continue
flag = True
for j in range(i+1, N):
if A[j] in invalid:
... | import sys
N = int(sys.stdin.readline().strip())
A = list(map(int, sys.stdin.readline().strip().split()))
A.sort()
max_a = max(A)
counts = [0 for _ in range(max_a + 1)]
ans = 0
for a in A:
counts[a] += 1
for a in A:
if counts[a] == 1:
ans += 1
n = 1
while n * a <= max_a:
... | p02642 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
A_list.sort()
A_max = A_list[N-1]
is_prime = [True] * (A_max+1)
is_prime[0] = False
for i in range(1, A_max):
if i not in A_list:
is_prime[i] = False
for i in A_list:
if not is_prime[i]:
continue
for j in ran... | N = int(eval(input()))
A_list = list(map(int, input().split()))
A_list.sort()
A_max = A_list[N-1]
is_prime = [False] * (A_max+1)
for i in A_list:
is_prime[i] = True
x = -1
for i in A_list:
if not is_prime[i]:
continue
elif x == i:
is_prime[i] = False
continue
... | p02642 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
divisible = [False for _ in range(int(1e6+1))]
cnt = defaultdict(int)
for a in A:
cnt[a] += 1
if divisible[a] == False:
for i in range(a+a, len(divisible), a):
divisible... | from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
divisible = [False for _ in range(int(1e6+1))]
cnt = defaultdict(int)
for a in A:
cnt[a] += 1
if divisible[a] == False and cnt[a] <= 1:
for i in range(a+a, len(divisible), a):
... | p02642 |
n = int(eval(input()))
ints = list(map(int, input().split()))
m = max(ints)
x = [0] * m
cnt = 0
for i in ints:
for j in range(m):
if (j + 1) % i == 0:
x[j] += 1
for i in ints:
if x[i-1] == 1:
cnt += 1
print(cnt)
| n = int(eval(input()))
ints = list(map(int, input().split()))
m = max(ints)
x = [0] * m
cnt = 0
for i in ints:
if x[i-1] >= 2:
continue
for j in range(m // i):
x[i * (j + 1) - 1] += 1
for i in ints:
if x[i - 1] == 1:
cnt += 1
print(cnt)
| p02642 |
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(sorted(map(int, readline... | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(sorted(map(int, readline... | p02642 |
def make_divisors(n):
if n == 1:
return [1]
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 divisors
N = int(eval(input()))
A = lis... | def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 7, 61] if n < 1 << 32 else [2, 3, 5, 7, 11, 13, 17] if n < 1 << 48 else [2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
... | p02642 |
def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 7, 61] if n < 1 << 32 else [2, 3, 5, 7, 11, 13, 17] if n < 1 << 48 else [2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
... | N = int(eval(input()))
A = list(map(int, input().split()))
ma = max(A)
X = [0] * (ma + 1)
ans = 0
A.sort()
for a in A:
X[a] += 1
for a in A:
if X[a] ==1:
ans += 1
num = 1
while num * a <= ma:
X[num * a] += 2
num += 1
print(ans)
| p02642 |
from collections import deque
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
d = deque(a)
cnt = 0
while len(d) > 0:
dd = d.pop()
flg = 0
for i in reversed(list(range(len(d)))):
if d[i] == dd:
del d[i]
flg = 1
elif d[i]... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a_max=max(a)
check = [0]*(a_max+1)
for i in a:
if check[i] != 0:
check[i] = 2
continue
if check[i] == 0:
check[i] = 1
for j in range(1,a_max//i):
check[(j+1)*i] = 2
print((check.cou... | p02642 |
N = int(eval(input()))
leng = 10**6+1
memo = [0]*leng
li = []
for n in map(int, input().split()):
x = 0
li.append(n)
while x < leng:
memo[x] +=1
x += n
count = 0
for n in li:
if memo[n] == 1:
count+=1
print(count) | N = int(eval(input()))
leng = 10**6+1
memo = [0]*leng
li = []
for n in map(int, input().split()):
x = 0
li.append(n)
if memo[n] >1:
pass
else:
while x < leng:
memo[x] +=1
x += n
count = 0
for n in li:
if memo[n] == 1:
count+=1
print(co... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
def divisor(N):
from math import sqrt
D = []
for i in range(1, int(sqrt(N)) + 1):
if N % i == 0:
D.append(i)
D.append(N // i)
return list(set(D))
count = 0
A_set = set(A)
A_dict = {a: 0 for a in A}... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
A_max = max(A)
dp = [True] * (A_max + 1)
count = 0
A_f = {a: 0 for a in A}
for a in A:
A_f[a] += 1
for a in A:
if dp[a]:
for i in range(1, A_max + 1):
if a * i > A_max:
break
dp[... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
def divisor(N):
from math import sqrt
D = []
for i in range(1, int(sqrt(N)) + 1):
if N % i == 0:
D.append(i)
D.append(N // i)
return list(set(D))
count = 0
A_set = set(A)
A_dict = {a: 0 for a i... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
A_max = max(A)
dp = [True] * (A_max + 1)
count = 0
A_f = {a: 0 for a in A}
for a in A:
A_f[a] += 1
for a in A:
if dp[a]:
for i in range(1, A_max + 1):
if a * i > A_max:
break
dp[... | p02642 |
from collections import Counter
def solve(string):
n, *a = list(map(int, string.split()))
table = [True] * (10**6 + 1)
for _a in a:
if table[_a]:
for i in range(2 * _a, max(a) + 1, _a):
table[i] = False
return str(sum(table[k] for k, v in list(Counter(a).i... | from collections import Counter
def solve(string):
n, *a = list(map(int, string.split()))
table = [True] * (10**6 + 1)
ma = max(a)
for _a in a:
if table[_a]:
for i in range(2 * _a, ma + 1, _a):
table[i] = False
return str(sum(table[k] for k, v in list... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
m = 10 ** 6 + 7
count = [0] * m
for x in a:
if count[x] != 0:
count[x] = 2
continue
for i in range(x, m, x):
count[i] += 1
ans = 0
for x in a:
if count[x] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
m = max(a) + 1
a = sorted(a)
count = [0] * m
for x in a:
if count[x] != 0:
count[x] = 2
continue
for i in range(x, m, x):
count[i] += 1
ans = 0
for x in a:
if count[x] == 1:
ans += 1
print(a... | p02642 |
# ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import * # ll = deepcopy(l)
from heapq import * # heappush(hp,x)
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(... | # ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import * # ll = deepcopy(l)
from heapq import * # heappush(hp,x)
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(... | p02642 |
N = int(eval(input()))
X = list(map(int, input().split()))
MAX = 10 ** 6 + 1
prime = [True] * MAX
counted = set()
for v in X:
if v in counted:
prime[v] = False
for j in range(2 * v, MAX, v):
prime[j] = False
counted.add(v)
ans = 0
for v in X:
ans += int(prime[v])
prin... |
N = int(eval(input()))
X = list(map(int, input().split()))
MAX = 10 ** 6 + 1
prime = [True] * MAX
counted = set()
for v in X:
if v in counted:
prime[v] = False
continue
for j in range(2 * v, MAX, v):
prime[j] = False
counted.add(v)
ans = 0
for v in X:
ans += i... | p02642 |
N = int(eval(input()))
X = list(map(int, input().split()))
MAX = 10 ** 6 + 1
prime = [True] * MAX
counted = set()
for v in X:
if v in counted:
prime[v] = False
continue
for j in range(2 * v, MAX, v):
prime[j] = False
counted.add(v)
ans = 0
for v in X:
ans += i... |
from collections import Counter
N = int(eval(input()))
X = list(map(int, input().split()))
lim = 10 ** 6 + 10
ok = [True] * (lim + 1)
ans = 0
ctr = Counter(X)
for n in sorted(X):
if ok[n]:
if ctr[n] == 1:
ans += 1
for j in range(n, lim + 1, n):
ok[j] = Fal... | p02642 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | p02642 |
from collections import Counter
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
c = Counter(A)
result = 0
piyo = []
for k, v in list(c.items()):
if v > 1:
piyo.append(k)
A.remove(k)
for a in A:
flag = False
for hoge in piyo:
if a % hoge == 0:
... | def main():
from collections import Counter
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
c = Counter(A)
result = 0
flag = [True] * (A[-1] + 1)
for i in A:
if flag[i]:
result += 1
for j in range(2*i, A[-1] + 1, i):
... | p02642 |
# coding: utf-8
def yakusu(n):
ans = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
ans.append(i)
if n // i != i:
ans.append(n // i)
return sorted(ans)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))... | # coding: utf-8
# 13:42- kaisetsu and try again
# -14:03 giveup (WA*6) -> testcase
def main():
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
M = 10**6
is_ans_flag = [0] * (M+1)
n_appeared_in_A = [0] * (M+1)
for a in A:
n_appeared_in_A[a] += 1
... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * ((10**6) + 1)
ans = 0
for i in a:
for j in range(i, (10**6)+1,i):
cnt[j] += 1
for i in a:
if cnt[i] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a_max = max(a)
cnt = [0] * (max(a) + 1)
ans = 0
for ai in a:
for multi in range(ai, a_max + 1, ai):
cnt[multi] += 1
for ai in a:
if cnt[ai] == 1:
ans += 1
print(ans) | p02642 |
n=int(eval(input()))
import math
a=list(map(int,input().split()))
d=dict()
for i in range(n):
if d.get(a[i],None)==None:
d[a[i]]=0
d[a[i]]+=1
ans=0
s=list(d.keys())
for i in range(n):
if d[a[i]]>1:
continue
flag=True
# print(a[i],end=' s\n')
for ii in range(1,... | n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)
dp=[0 for i in range(m+1)]
ans=0
for i in range(n):
if dp[a[i]]>=1:
dp[a[i]]+=1
continue
for j in range(2*a[i],m+1,a[i]):
dp[j]+=1
dp[a[i]]=1
for i in range(n):
if dp[a[i]]==1:
ans+=1
print(an... | p02642 |
from sys import stdin
def main():
n = int(stdin.readline().strip())
a = list(map(int, stdin.readline().strip().split()))
if n == 1:
print((1))
exit()
a.sort()
# bにチェックする数を追加していく
b = []
ans = 0
for i in range(n):
if a[i] == a[i-1]:
... | from sys import stdin
def main():
n = int(stdin.readline().strip())
a = list(map(int, stdin.readline().strip().split()))
if n == 1:
print((1))
exit()
a.sort()
dp = [True] * (a[-1] + 1)
ans = 0
for i in range(n):
if a[i] == a[i-1]:
... | p02642 |
n = int(eval(input()))
An = list(map(int, input().split()))
An.sort()
idx = 0
while True:
if idx == len(An):
ans = len(An) - An.count(0)
print(ans)
exit()
flg = False
if An[idx] != 0:
for i in range(idx + 1, len(An)):
if An[i] != 0 and An[i] % ... | n = int(eval(input()))
An = list(map(int, input().split()))
An.sort()
max_num = An[-1]
primes = [True] * max_num
once = [False] * max_num
i = 0
while i < n:
once[An[i] - 1] = True
j = 1
while i + j < n:
if An[i] == An[i + j]:
once[An[i] - 1] = False
j += ... | p02642 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
a.sort()
a = tuple(a)
TorF = [0] * (a[-1] + 1)
for ae in a:
TorF[ae] = 1
for i1 in range(n - 1):
if TorF[a[i1]]:
t = a[i1] * 2
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
a.sort()
a = tuple(a)
TorF = [0] * (a[-1] + 1)
for ae in a:
TorF[ae] = 1
for i1 in range(n - 1):
a1 = a[i1]
if TorF[a1]:
m = a[-1] ... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
MAX_A = 10 ** 6
X = [0] * (MAX_A + 1)
for a in A:
for i in range(a, MAX_A + 1, a):
X[i] += 1
ans = len([a for a in A if X[a] == 1])
print(ans)
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
A = set(A)
MAX_A = 10 ** 6
X = [0] * (MAX_A + 1)
for a in A:
for i in range(a, MAX_A + 1, a):
X[i] += 1
ans = len([a for a in A if (X[a] == 1) and (C[a] == 1)])
print(ans)
| p02642 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.