input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = [int(i) for i in input().split()]
max_a = max(a)
flag = [True for i in range(max_a+1)]
dup = set()
for i in range(n):
if a[i] in dup:
flag[a[i]] = False
else:
dup.add(a[i])
for j in range(2*a[i], max_a+1, a[i]):
flag[j] = False
ans = 0
fo... | n = int(eval(input()))
a = [int(i) for i in input().split()]
max_a = max(a)
flag = [True for i in range(max_a+1)]
dup = set()
for i in range(n):
if a[i] in dup:
flag[a[i]] = False
else:
dup.add(a[i])
for j in range(2*a[i], max_a+1, a[i]):
flag[j] = False
ans... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
used = [0 for _ in range(int(1e6+1))]
ans = 0
for i in A:
if used[i] == 1:
used[i] += 1
continue
for j in range(i, len(used), i):
used[j] += 1
for a in A:
if used[a] == 1:
ans += 1
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
used = [0 for _ in range(int(1e6+1))]
ans = 0
for i in A:
if used[i] > 0:
used[i] += 1
continue
for j in range(i, len(used), i):
used[j] += 1
for a in A:
if used[a] == 1:
ans += 1
print(ans)
| p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
count_of_a = Counter(A)
# すでに出現した倍数の場合はアウト
ans = 0
max_A = max(A)
dp = [True] * (max_A+1)
happpend = set()
for a in A:
if count_of_a[a] >= 2:
# 複数出現するとしても，初めての要素の場合は処理を行う
if a in happpend... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
count_of_a = Counter(A)
# すでに出現した倍数の場合はアウト
ans = 0
max_A = max(A)
dp = [True] * (max_A+1)
happpend = set()
for a in A:
if count_of_a[a] >= 2:
# 複数出現するとしても，初めての要素の場合は処理を行う
if a in happpend... | p02642 |
from collections import Counter
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = Counter(A)
A.sort()
ans = 0
P = [0] * (10**6+1)
#print(cnt)
for a in A:
if P[a]==0 and cnt[a]==1:
ans += 1
for i in range(10**7):
x = a*i
if x>10**6:
... | from collections import Counter
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = Counter(A)
A.sort()
ans = 0
P = [0] * (10**6+1)
#print(cnt)
for a in A:
if P[a]==0:
for i in range(10**7):
x = a*i
if x>10**6:
break
... | p02642 |
import math
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = Counter(a)
a.sort()
cand = a
ans = 0
while cand:
p = cand[0]
if cnt[p] == 1:
ans += 1
nex = []
for num in cand:
if num == p:
continue
if ... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
am = a[-1]
memo = [0] * (am+1)
for ai in a:
memo[ai] = 1
p = -1
for ai in a:
if ai == p:
memo[ai] = 0
continue
for j in range(2, am // ai + 1):
memo[ai * j] = 0
p = ai
print((sum(memo))... | p02642 |
M = int(eval(input()))
A=list(map(int,input().split()))
A.sort()
ma=A[-1]
is_prime = [True] * (ma + 1)
for i in A:
if not is_prime[i]:
continue
for j in range(i * 2, ma + 1, i):
is_prime[j] = False
k=[i for i in range(ma + 1) if is_prime[i]]
A=[x for x in set(A) if A.count(x) == 1]
s... | M = int(eval(input()))
A=list(map(int,input().split()))
A.sort()
ma=A[-1]
is_prime = [True] * (ma + 1)
for i in A:
if not is_prime[i]:
continue
for j in range(i * 2, ma + 1, i):
is_prime[j] = False
k=[i for i in range(ma + 1) if is_prime[i]]
N=[]
if len(A)==1:
print((1))
else:
... | p02642 |
from collections import Counter
import math
N = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
is_prime = [True]*(10**6 + 1)
is_prime[0] = False
for i in set(a):
for j in range(2 * i, max(a)+1, i):
is_prime[j] = False
result = 0
c = Counter(a)
for e in set(a):
... | from collections import Counter
import math
N = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
is_prime = [True]*(10**6 + 1)
is_prime[0] = False
maxA = max(a)
for i in set(a):
for j in range(2 * i, maxA+1, i):
is_prime[j] = False
result = 0
c = Counter(a)
for e i... | p02642 |
from collections import Counter
def main():
n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
table = [True for i in range(max(a))]
res = 0
amax = max(a)
for i in a:
if (amax/2) + 1 < i:
break
if table[i-1] is False:
conti... | from collections import Counter
def main():
n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
table = [True for i in range(max(a))]
res = 0
amax = max(a)
for i in a:
if table[i-1] is False:
continue
for j in range(i*2, amax+1, i):
... | p02642 |
c=[0]*8**7
for a in[*open(i:=0)][1].split():c[int(a)]+=1
while i<1e6:
i+=1;j=i
while j<1e6:j+=i;c[j]*=c[i]<1
print((c.count(1))) | m=8**7
c=[0]*m
for a in[*open(0)][1].split():c[int(a)]+=1
i=r=0
while~i+m:
i+=1;r+=c[i]==1
if c[i]:c[::i]=[0]*-(-m//i)
print(r) | p02642 |
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
dp = [0] * (10 ** 6 + 10)
for x in A:
i = 0
while x + i <= 10 ** 6 + 10:
dp[(x-1) + i] += 1
i += x
cnt = 0
for x in A:
if dp[x-1] == 1:
cnt += 1
print(cnt) | n = int(eval(input()))
A = sorted(list(map(int, input().split())))
dp = [0] * (10 ** 6 + 10)
for x in A:
i = 0
while x + i <= 10 ** 6 + 10:
if dp[(x-1)] == 2:
break
else:
dp[(x-1) + i] += 1
i += x
cnt = 0
for x in A:
if dp[x-1] == 1:
... | p02642 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
c = [0] * (10**6+1)
for i in a:
c[i] += 1
uni = []
for i in a:
if c[i] == 1:
uni.append(i)
b = [0 for _ in range(10**6+1)]
for i in a:
for j in range(i*2, 10**6+1, i)... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
c = [0] * (10**6+1)
for i in a:
c[i] += 1
uni = []
a = list(set(a))
for i in a:
if c[i] == 1:
uni.append(i)
b = [0 for _ in range(10**6+1)]
for i in a:
for j in range(i*2, 10**6+1, i):
b[j] = 1
c... | p02642 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = max(a) + 10
li = [0]*m
for x in a:
li[x] += 1
ans = 0
for i in range(1,m):
if li[i]:
if li[i]==1:
ans += 1
for j in range(i,m,i):
li[j] = 0
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
m = max(a) + 1
li = [0]*m
for x in a:
li[x] += 1
ans = 0
for i in range(1,m):
if li[i]:
if li[i]==1:
ans += 1
for j in range(i,m,i):
li[j] = 0
print(ans) | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
D = [0] * (10**6 + 1)
A.sort()
for i in range(N):
D[A[i]] += 1
ans = 0
for i in range(1, 10**6+1):
if D[i]:
if D[i]==1:
ans += 1
for j in range(i,A[-1]+1,i):
D[j] = 0
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
m = max(A) + 1
cnt = [0]*m
for i in A:
cnt[i] += 1
ans = 0
for i in range(1,m):
if cnt[i]:
if cnt[i]==1:
ans += 1
for j in range(i,m,i):
cnt[j] = 0
print(ans) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
B = []
for i in range(N):
if A.count(A[i]) != 1:
continue
else:
p = 0
for j in B:
if A[i] % j == 0:
p = 1
if p == 0:
B.append(A[i])
print((len(B))) | N = int(eval(input()))
As = list(map(int,(input().split())))
As.sort()
# print(As)
all_nums = [0] * (As[-1] + 1)
for A in As:
all_nums[A] += 1
#print(all_nums)
dup = 0
for i, num in enumerate(all_nums):
if num == 0: #その数が一つもないなら無視
continue
if num > 1: #同じ数が複数ある場合はあとで除くためにカウント
... | p02642 |
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
uni = sorted(list(set(A)))
dup = [x for x in set(A) if A.count(x) > 1]
m = set()
ans = 0
for a in uni:
if a in m: continue
i = 0
a_max = uni[len(uni)-1]
while True:
... | def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
max_a = max(A)
m = set()
checked = set()
duplicated = set()
for a in A:
if a in checked:
duplicated.add(a)
continue
i = 2
while a*i <= max_a:
... | p02642 |
from collections import Counter
N=int(eval(input()))
A=list(map(int, input().split()))
S=Counter(A)
T=set(S)
# print(S)
# print(T)
# 篩？
ct=0
L=list(S.keys())
L.sort()
# print(L)
for i in range(len(L)):
a=L[i]
if a not in T:
continue
T.remove(a)
if S.get(a)==1:
ct+=1
... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
m = max(A)
sieve = [True]*(m+1)
sieve[0] = False
ct = 0
for i in range(N):
n = A[i]
if sieve[n] == False:
continue
if i < N-1 and n == A[i+1]:
sieve[n] = False
if sieve[n] == True:
ct += 1
for ... | p02642 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = [0]*(10**6 + 1)
for i in a:
if m[i] == 1:
m[i] = 2
continue
tmp = i
for j in range(i,10**6+1,i):
m[j]+=1
ans = 0
for i in a:
if m[i] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
ma = max(a)
m = [0]*(ma + 1)
for i in a:
if m[i] == 1:
m[i] = 2
continue
for j in range(i,ma+1,i):
m[j]+=1
ans = 0
for i in a:
if m[i] == 1:
ans += 1
print(ans) | p02642 |
N=int(eval(input()))
A=list(map(int, input().split()))
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
retu... | N= int(eval(input()))
a =list(map(int,input().split()))
a.sort()
ans=0
Amax=max(a)
DP=[1]*(Amax+1)#これが0のとき、該当する数はカウント済み
#上から順に攻めていく
for i in range(N-1):
p=a[i]
if DP[p]==1:#まだ数えられていなかったら
for j in range(Amax//p+1):#倍数をすべて0にする
DP[p*j]=0
if p!=a[i+1]:#隣の数と違うならば
... | p02642 |
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n = I()
a = LI()
a.sort()
f = [False]*n
if(n ... | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n = I()
a = LI()
a.sort()
m = a[n-1]
flg = [Fal... | p02642 |
N = int(eval(input()))
M = 10 ** 6
A = list(map(int, input().split()))
B = [0] * (M + 1)
for a in A:
B[a] +=1
C = [1] * (M + 1)
for i in A:
for j in range(i, M + 1, i):
if i == j:
if B[i] > 1:
C[i] = 0
else:
C[j] = 0
A = set(A)
ans = 0
for ... | N = int(eval(input()))
M = 10 ** 6
A = list(map(int, input().split()))
B = [0] * (M + 1)
for a in A:
B[a] +=1
C = [1] * (M + 1)
A = set(A)
for i in A:
for j in range(i, M + 1, i):
if i == j:
if B[i] > 1:
C[i] = 0
else:
C[j] = 0
ans = 0
for ... | p02642 |
n = int(eval(input()))
arr = list(map(int, input().split()))
arr = sorted(arr)
m = arr[-1]
tf = [True] * (m+1)
cnt = 0
for i in range(n):
ai = arr[i]
if tf[ai] == True:
cnt += 1
for j in range(ai, m+1, ai):
tf[j] = False
if ai in arr[i+1:]:
cnt -= 1
print(cnt) | n = int(eval(input()))
arr = list(map(int, input().split()))
arr = sorted(arr)
m = arr[-1]
li = [0]*(m+1)
cnt = 0
for i in arr:
for j in range(i, m+1, i):
li[j] += 1
for i in arr:
if li[i] == 1:
cnt += 1
print(cnt) | p02642 |
import sys
import time
def main():
N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
made = As[-1]
lis = [True for _ in range(made)]
for i in range(len(As)):
if As.count(As[i]) > 1:
lis[As[i]-1] = False
for i in As:
for j in ran... | #import time
def main():
N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
amax = max(As) + 1
lis = [True] * amax
ans = 0
for i in range(N-1):
if lis[As[i]]:
for j in range(As[i], amax, As[i]):
lis[j] = False
... | p02642 |
N = int(eval(input()))
A = sorted(list(map(int,input().split())))
B = (10**6+1)*[0]
for a in A:
B[a]+=1
if B[a]==1:
for n in range(2*a,10**6+1,a):
B[n]+=10
print((B.count(1))) | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
B = (10**6+1)*[0]
for a in A:
B[a]+=1
if B[a]==1:
for n in range(2*a,10**6+1,a):
B[n]+=2
print((B.count(1))) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
flag = 1
cnt = 0
for i in range(N):
if i + 1 > len(A):
break
flag = 1
for j in reversed(list(range(i + 1, len(A)))):
if A[j] == A[i]:
flag = -1
... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
l = [0] * (A[N - 1] + 1)
for i in A:
j = i
while j <= A[N - 1]:
l[j] += 1
j += i
cnt = 0
for k in A:
if l[k] == 1:
cnt += 1
print(cnt) | p02642 |
def divisor(n,A):
ass = []
for i in range(1,int(n**0.5)+1):
if n%i == 0:
if i in A:
return False
ass.append(i)
if i**2 == n:
continue
if n//i in A:
return False
return True
def main():
... | def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
... | p02642 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
maxA = max(A)
# C[a] = A内のaの個数
C = {a: 0 for a in A}
for a in A:
C[a] += 1
# D[a]=1: Aにaより小さいaの約数が存在する
D = {a: 0 for a in A}
for a in A:
if C[a] > 0:
t = 2
while a * t <= maxA:
D[a * t] = 1
t += 1
... | n = int(eval(input()))
A = list(map(int, input().split()))
maxA = max(A)
# C[a] = A内のaの個数
C = {a: 0 for a in A}
for a in A:
C[a] += 1
# D[a]=1: Aにaより小さいaの約数が存在する
D = {a: 0 for a in A}
for a in A:
if C[a] > 0:
t = 2
while a * t <= maxA:
D[a * t] = 1
t += 1
a... | p02642 |
_,*a=list(map(int,open(0).read().split()))
a=[i for i in a if a.count(i)==1]
a.sort()
b=0
while a:
b+=1
a=[i for i in a[1:] if i%a[0]!=0]
print(b) | N = int(eval(input()))
c = list(map(int,input().split()))
c.sort()
a = c[N-1]
list_c = [0]*(a+1)
for i in c:
mal = 2
b = i
while i<=a:
list_c[i]+=1
i = b*mal
mal+=1
count = 0
for i in c:
if list_c[i]==1:
count+=1
print(count)
| p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
# 小さい側から処理する。a[i]について、10**6 以下のすべての倍数をset()として持つ。
# ただし、set内に存在しない==初出の約数のみ倍数計算をしてカウントする。
# 例えば、2,6,... となった場合、(6の倍数セットは2の倍数セットの下位集合となるため計算不要)
s=set()
cnt=0
for i,aa in enumerate(a):
if aa not in s:
# 同値が複数ある場合、カウントしない。sortしているため、同値は並ぶ
... | # 30分ぐらい？で溶けた！計算量は直感だよりだったが。
# → エラトステネスの篩 に相当する実装らしい。
# リスト内の倍数・約数関係を判定し、カウントする。
# 二重ループで判定するとTLEになるため、小さい値の可能な倍数を計算して保存するようにした。
# メモを set() ではなく 配列 で実装するテスト
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
# 小さい側から処理する。a[i]について、10**6 以下のすべての倍数をset()として持つ。
# ただし、set内に存在しない==初出の約数のみ倍数計算をしてカ... | p02642 |
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A_set = set(A)
A_dict = Counter(A)
for key, count in list(A_dict.items()):
if count > 1:
A_set.discard(key)
k = key * 2
while k <= max(A):
... |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
m = max(A) + 1
dp = [0] * m
for a in sorted(A):
if dp[a] != 0:
dp[a] = 2
continue
for i in range(a, m, a):
dp[i] += 1
print((sum(dp[i] == 1 for i in A)))
... | p02642 |
from collections import Counter
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
s = sorted(set(a))
c = Counter(a)
t = [0] * (10**6 + 1)
for i in a:
for j in range(i, 10**6+1, i):
t[j] += 1
ans = sum(1 for i in a if t[i] == 1 and c[i] == 1)
print(ans)
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
s = set(a)
c = Counter(a)
t = [0] * (10**6 + 1)
for i in s:
for j in range(i, 10**6+1, i):
t[j] += 1
ans = len([1 for i in s if t[i] == 1 and c[i] == 1])
print(ans)
| p02642 |
N = int(eval(input()))
A = [int(n) for n in input().split()]
ans = 0
for i in range(N):
for j in range(N):
if A[i] % A[j] == 0 and i != j:
break
if j == N-1:
ans += 1
print(ans) | N = int(eval(input()))
A = [int(n) for n in input().split()]
maxA = max(A)
C = {a:0 for a in A}
D = {a:0 for a in A}
for a in A:
C[a] += 1
for a in A:
if C[a] > 0:
t = 2
while a*t <= maxA:
D[a*t] = 1
t += 1
ans = 0
for a in A:
if C[a] == 1 and D[a] ==... | p02642 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
for i in range(n):
is_divisible = False
for j in range(n):
divisible_num = []
if a[i] % a[j] == 0 and i != j:
divisible_num.append(a[j])
is_divisible = True
i... | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
# 探索範囲は数列aの最大値まで
max_a = a[-1]
b = [0] * (max_a + 1)
ans = set()
for i in a:
if b[i] == 1:
if i in ans:
ans.remove(i)
continue
# 探索範囲内のiの倍数をチェック
for j in range(i, max_a+1, i)... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
F = [0 for i in range(A[-1]+1)]
for i in A:
F[i] = 1
c_set = set()
for i in A:
if F[i] == 0:
continue
c_set.add(i)
for j in range(i, A[-1]+1, i):
F[j] = 0
ans = len(c_set)
d = 0
for i in c_set:
if A.count(i) > 1:... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
F = [0 for i in range(A[-1]+1)]
for i in A:
F[i] = 1
c_set = set()
for i in A:
if F[i] == 0:
continue
c_set.add(i)
for j in range(i, A[-1]+1, i):
F[j] = 0
ans = len(c_set)
d = 0
d_set = set()
for i in range(N):
... | p02642 |
from itertools import chain
from collections import Counter
def factors(n):
yield from chain.from_iterable(({i, n//i} for i in range(1, int(n ** 0.5) + 1) if n % i == 0))
def get_non_divisible():
n, *lst = list(map(int, open(0).read().split()))
c = Counter(lst)
d = {val: sum((-c.get(f, 0) for... | from collections import defaultdict, Counter
def main():
n, *A = list(map(int, open(0).read().split()))
A.sort()
n = A[-1]
isPrime = [True] * (n + 1)
prep = 0
for i in A:
if prep == i:
isPrime[prep] = False
continue
if isPrime[i]:
for j in range(i * 2, n + 1, i):
... | p02642 |
def main():
n, *A = list(map(int, open(0).read().split()))
A.sort()
n = A[-1]
isPrime = [True] * (n + 1)
prep = 0
for i in A:
if prep == i:
isPrime[prep] = False
continue
if isPrime[i]:
for j in range(i * 2, n + 1, i):
... | def main():
n, *A = list(map(int, open(0).read().split()))
A.sort()
m = A[-1]
lst = [0] * (m + 1)
prep = 0
for i in A:
if i == prep:
lst[i] = 1
continue
lst[2 * i::i] = [1] * len(lst[2 * i::i])
prep = i
res = 0
for i in A:
if lst[i] == 0:
res += 1
prin... | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
b = [True] * n
c = Counter(a)
for i in range(n):
if b[i]:
for j in range(i+1, n):
if a[j] % a[i] == 0 and i != j:
b[j] = False
ans = 0
for i in range(n):
if b[i] a... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
dp = [0] * a[-1]
c = Counter(a)
for i in a:
for j in range(i, a[-1]+1, i):
dp[j-1] += 1
ans = 0
for i in a:
if dp[i-1] == 1 and c[i]:
ans += 1
print(ans) | p02642 |
# review
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
OK = [True for i in range(10**6+1)]
CNT = [0 for i in range(10**6+1)]
for x in A:
CNT[x] += 1
for i in range(2, 10**6+1):
if i*x > 10**6:
b... | # review
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
OK = [True for i in range(10**6+1)]
CNT = [0 for i in range(10**6+1)]
for x in A:
CNT[x] += 1
if CNT[x] == 1:
for i in range(2, 10**6+1):
i... | p02642 |
N = 5
ARR = [24, 11, 8, 3, 16]
N = 4
ARR = [5, 5, 5, 5]
N = 10
ARR = [33, 18, 45, 28, 8, 19, 89, 86, 2, 4]
N = int(eval(input()))
ARR = list(map(int,input().split()))
def calculate(n, arr):
prr = [0 for i in range(2000005)]
for i in range(n):
start = arr[i]
#
... | N = 5
ARR = [24, 11, 8, 3, 16]
N = 4
ARR = [5, 5, 5, 5]
N = 10
ARR = [33, 18, 45, 28, 8, 19, 89, 86, 2, 4]
N = int(eval(input()))
ARR = list(map(int,input().split()))
def calculate(n, arr):
prr = [0 for i in range(2000005)]
for i in range(n):
start = arr[i]
#
... | p02642 |
N = 5
ARR = [24, 11, 8, 3, 16]
N = 4
ARR = [5, 5, 5, 5]
N = 10
ARR = [33, 18, 45, 28, 8, 19, 89, 86, 2, 4]
N = int(eval(input()))
ARR = list(map(int,input().split()))
def calculate(n, arr):
prr = [0 for i in range(2000005)]
for i in range(n):
start = arr[i]
#
... | N = 5
ARR = [24, 11, 8, 3, 16]
N = 4
ARR = [5, 5, 5, 5]
N = 10
ARR = [33, 18, 45, 28, 8, 19, 89, 86, 2, 4]
N = int(eval(input()))
ARR = list(map(int,input().split()))
def calculate(n, arr):
krr = [0 for i in range(1, 1000007)]
for i in range(n):
start = arr[i]
if krr[star... | p02642 |
n = int(eval(input()))
A = sorted(map(int, input().split()))
U = 10**6
line = [1]*(U+1)
ans = set()
depricated = set()
cnt = [0]*(U+1)
for a in A:
cnt[a] += 1
if cnt[a] == 2 and line[a]:
depricated.add(a)
if line[a]:
ans.add(a)
for p in range(2*a, U+1, a):
... | n = int(eval(input()))
A = sorted(map(int, input().split()))
U = A[-1]
line = [1]*(U+1)
ans = set()
depricated = set()
cnt = [0]*(U+1)
for a in A:
cnt[a] += 1
if cnt[a] == 2 and line[a]:
depricated.add(a)
if line[a]:
ans.add(a)
for p in range(2*a, U+1, a):
... | p02642 |
n = int(eval(input()))
A = sorted(map(int, input().split()))
U = 10**6
line = [1]*(U+1)
ans = set()
depricated = set()
cnt = [0]*(U+1)
for a in A:
cnt[a] += 1
if cnt[a] == 2 and line[a]:
depricated.add(a)
continue
if 2 < cnt[a]:
continue
if line[a]:
ans.a... | n = int(eval(input()))
A = sorted(map(int, input().split()))
U = A[-1]
line = [1]*(U+1)
ans = set()
depricated = set()
cnt = [0]*(U+1)
for a in A:
if a in ans:
depricated.add(a)
continue
if line[a]:
ans.add(a)
for p in range(2*a, U+1, a):
line[p] = 0
pr... | p02642 |
def main():
N = int(eval(input()))
AList = list(map(int, input().split()))
answer = 0
for i in range(N):
for j in range(N):
if((i != j) and AList[i] % AList[j] == 0):
break
else:
answer = answer + 1
print(answer)
if _... | def main():
N = int(eval(input()))
AList = list(map(int, input().split()))
AList.sort()
AMax = AList[-1] + 1
dp = [True] * AMax
answer = 0
ACheckSet = set()
ACheckSetCheckSet = set()
for A in AList:
if dp[A]:
answer = answer + 1
ACh... | p02642 |
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
ans = [1]*n
for i in range(n):
if ans[i] == 1:
for j in range(i+1, n):
if a[j] == a[i]:
ans[i] = 0
if a[j]%a[i] ==0:
... | def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
a1 = {}
for i in range(len(a)):
if a[i] in a1:
a1[a[i]] += 1
else:
a1[a[i]] = 1
a = sorted(list(a1.keys()))
ans = [1] * a[-1]
for i in a:
if ans[i-1] == 1:
... | p02642 |
from sys import stdin
data = stdin.readlines()
x = int(data[0].split()[0])
a = [int(s) for s in data[1].split()]
a = sorted(a, reverse = True)
counter = 0
for i in range(len(a)):
for j in range(len(a)):
if i != j and a[i] % a[j] == 0:
break
else:
counter += 1
print(co... | from sys import stdin
data = stdin.readlines()
n = int(data[0].split()[0])
a = [int(s) for s in data[1].split()]
a = sorted(a)
max = a[-1]
l = [0]*(max+1)
for i in a:
l[i] += 1
if l[i] == 1:
for j in range(i*2,max+1,i):
l[j] = 2
print((l.count(1))) | p02642 |
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
arr = [0]*(max(a)+1)
for i in a:
arr[i]+=1
tmp = i
if arr[i]<=1:
while (tmp+i)<=max(a):
tmp += i
if arr[tmp] !=0:
arr[tmp] =2
else:
arr[tmp] +=1
cnt = 0
for i in a:
if arr[i] ==... | n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)
alist=[0]*(m+1)
for i in a:
for j in range(i,m+1,i):
alist[j]+=1
cnt=0
for i in a:
if alist[i]==1:
cnt+=1
print(cnt)
| p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)
alist=[0]*(m+1)
for i in a:
for j in range(i,m+1,i):
alist[j]+=1
cnt=0
for i in a:
if alist[i]==1:
cnt+=1
print(cnt)
| n = int(eval(input()))
a = list(map(int,input().split()))
m =max(a)
arr = [0]*(m+1)
for i in a:
for j in range(i,m+1,i):
arr[j]+=1
cnt = 0
for i in a:
if arr[i] ==1:
cnt += 1
print(cnt) | p02642 |
import math
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
valid = [True] * len(A)
sqrt = A[len(A)-1] // 2
stop = -1
for i in range(len(A)):
if A[i] > sqrt:
stop = i
break
if valid[i] == False:
continue
for j in range(i+1, len(A)):
if... | import math
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
maxA = A[len(A)-1]
valid = [True] * maxA
for i in range(len(A)):
if valid[A[i]-1] == False:
continue
if i != 0 and A[i-1] == A[i]:
valid[A[i]-1] = False
else:
for j in range(A[i]*2, m... | p02642 |
if __name__ == "__main__":
n = int(eval(input()))
l_a = list(map(int, input().split()))
s_a = list(set(l_a))
s_a.sort()
dub_a = [0]*(max(s_a)+1)
for i in l_a:
dub_a[i] += 1
dp = [1]*(max(s_a)+1)
for i in s_a:
if 2*i > len(dp)-1:
pass
... | if __name__ == "__main__":
n = int(eval(input()))
l_a = list(map(int, input().split()))
s_a = list(set(l_a))
s_a.sort()
dub_a = [0]*(max(s_a)+1)
for i in l_a:
dub_a[i] += 1
dp = [1]*(max(s_a)+1)
for i in s_a:
if dp[i] == 0:
pass
e... | p02642 |
import collections
N = int(eval(input()))
A = list(map(int,input().split()))
counter = collections.Counter(A)
B = list(set(A))
count = 0
for i in range(len(B)):
if counter[B[i]]>1:
continue
if B[i]==1:
count += 1
continue
else:
check = 0
for j in range(1... | import collections
N = int(eval(input()))
A = list(map(int,input().split()))
S = set()
D = set()
for a in A:
if a in S:
D.add(a)
else:
S.add(a)
M = max(S)
A = [0]*(M+1)
for s in S:
if s in D:
A[s] += 1
for i in range(2*s,M+1,s):
A[i]+=1
count = 0
for s i... | p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(a)
p=[0]*(10**6+1)
for i in range(n):
if p[a[i]]==0:
j=2
while a[i]*j<=10**6:
p[a[i]*j]=1
j+=1
a.append(-1)
a.insert(0,-1)
ans=0
for i in range(1,n+1):
if a[i]!=a[i+1] and a[i]!=a[i-1] and p[a[i]... | n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(a)
b=list(set(a))
m=len(b)
p=[0]*(10**6+1)
for i in b:
if p[i]==0:
j=2
while i*j<=10**6:
p[i*j]=1
j+=1
a.append(-1)
a.insert(0,-1)
ans=0
for i in range(1,n+1):
if a[i]!=a[i+1] and a[i]!=a[i-1... | p02642 |
import sys
input=sys.stdin.readline #文字列入力はするな！！
n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*(10**6+1)
ans=0
for i in a:
z[i]+=1
for i in a:
j=2
f=0
if z[i]>=2:
f=1
if z[1]>=2:
f=1
if i!=1 and z[1]==1:
f=1
while j*j<=i:
if i... | import sys
input=sys.stdin.readline #文字列入力はするな！！
n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*(10**6+1)
ans=0
for i in a:
z[i]+=1
for i in a:
if i%2==0:
j=2
else:
j=3
f=0
if z[i]>=2:
f=1
if z[1]>=2:
f=1
if i!=1 and z[1]==1:
... | p02642 |
import sys
input=sys.stdin.readline #文字列入力はするな！！
sys.setrecursionlimit(10**9) #再帰の上限をあげる
n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*(10**6+1)
ans=0
for i in a:
z[i]+=1
x=[-1]*(10**6+1) #2以上の自然数に対して最小の素因数を表す
x[0]=0
x[1]=1
i=2
prime=[]
while i<=10**6:
if x[i]==-1:
x[i]=i... | import sys
input=sys.stdin.readline #文字列入力はするな！！
sys.setrecursionlimit(10**9) #再帰の上限をあげる
n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*(10**6+1)
ans=0
for i in a:
z[i]+=1
x=[-1]*(10**6+1) #2以上の自然数に対して最小の素因数を表す
x[0]=0
x[1]=1
i=2
prime=[]
while i<=10**6:
if x[i]==-1:
x[i]=i... | p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=0
for a in range(N):
newA = [A[a]%n for n in A]
newA.pop(a)
if 0 in newA:
ans = ans
else:
ans += 1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
Amax = A[-1]
dp = [1]*(Amax+1)
ans = 0
for i in range(len(A)-1):
p = A[i]
if dp[p] == 1:
for q in range(Amax//p+1):
dp[p*q] = 0
if A[i] != A[i+1]:
ans += 1
if dp[Amax] == 1:
ans += 1
print(ans) | p02642 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
temp = 0
if N == 1:
return 1
if A[0] == 1 and A[1] != 1:
return 1
elif A[0] == 1 and A[1] == 1:
return 0
for i in range(N):
if i == 0 and A[i+1] ... | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
dict = {}
for i in range(1,A[N-1]+1):
dict[i] = 0
if N == 1:
return 1
if A[0] == 1 and A[1] != 1:
return 1
elif A[0] == 1 and A[1] == 1:
return 0
temp =... | p02642 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
d = dict()
for x in A:
if x in d:
d[x] += 1
else:
d[x] = 1
A.sort()
ans = 0
dp = [True]*N
for i in ran... |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
d = dict()
for x in A:
if x in d:
d[x] += 1
else:
d[x] = 1
A.sort()
ans = 0
M = max(A)
dp = [True]*(M+1)... | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
cola = Counter(a)
mult = [True] * (10**6+1)
seta = list(set(a))
for s in seta:
tmp = s * 2
while tmp <= 10 ** 6:
mult[tmp] = False
tmp += s
ans = 0
for s in seta:
if cola[s] == 1 and m... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
m = [True] * (10**6+1)
s = list(set(a))
for u in s:
t = u * 2
while t <= 10 ** 6:
m[t] = False
t += u
r = 0
for u in s:
if c[u] == 1 and m[u] == True:
r += 1
print... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ls = [1]*(10**6+1)
cnt = [0]*(10**6+1)
for i in range(n):
cnt[a[i]] += 1
if ls[a[i]] == 1:
for j in range(a[i]*2, 10**6+1, a[i]):
ls[j] = 0
ans = 0
for i in range(n):
if ls[a[i]] == 1 and cnt[a[i]] == 1:
... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ls = [1] * (10 ** 6 + 1)
cnt = [0] * (10 ** 6 + 1)
for i in range(n):
cnt[a[i]] += 1
if cnt[a[i]] == 1:
if ls[a[i]] == 1:
for j in range(a[i] * 2, 10 ** 6 + 1, a[i]):
ls[j] = 0
ans = 0
for i in ra... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
v = [True] * 1000010
v2 = [False] * 1000010
for i in range(n):
j = 2
while a[i]*j < 1000010:
v[a[i]*j] = False
j += 1
if v2[a[i]]:
v[a[i]] = False
v2[a[i]] = True
ans = 0
for i in range(n):
... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
M = 1000005
cnt = [0] * M
for i in range(n):
if cnt[a[i]] != 0:
cnt[a[i]] = 2
continue
for j in range(a[i], M, a[i]):
cnt[j] += 1
ans = 0
for i in range(n):
if cnt[a[i]] == 1:
ans += 1... | p02642 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
x = max(a)
dp = [0] * (x+1)
for ai in a:
i = 1
if dp[ai] <= 2:
while i * ai <= x:
dp[i * ai] += 1
i += 1
ans = 0
for ai in a:
if dp[ai] <= 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
x = max(a)
dp = [0] * (x+1)
for ai in a:
i = 1
if dp[ai] <= 2:
while i * ai <= x:
dp[i * ai] += 1
i += 1
ans = 0
for ai in a:
if dp[ai] <= 1:
ans += 1
print(ans) | p02642 |
import sys
input = lambda: sys.stdin.readline().rstrip()
div = [0] * 1000005
N = int(eval(input()))
A = list(map(int, input().split()))
for num in A:
if div[num] == 0:
for i in range(num, 1000004, num):
div[i] += 1
elif div[num] != 0:
div[num] += 1
ans = ... | import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
div = [0] * 1000005
A = list(map(int, input().split()))
for num in A:
if div[num] == 0:
for i in range(num, 1000005, num):
div[i] += 1
else:
div[num] += 1
ans = 0
for num in A:
if d... | p02642 |
M = 10 ** 6 + 5
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = [0] * M
ans = 0
for i in A:
for j in range(0, M, i):
cnt[j] += 1
for i in A:
if(cnt[i] == 1):
ans += 1
print(ans) | M = 10 ** 6 + 5
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = [0] * M
for i in A:
if(cnt[i] >= 2):
continue
for j in range(i, M, i):
cnt[j] += 1
ans = 0
for i in A:
if(cnt[i] == 1):
ans += 1
print(ans) | p02642 |
n=int(eval(input()))
a=[int(x) for x in input().split()]
a.sort()
max=a[-1]
dp=[False for _ in range(max+1)]
for i in a:
if dp[i]==False:
j=1
while 1:
j+=1
if i*j>max:
break
dp[i*j]=True
for i in a:
if a.count(i)>1:
dp[... | n=int(eval(input()))
a=[int(x) for x in input().split()]
a.sort()
max=a[-1]
dp=[False for _ in range(max+1)]
for i in a:
if dp[i]==False:
j=1
while 1:
j+=1
if i*j>max:
break
dp[i*j]=True
for i in range(len(a)-1):
if a[i]==a[i+1]... | p02642 |
import sys
def solve(a,n):
m = a[-1]+1
ava = [0]*m
for rep in a:
ava[rep] += 1
if ava[rep]:
for i in range(2*rep,m,rep):
ava[i] += 2
return ava.count(1)
if __name__=='__main__':
n = int(sys.stdin.readline().rstrip())
a = list(map(int,s... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return list(map(int,sys.stdin.readline().rstrip().split()))
def solve():
m = a[-1]+1
ava = [0]*m
for rep in a:
ava[rep] += 1
if ava[rep]==1:
for item in range(2*rep,m,rep):
ava[ite... | p02642 |
from math import sqrt
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
#print(A)
ans = []
res = []
nans = 0
doubling = 0
i = 0
while i < N:
a = A[i]
#sqa = sqrt(a)
#print(i,a)
if i == 0:
flag = False
while i + 1 < N:
bufa = A[i+1]
if bufa == a:
... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
maxA = A[-1]
dp = [-1 for i in range(maxA+1)]
for a in A:
if dp[a] != 0:
if dp[a] == 1:
dp[a] = 0
continue
dp[a] = 1
for i in range(2*a, maxA+1, a):
dp[i] = 0
ans = 0
for a in A:
if dp[a] == 1:
an... | p02642 |
#
import sys
input=sys.stdin.readline
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
SUGOI=[False]*(10**6+1)
for a in A:
for j in range(2*a,10**6+1,a):
SUGOI[j]=True
cnt=0
for a in A:
if A.count(a)==1 and SUGOI[a]==False:
... | #
import sys
input=sys.stdin.readline
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
cho=set()
for i in range(len(A)-1):
if A[i]==A[i+1]:
cho.add(A[i])
A=list(set(A))
SUGOI=[False]*(10**6+1)
for a in A:
for j in ra... | p02642 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
c = [False]*N
ans = 0
for i in range(N):
if c[i]:
continue
if i == N-1 or A[i] != A[i+1]:
ans += 1
if i == N-1:
break
for j in range(i+1,N):
if not c[j] and A[j]%A[i]==0:
c[j] ... | N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
B = [True]*(A[-1]+1)
i = 0
for i in range(N):
if i < N-1 and A[i] == A[i+1]:
B[A[i]] = False
if A[-1] < 2*A[i]:
continue
M = A[-1]//A[i]+1
for j in range(2,M):
B[j*A[i]] = False
ans = 0
for a in A:
if B[a]:
... | p02642 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | p02642 |
import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
*A, = list(map(int, input().split()))
w = [0] * (10 ** 6 + 1)
for a in A:
w[a] += 1
for a in A:
for b in range(a * 2, 10 ** 6 + 1, a):
w[b] = 0
if w[a] >= 2:
w[a] ... | import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
*A, = list(map(int, input().split()))
w = [0] * (10 ** 6 + 1)
for a in A:
w[a] += 1
f = [False] * (10 ** 6 + 1)
for a in A:
if f[a]:
w[a] = 0
continue
for b i... | p02642 |
import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
*A, = list(map(int, input().split()))
w = [0] * (10 ** 6 + 1)
for a in A:
w[a] += 1
f = [False] * (10 ** 6 + 1)
for a in A:
if f[a]:
w[a] = 0
continue
for b i... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
C = [0] * (10**6 + 1)
for a in A:
if C[a] == 1:
C[a] = -1
continue
if C[a] == -1:
continue
C[a] = 1
for b in range(a + a, 10 ** 6 + 1, a):
C[b] = ... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ok = [False] * N
for i in range(N):
for j in range(i+1, N):
if ok[j]:
continue
if A[i] == A[j]:
ok[i] = True
ok[j] = True
if A[j] % A[i] == 0:
ok[j] = True
... | N = int(eval(input()))
A = list(map(int, input().split()))
amax = max(A)
sieve = [False] * (amax+1)
exist = [0] * (amax+1)
for a in A:
if exist[a] > 0:
exist[a] += 1
continue
exist[a] += 1
for i in range(a*2, amax+1, a):
sieve[i] = True
ans = 0
for a in A:
if ... | p02642 |
from collections import Counter
N=int(eval(input()))
A=list(map(int,input().split()))
nmax=10**6
iscop=[True]*(nmax+1)
cnt=[0]*(nmax+1)
for a in A:
cnt[a]+=1
if iscop[a]==False:
continue
for j in range(2,nmax//a+1):
iscop[j*a]=False
ans=0
for a in A:
if cnt[a]<2 and i... | from collections import Counter
N=int(eval(input()))
A=Counter(list(map(int,input().split())))
nmax=10**6
iscop=[True]*(nmax+1)
for k in list(A.keys()):
if iscop[k]==False:
continue
for j in range(2,nmax//k+1):
iscop[k*j]=False
ans=0
for k,v in list(A.items()):
if v<2 and i... | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
check = [1] * n
cnt = Counter(a)
for i in range(n - 1):
if check[i] == 0:continue
if cnt[a[i]] > 1:check[i] = 0
for j in range(i + 1, n):
if a[j] % a[i] == 0:check[j] = 0
ans = sum(chec... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
check = [True] * (a[-1] + 1)
cnt = Counter(a)
for i in range(n):
if check[a[i]] == False:continue
for j in range(a[i], a[-1] + 1, a[i]):
if j == a[i]:continue
check[j] = False
ans =... | p02642 |
from sys import stdin
import math
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
a.sort()
ans = 0
seen = set()
for i in range(n):
for j in range(1,math.floor(math.sqrt(a[i]))+1):
if a[i]%j == 0:
x,y = j,a[i]//j
if x in seen or y in seen:
... | from sys import stdin
import math
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
a.sort()
ans = 0
maxval = a[-1]
seen = set()
for i in range(n):
if a[i] not in seen and (i == n-1 or a[i] != a[i+1]):
ans += 1
j = a[i]
while j <= maxval:
seen.add(j)
... | p02642 |
from sys import stdin
import math
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
a.sort()
ans = 0
numset = set(a)
maxval = 10**6
dp = [0]*(maxval+1)
for i in range(n):
if dp[a[i]] == 0 and (i == n-1 or a[i] != a[i+1]):
ans += 1
j = a[i]
while j <= maxval:
... | from sys import stdin
import math
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
a.sort()
ans = 0
numset = set(a)
maxval = 10**6
dp = [0]*(maxval+1)
for i in range(n):
if dp[a[i]] >= 1: continue
if dp[a[i]] == 0 and (i == n-1 or a[i] != a[i+1]):
ans += 1
j = a[i]
... | p02642 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
n = 0
for i in range(N):
d = True
for j in range(N):
if a[i] < a[j]:
break
elif i != j and a[i] % a[j] == 0:
d = False
break
if d:
n += 1
print(n) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
A = max(a)
b = [0]*A
for i in range(N):
if b[a[i]-1] == 0:
for j in range(a[i], A+1, a[i]):
b[j-1] += 1
elif b[a[i]-1] == 1:
b[a[i]-1] += 1
n = 0
for i in range(N):
if b[a[i]-1] == 1:
n += 1
print(n) | p02642 |
import collections
n = int(input())
ais = list(map(int,input().split()))
cc = collections.Counter(ais)
s = {ai:True for ai in ais}
m = max(ais)
for a in cc:
c = a if cc[a] > 1 else 2 * a
while(c <= m):
if a in s: s[c] = False
c+= a
count = 0
for ai in s:
if s[ai]:
count +=1
print(count) | import collections
n,cc = int(input()), collections.Counter(list(map(int,input().split())))
m,s = max(cc.keys()),{ai:True for ai in cc}
for a in cc:
c = a if cc[a] > 1 else 2 * a
while(c <= m):
if a in s: s[c] = False
c += a
count = 0
for a in s:
if s[a]: count +=1
print(count) | p02642 |
import collections
n,cc = int(input()), collections.Counter(list(map(int,input().split())))
m,s = max(cc.keys()),{ai:True for ai in cc}
for a in cc:
c = a if cc[a] > 1 else 2 * a
while(c <= m):
if a in s: s[c] = False
c += a
count = 0
for a in s:
if s[a]: count +=1
print(count) | import collections
n,cc = int(input()), collections.Counter(list(map(int,input().split())))
m,s = max(cc.keys()),{ai:True for ai in cc}
for a in cc:
c = a if cc[a] > 1 else 2 * a
while(c <= m):
if a in s: s[c] = False
c += a
count = 0
for v in list(s.values()):
if v: count +=1
print(count) | p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
L=sorted(A)
l=[]
for i in L:
if L.count(i)==1:
l.append(i)
for i in l:
for j in l[l.index(i)+1:]:
if j%i==0:
l.pop(l.index(j))
else:
None
print((len(l)))
... | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
Amax=A[-1]
dp=[True]*(Amax+1)
ans=0
for i in range(N-1):
p=A[i]
if dp[p]:
for j in range(1,Amax//p+1):
dp[p*j]=False
if p!=A[i+1]:
ans+=1
if dp[Amax]:
ans+=1
print(ans)
... | p02642 |
from collections import Counter
n = int(eval(input()))
a = [int(x) for x in input().split()]
cnt = [0] * (10**6 + 1)
dic = Counter(a)
for i in set(a):
if 1 < dic[i]:
cnt[i] += 1
a = list(set(a))
for i in a:
for j in range(10**6 + 1):
if 10**6 < i * j:
br... | from collections import Counter
n = int(eval(input()))
a = [int(x) for x in input().split()]
cnt = [0] * (10**6 + 1)
dic = Counter(a)
for i in set(a):
if 1 < dic[i]:
cnt[i] += 1
a = list(set(a))
a_max = max(a)
for i in a:
for j in range(1, 10**6 + 1):
if a_max < i * j... | p02642 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10 ** 6)
# Made for abc097D
class UnionFind:
def __init__(self, size):
self.size = size
self.parents = [i for i in range(size)]
self.ranks = [0 for i in range(size)]
def ancestor(self, i):
if sel... | #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10 ** 6)
def debug(s):
if True:
print(s)
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while False:
p = data[0]
if limit <= p:
... | p02642 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,*a = list(map(int,read().split()))
res = [0]*(1000001)
for i in a: res[i] += 1
def check(N,P):
if N == 1:
if P[1]==1: return True
else: return False
res = []
for i in range... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,*a = list(map(int,read().split()))
P = [0]*(1000001)
for i in a: P[i] += 1
def check(N,P):
if N == 1:
if P[1]==1: return True
else: return False
if P[1] >= 1: return False
... | p02642 |
#!/usr/bin/env python3
import sys
import collections
input = sys.stdin.readline
def ST():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
N = I()
A = LI()
A.sort()
cnt = collectio... | #!/usr/bin/env python3
import sys
import collections
input = sys.stdin.readline
def ST():
return input().rstrip()
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
N = I()
A = LI()
A.sort()
cnt = collectio... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
ok = [0]*(max(a)+1)
a.sort()
for i in range(n):
ok[a[i]] += 1
if ok[a[i]] == 1:
for g in range(2*a[i], max(a)+1, a[i]):
ok[g] += 2
print((ok.count(1)))
| n = int(eval(input()))
a = list(map(int, input().split()))
M = max(a)
ok = [0]*(M+1)
a.sort()
for i in range(n):
ok[a[i]] += 1
if ok[a[i]] == 1:
for g in range(a[i], M+1, a[i]):
if g != a[i]:
ok[g] += 2
print((ok.count(1)))
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
M = max(a)
ok = [0]*(M+1)
a.sort()
for i in range(n):
ok[a[i]] += 1
if ok[a[i]] == 1:
for g in range(a[i], M+1, a[i]):
if g != a[i]:
ok[g] += 2
print((ok.count(1))) | n = int(eval(input()))
a = list(map(int, input().split()))
M = max(a)
ok = [0]*(M+1)
a.sort()
for i in range(n):
ok[a[i]] += 1
for i in range(n):
if ok[a[i]] != 0:
for g in range(a[i], M+1, a[i]):
if g != a[i]:
ok[g] = 0
print((ok.count(1))) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
M = max(a)
ok = [0]*(M+1)
a.sort()
for i in range(n):
ok[a[i]] += 1
for i in range(n):
if ok[a[i]] != 0:
for g in range(a[i], M+1, a[i]):
if g != a[i]:
ok[g] = 0
print((ok.count(1))) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
MAX = a[-1]
l = [0]*(MAX+1)
for i in range(n):
l[a[i]] += 1
ans = 0
for i in range(n):
if l[a[i]] == 1:
ans += 1
for g in range(a[i], MAX+1, a[i]):
l[g] = 10
print(ans)
| p02642 |
def main():
n=int(eval(input()))
a=sorted(map(int,input().split()))
tf=[1]*n
n=n-1
#r=[]
#print(n)
#print(a)
#notdiv=True
#firstyn=0
for i in range(n,-1,-1):
#print(i)
#notdiv=True
if tf[i] ==0:
continue
for j in range(i):
#print(a[j])
if a[i]%a[j] == 0:
... | def main():
n=int(eval(input()))
a=sorted(map(int,input().split()))
maxa=a[-1]+1
tf=[False]*maxa
r=0
n-=1
for i in range(n):
a_i=a[i]
if tf[a_i] ==False:
for j in range(a_i,maxa,a_i):
tf[j]=True
if a_i < a[i+1]:
#print(a_i)
r+=1
if tf[-1] ==Fals... | p02642 |
N = int(eval(input()))
A_array = list(map(int, input().split()))
ans = 0
check = [0 for _ in range(10 ** 6 + 5)]
A = A_array
for i in range(N):
for j in range(int((len(check) - 1) / A[i])):
check[A[i] * (j + 1)] += 1
for i in range(len(check) - 1):
if i + 1 in A:
if check[i + 1] == 1:
a... | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort() #エラトステネスの篩にかけるためソート
Amax = A[-1]
dp = [1]*(Amax+1) #Aの最大値までのエラトステネスの篩を作る。
ans = 0
for i in range(len(A)-1):
p = A[i]
if dp[p] == 1: #A[i]がA[j]の倍数でないかをエラトステネスの篩でチェック
for q in range(Amax//p+1):
dp... | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
ma = max(A)
Er = [0 for _ in range(ma + 5)]
is_c = [0 for _ in range(ma + 5)]
for i in range(N):
temp = A[i]
if Er[temp] != 2:
a = 0
while(1):
a += 1
tt = a * temp
if tt >= ma + 5:
... | N = int(eval(input()))
A = list(map(int,input().split()))
ma = max(A)
Er = [0 for _ in range(ma + 5)]
for i in range(N):
temp = A[i]
if Er[temp] != 2:
a = 0
while(1):
a += 1
tt = a * temp
if tt >= ma + 5:
break
Er[t... | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
ma = max(A)
Er = [0 for _ in range(ma + 5)]
for i in range(N):
temp = A[i]
if Er[temp] != 2:
a = 0
while(1):
a += 1
tt = a * temp
if tt >= ma + 5:
break
Er[t... | N = int(eval(input()))
A = list(map(int,input().split()))
ma = max(A)
l = [0 for _ in range(ma + 10)]
for i in range(N):
temp = A[i]
while(temp <= ma + 5):
l[temp] += 1
temp += A[i]
ans = 0
for i in range(N):
if l[A[i]] == 1: ans += 1
print(ans) | p02642 |
N = int(eval(input()))
nums = [i for i in map(int, input().split(" "))]
target_count = 0
for index in range(N):
target = nums[index]
divisible_count = 0
for num in nums:
residue = target % num
if residue ==0:
divisible_count +=1
if divisible_count>=2:
... | N = int(eval(input()))
nums = [i for i in map(int, input().split())]
nums = sorted(nums)
max = nums[-1]
dp = [1]*(max+1)
ans = 0
for i in range(len(nums)-1):
p = nums[i]
if dp[p] ==1:
for q in range(max//p+1):
dp[p*q]=0
if nums[i] != nums[i+1]:
ans+=1
if dp... | p02642 |
def solve():
MAX = 1000001
N = int(eval(input()))
arr = list(map(int, input().split(" ")))
arr.sort()
is_ans = [True]*MAX
ans = 0
dup = set()
for a in arr :
if a in dup:
j = a
while j < MAX :
is_ans[j] = False
... | def solve():
MAX = 1000001
N = int(eval(input()))
arr = list(map(int, input().split(" ")))
arr.sort()
is_ans = [True]*MAX
ans = 0
dup = set()
for a in arr :
if a in dup and is_ans[a] :
j = a
while j < MAX :
is_ans[j] = False
... | p02642 |
n = int(eval(input()))
ns = list(map(int, input().split()))
ans = 0
from collections import Counter
c = Counter(ns)
dubbles = set([key for key, value in list(c.items()) if value >= 2])
ns = sorted([i for i in ns if i not in dubbles])
n = len(ns)
def make_divisors(n):
divisors = set()
for i in range(... | from collections import Counter
n = int(eval(input()))
ns = list(map(int, input().split()))
c = Counter(ns)
ans = 0
l = [True] * (max(ns)+1)
for i in sorted(set(ns)):
if l[i]:
j = i*2
while j < len(l):
l[j] = False
j += i
a = set([key for key, value in list(c.... | p02642 |
mod = 1000000007
eps = 10**-9
def main():
import sys
from collections import Counter
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
M = 10**6
A.sort()
C = Counter(A)
ans = 0
seen = [0] * (M+1)
for a in A:
if... | mod = 1000000007
eps = 10**-9
def main():
import sys
from collections import Counter
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
M = 10**6
A.sort()
C = Counter(A)
ans = 0
seen = [0] * (M+1)
A = set(A)
for a i... | p02642 |
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split(' ')))
counter = Counter(A)
searched = [0 for _ in range(10 ** 6 + 1)]
ans = 0
for i in range(1, 10 ** 6 + 1):
if counter[i] == 0:
continue
if searched[i] ... | def main():
N = int(eval(input()))
A = list(map(int, input().split(' ')))
counter = [0 for _ in range(10 ** 6 + 1)]
for a in A:
counter[a] += 1
searched = [0 for _ in range(10 ** 6 + 1)]
ans = 0
for i in range(1, 10 ** 6 + 1):
if counter[i] == 0:
continu... | p02642 |
def fact(x):
i = 1
while i * i <= x:
if x % i == 0:
yield i
yield x // i
i += 1
def main():
n = int(eval(input()))
a = tuple(map(int, input().split()))
if a.count(10 ** 6) == n:
print((0))
exit()
c = [0] * (max(a) + 1)
... | from time import time
def fact(x):
i = 1
while i * i <= x:
if x % i == 0:
yield i
yield x // i
i += 1
def main():
n = int(eval(input()))
a = tuple(map(int, input().split()))
now = time()
c = [0] * (max(a) + 1)
for e in a:
... | p02642 |
n=int(eval(input()))
a=sorted(map(int,input().split()),reverse=True)
t=[0]*1000001
for i in a:
t[i]+=1
for j in range(i*2,1000001,i):
t[j]+=2
print((t.count(1))) |
n=int(eval(input()))
a=sorted(map(int,input().split()))
m=max(a)+1
t=[0]*m
cnt=0
for i in a:
if t[i]==0:
cnt+=1
elif t[i]==1:
cnt-=1
if t[i]<2:
t[i]+=1
for j in range(i*2,m,i):
t[j]=2
print(cnt) | p02642 |
n = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
limit = 10**6 + 2
A += [limit]
dp = [True] * (limit)
ans = 0
for i in range(n):
a = A[i]
if dp[a] and a != A[i+1]:
ans += 1
for t in range(a,limit,a):
dp[t] = False
t += a
print(ans) | n = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
limit = 10**6 + 2
A += [limit]
dp = [True] * (limit)
ans = 0
for i in range(n):
a = A[i]
if dp[a] and a != A[i+1]:
ans += 1
if dp[a] == False:
continue
for t in range(a,limit,a):
dp[t] = False
t +=... | p02642 |
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
from collec... | # coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
from collec... | p02642 |
n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
a.sort()
dp = [True for i in range(n)]
for i in range(n):
if dp[i]:
for j in range(i + 1, n):
if not a[j] % a[i]:
dp[j] = False
if a[j] == a[i]:
dp[i] = False
print((dp.co... | n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
a.sort()
dp = [True for i in range(a[-1]+1)]
count=0
for i in range(n):
if dp[a[i]]:
count+=1
for j in range(1,n-i):
if a[i]!=a[i+j]:
break
elif j==1:
count-=1
... | p02642 |
from math import gcd as bltin_gcd
def coprime(a, b):
return bltin_gcd(a, b) == 1
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(n):
cnt=0
for j in range(n):
if i!=j:
if a[i]%a[j]==0:
cnt+=1
if cnt==0:
ans+=1
print(an... | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
aMax=a[-1]
isAns=[0]*(aMax+1) ## 1=ans 2=multiple or plural
for ai in a:
isAns[ai]+=1
if isAns[ai]==1:
for j in range(2*ai,aMax+1,ai):
isAns[j]+=2
print((isAns.count(1))) | p02642 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.