input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import Counter
n=int(eval(input()))
*a,=list(map(int, input().split()))
sa=Counter(a)
if 1 in sa:
if sa[1]>1:
print((0))
else:
print((1))
exit()
# def fct(x):
# f1=[1]
# f2=[]
# for i in range(2,min(int(x**(1/2)+7),x)):
# if x%i==0:
# f1.append(i)
# f2.append(x//i)
# return (set(f1+f2))
ans=0
for ai in sa:
if sa[ai]>1:
continue
ans+=1
for i in range(2,min(int(ai**(1/2)+7),ai)):
if ai%i==0:
if i in sa or ai//i in sa:
ans-=1
break
print(ans)
| from collections import Counter
n=int(eval(input()))
*a,=list(map(int, input().split()))
sa=Counter(a)
if 1 in sa:
if sa[1]>1:
print((0))
else:
print((1))
exit()
# def fct(x):
# f1=[1]
# f2=[]
# for i in range(2,min(int(x**(1/2)+7),x)):
# if x%i==0:
# f1.append(i)
# f2.append(x//i)
# return (set(f1+f2))
ans=0
for ai in sa:
if sa[ai]>1:
continue
ans+=1
if ai%2==0:
for i in range(2,min(int(ai**(1/2)+7),ai)):
if ai%i==0:
if i in sa or ai//i in sa:
ans-=1
break
else:
for i in range(3,min(int(ai**(1/2)+7),ai),2):
if ai%i==0:
if i in sa or ai//i in sa:
ans-=1
break
print(ans)
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [1]*(max(a)+1)
for i in sorted(a):
if 2 == dp[i]:
continue
if 3 == dp[i]:
dp[i] = 2
continue
dp[i] = 3
for j in range(2, max(a)//i + 1):
dp[j * i] = 2
ans=0
for i in a:
if dp[i] != 2:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ma = max(a)
dp = [0]*(ma+1)
for i in sorted(a):
if 1 <= dp[i]:
dp[i] += 1
continue
for j in range(1, ma//i + 1):
dp[j * i] += 1
ans=0
for i in a:
if dp[i] == 1:
ans += 1
print(ans) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
AA = [0]*1000000
for i in range(N):
ma = 1000000//A[i]
for j in range(1,ma+1):
AA[j*A[i]-1]+=1
ans = 0
for i in range(N):
if AA[A[i]-1] == 1:
ans += 1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
mina = min(A)
maxa = max(A)
AA = [0]*(maxa-mina+1)
for i in range(N):
maxj = maxa//A[i]
for j in range(1,maxj+1):
AA[j*A[i]-mina]+=1
ans = 0
for i in range(N):
if AA[A[i]-mina] == 1:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
A = [*list(map(int, input().split()))]
mx = max(A)
c = [0]*(1000000+1)
for a in A:
for i in range(a, mx+1, a): c[i] += 1
ans = 0
for a in A:
if c[a] == 1: ans += 1
print(ans)
| n = int(eval(input()))
A = [*list(map(int, input().split()))]
mx = max(A)
c = [0]*(mx+1)
for a in A:
for i in range(a, mx+1, a): c[i] += 1
ans = 0
for a in A:
if c[a] == 1: ans += 1
print(ans)
| p02642 |
n = int(eval(input()))
A = [*list(map(int, input().split()))]
mx = max(A)
c = [0]*(mx+1)
for a in A:
for i in range(a, mx+1, a): c[i] += 1
ans = 0
for a in A:
if c[a] == 1: ans += 1
print(ans)
| n = int(eval(input()))
A = [*list(map(int, input().split()))]
mx = max(A)
c = [0]*(mx+1)
for a in A:
if c[a]: c[a] = 2; continue
for i in range(a, mx+1, a): c[i] += 1
ans = 0
for a in A:
if c[a] == 1: ans += 1
print(ans)
| p02642 |
def d170(n,a):
count=0
dp=[0 for i in range(max(a)+1)]
for x in a:
if dp[x]!=0:
dp[x]=2
else:
for j in range(x,max(a)+1,x):
dp[j]+=1
for x in a:
if dp[x]==1:
count+=1
return count
n=int(eval(input()))
a=list(map(int, input().split()))
print((d170(n,a))) | def d170(n,a):
k=max(a)+1
count=0
dp=[0 for i in range(k)]
for x in a:
if dp[x]!=0:
dp[x]=2
else:
for j in range(x,k,x):
dp[j]+=1
for x in a:
if dp[x]==1:
count+=1
return count
n=int(eval(input()))
a=list(map(int, input().split()))
print((d170(n,a)))
| p02642 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
C = {a:0 for a in A}
for a in A:
C[a] = C[a]+1
maxA = max(A)
D = {a:0 for a in A}
for a in A:
t = 2
while a*t <= maxA:
if a*t in A:
D[a*t] = D[a*t]+1
t = t+1
counter = 0
for a in A:
if C[a] == 1 and D[a] == 0:
counter = counter+1
print(counter) | n = int(eval(input()))
*A, = list(map(int, input().split()))
C = {a:0 for a in A}
for a in A:
C[a] += 1
maxA = max(A)
D = {a:0 for a in A}
for a in A:
t = 2
while a*t <= maxA:
D[a*t] = 1
t = t+1
counter = 0
for a in A:
if C[a] == 1 and D[a] == 0:
counter += 1
print(counter) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
cands = [0]*max(a)
ans = 0
for num in a:
if cands[num-1] >= 2:
continue
for i in range(num, max(a)+1, num):
cands[i-1] += 1
for num in a:
if cands[num-1]==1:
ans+=1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
M = max(a)
cands = [0]*M
ans = 0
for num in a:
if cands[num-1] >= 2:
continue
for i in range(num, M+1, num):
cands[i-1] += 1
for num in a:
if cands[num-1]==1:
ans+=1
print(ans) | p02642 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
def yakusu(n):
yakusu = []
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
yakusu.append(i)
if n // i != i:
yakusu.append(n//i)
return yakusu
baisu = [False] * (10**6 + 1)
def main():
N = I()
A = LI()
ok = 0
for a in A:
if baisu[a]:
continue
if not baisu[a]:
num = a + a
while num < 10**6+1:
baisu[num] = True
num += a
s = collections.Counter(A)
for a in A:
if not baisu[a]:
if s[a] > 1:
continue
ok += 1
print(ok)
main()
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
def yakusu(n):
yakusu = []
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
yakusu.append(i)
if n // i != i:
yakusu.append(n//i)
return yakusu
baisu = [False] * (10**6 + 1)
def main():
N = I()
A = LI()
ok = 0
for a in set(A):
if baisu[a]:
continue
if not baisu[a]:
num = a + a
while num < 10**6+1:
baisu[num] = True
num += a
s = collections.Counter(A)
for a in A:
if not baisu[a]:
if s[a] > 1:
continue
ok += 1
print(ok)
main()
| p02642 |
n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
count = 0
for i in range(n - 1):
if A[i] % A[i + 1] == 0:
count += 1
continue
for j in range(i):
if A[i] % A[j] == 0:
count += 1
break
i = n - 1
for j in range(i):
if A[i] % A[j] == 0:
count += 1
break
print((n - count))
| n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
dp = [False] * (A[-1] + 1)
for a in A:
dp[a] = True
for idx, a in enumerate(A):
if A[idx] == A[idx - 1]:
if idx == 0:
None
else:
dp[a] = False
for j in range(2, A[-1]//a + 1):
dp[a * j] = False
count = 0
for d in dp:
if d:
count += 1
print(count)
| p02642 |
n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
dp = [True] * (10 ** 6 + 1) # 自分以外約数ないならTrue
visited = [False] * (10 ** 6 + 1)
for a in A:
if visited[a]:
dp[a] = False
continue
visited[a] = True
i = 2
while a * i <= 10 ** 6:
dp[a * i] = False
i += 1
ans = 0
for a in A:
ans += dp[a]
print(ans) | n = eval(input())
*A, = list(map(int, input().split()))
max_A = max(A)
count = {a:0 for a in A}
for a in A:
count[a] += 1
is_OK = {a:True for a in A}
for a in A:
i = 2
if not is_OK[a]:
continue
while a * i < max_A + 1:
is_OK[a * i] = False
i += 1
ans = 0
for a in A:
if count[a] == 1 and is_OK[a]:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
cnt = [0] * (a[-1] + 1)
for i in range(n):
cnt[a[i]] += 1
ans = 0
for i in range(1, a[-1] + 1):
if cnt[i] > 0:
if cnt[i] == 1:
ans += 1
for j in range(2, a[-1] + 1):
na = i * j
if na <= a[-1]:
cnt[na] = 0
else:
break
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (max(a) + 1)
# b[i] = (aの要素がiであるような数)
for i in range(n):
b[a[i]] += 1
ans = 0
for i in range(1, len(b)):
if b[i] > 0:
if b[i] == 1:
ans += 1
# print(i, ans)
for j in range(len(b)):
if i * j >= len(b):
break
b[i * j] = 0
print(ans)
| p02642 |
from collections import Counter
n = int(eval(input()))
data = list(map(int, input().split()))
max_ = 10 ** 6 + 1
b = [True] * (max_ + 1)
data.sort()
c = Counter(data)
ans = 0
for d in data:
if b[d]:
for j in range(d, max_, d):
b[j] = False
# 複数存在
if c[d] > 1:
continue
else:
ans += 1
print(ans)
| from collections import Counter
n = int(eval(input()))
data = list(map(int, input().split()))
max_ = 10 ** 6 + 1
b = [True] * (max_ + 1)
data.sort()
c = Counter(data)
ans = 0
for d in data:
if b[d]:
for j in range(d, max_, d):
b[j] = False
# 複数存在
if c[d] == 1:
ans += 1
print(ans)
| p02642 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
from collections import Counter
a = list(map(int, input().split()))
c = Counter(a)
s = set()
for k,v in list(c.items()):
if v>=2:
s.add(k)
a.sort()
ok = set()
p = set(list(range(1, 10**6+1)))
ck = list(c.keys())
ck.sort()
for num in ck:
if num in p:
ok.add(num)
i = 2
while num*i<=10**6:
if num*i in p:
p.remove(num*i)
i += 1
tmp = ok
tmp = set(tmp) - s
print((len(tmp))) | n = int(eval(input()))
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
vals = [True]*(max(a)+1)
ans = 0
m = max(a)+1
for i in range(1, m):
if i not in c:
continue
if c[i]>=2:
vals[i] = False
for j in range(2*i, m, i):
vals[j] = False
ans = 0
for i in range(1, max(a)+1):
if vals[i] and i in c:
ans += 1
print(ans) | p02642 |
import math
from collections import defaultdict
def r():
return int(eval(input()))
def rm():
return list(map(int,input().split()))
def rl():
return list(map(int,input().split()))
'''D'''
n=r()
a=rl()
b=[0]*(max(a)+1)
for i in a:
if b[i]!=0:
b[i]+=1
continue
else:
b[i]+=1
for j in range(2*i,max(a)+1,i):
b[j]+=1
ans=0
for i in a:
ans+=(1 if b[i]==1 else 0)
print(ans) | import math
from collections import defaultdict
def r():
return int(eval(input()))
def rm():
return list(map(int,input().split()))
def rl():
return list(map(int,input().split()))
'''D'''
n=r()
a=rl()
ma=max(a)
b=[0]*(ma+1)
a.sort()
for i in a:
if b[i]!=0:
b[i]+=1
continue
else:
b[i]+=1
for j in range(2*i,ma+1,i):
b[j]+=1
ans=0
for i in a:
if b[i]==1:
ans+=1
print(ans) | p02642 |
from math import ceil
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
m = 10**6+100
n_map = {}
v_a = []
nn_map = {}
for i in a:
if i not in n_map:
n_map[i] = 1
else:
n_map[i] += 1
if i in nn_map:
continue
for j in range(2, ceil(m / i) + 1):
nn_map[i * j] = True
res = 0
for k, v in list(n_map.items()):
if v != 1:
continue
if k in nn_map:
continue
res += 1
print(res) | from math import ceil
n = int(eval(input()))
a = list(map(int, input().split()))
m = 10 ** 6
n_map = {}
v_a = []
for i in a:
if i not in n_map:
n_map[i] = 1
else:
n_map[i] += 1
v_a = [(k,v) for k, v in list(n_map.items())]
v_a.sort(key=lambda x: x[0])
res = 0
nn_map = {}
for i, v in v_a:
if i in nn_map:
continue
for j in range(1, ceil(m / i) + 1):
nn_map[i * j] = True
if v == 1:
res += 1
print(res) | p02642 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
c=[1]*n
for i in range(n-1):
t=a[i]
if c[i]:
if t==a[i+1]:
c[i]=0
for j in range(i+1,n):
if a[j]%t==0:
c[j]=0
print((sum(c))) | n=int(eval(input()))
a=sorted(list(map(int,input().split())))
m=max(a)
b=[1]*m
c=[0]*m
for i in a:
c[i-1]+=1
if b[i-1]:
for j in range(i*2-1,m,i):
b[j]=0
x=0
for i in range(m):
if b[i] and c[i]==1:
x+=1
print(x) | p02642 |
d=[i:=0]*8**7
for j in[*open(0)][1].split():d[int(j)]+=1
while i<1e6:
i+=1;j=i
while j<1e6:j+=i;d[j]*=d[i]<1
print((d.count(1))) | d=[0]*8**7
for j in[*open(0)][1].split():d[int(j)]+=1
i=0
while i<1e6:
i+=1;j=i
while j<1e6:j+=i;d[j]*=d[i]<1
print((d.count(1))) | p02642 |
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7
n = INT()
a = LIST()
c = Counter(a)
a = sorted(a)
isprime = {a[i]:True for i in range(n)}
for i in range(n):
if a[i] > a[-1]//2: break
if not isprime[a[i]]: continue
for j in range(2, a[-1]//a[i]+1):
if a[i]*j in a:
isprime[a[i]*j] = False
diff = len([i for i in range(len(c)) if list(c.values())[i] != 1 and isprime[list(c.keys())[i]]])
print((list(isprime.values()).count(True)-diff))
| import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7
n = INT()
a = LIST()
c = Counter(a)
a = sorted(a)
M = max(a)
isprime = [0]*(M+1)
for i in range(n):
if isprime[a[i]]==0:
isprime[a[i]] = 1
tmp = 2
while a[i]*tmp < M+1:
isprime[a[i]*tmp] = 2
tmp += 1
elif isprime[a[i]] == 1:
isprime[a[i]] = 2
ans = 0
for ele in a:
if isprime[ele] != 2:
ans += 1
print(ans) | p02642 |
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7
n = INT()
a = LIST()
c = Counter(a)
a = sorted(a)
isprime = {a[i]:True for i in range(n)}
for i in range(n):
if not isprime[a[i]]: continue
j = 2
while a[i]*j < a[-1]+1:
if a[i]*j in a:
isprime[a[i]*j] = False
j += 1
ensem = list(c.values())
key = list(c.keys())
diff = len([i for i in range(len(c)) if ensem[i] != 1 and isprime[key[i]]])
print((list(isprime.values()).count(True)-diff))
| import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7
n = INT()
a = LIST()
c = Counter(a)
a = sorted(a)
isprime = {a[i]:True for i in range(n)}
for i in range(n):
if not isprime[a[i]]: continue
j = 2
while a[i]*j < a[-1]+1:
if isprime.get(a[i]*j) == True:
isprime[a[i]*j] = False
j += 1
ensem = list(c.values())
key = list(c.keys())
diff = len([i for i in range(len(c)) if ensem[i] != 1 and isprime[key[i]]])
print((list(isprime.values()).count(True)-diff)) | p02642 |
def main():
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
for i in range(n-1):
if a[i]!=0:
flg = 0
for j in range(i+1,n):
if a[i]==a[j]:
flg=1
a[j] = 0
elif a[j]%a[i]==0:
a[j] = 0
if flg==1:
a[i] = 0
ans = 0
for i in range(n):
if a[i]!=0:
ans+=1
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
dp = [0 for i in range(a[-1]+1)]
lbl = []
for i in range(n):
if dp[a[i]]==2:
lbl.append(a[i])
continue
if dp[a[i]]==1:
continue
else:
for j in range(1,a[-1]//a[i]+1):
dp[a[i]*j] = 1
dp[a[i]] = 2
for i in range(len(lbl)):
dp[lbl[i]] = 0
ans = 0
for i in range(len(dp)):
if dp[i] == 2:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02642 |
def main():
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
dp = [0 for i in range(a[-1]+1)]
lbl = []
for i in range(n):
if dp[a[i]]==2:
lbl.append(a[i])
continue
if dp[a[i]]==1:
continue
else:
for j in range(1,a[-1]//a[i]+1):
dp[a[i]*j] = 1
dp[a[i]] = 2
for i in range(len(lbl)):
dp[lbl[i]] = 0
ans = 0
for i in range(len(dp)):
if dp[i] == 2:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
a = sorted(map(int,input().split()))
fld = [-1 for i in range(a[-1]+1)]
flg = []
for i in range(n):
if fld[a[i]]==-1:
fld[a[i]]=1
for j in range(2,a[-1]//a[i]+1):
fld[a[i]*j] = 0
elif fld[a[i]]==1:
flg.append(a[i])
for i in range(len(flg)):
fld[flg[i]] = 0
ans = 0
for i in range(len(fld)):
if fld[i] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02642 |
n = int(eval(input()))
a_list = list(map(int,input().split()))
a_list = sorted(a_list)
flag = [0]*n
ans = 0
for i in range(len(a_list)):
if flag[i] == 1:
continue
if i == n-1:
ans += 1
break
if 0 not in flag:
break
flag[i] = 1
if a_list[i] != a_list[i+1]:
ans += 1
for j in range(i+1,len(a_list)):
if a_list[j]%a_list[i] == 0:
flag[j] = 1
print(ans) | n = int(eval(input()))
a_list = list(map(int,input().split()))
a_list = sorted(a_list)
flag = [0]*n
ans = 0
m = max(a_list)
b_list = [0]*(m+1)
for i in a_list:
b_list[i] += 1
for i in a_list:
if b_list[i] == 1:
ans += 1
for j in range(i , m+1 ,i):
b_list[j]+= 1
print(ans) | p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
MAX = 10 ** 6
is_divisible = [True] * (MAX + 1)
is_divisible[0] = False
for i in A:
if not is_divisible[i]:
continue
for j in range(i * 2, MAX + 1, i):
is_divisible[j] = False
for k, v in list(Counter(A).items()):
if v > 1:
is_divisible[k] = False
st = {i for i in range(MAX + 1) if is_divisible[i]}
print((len(st & set(A))))
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
S = sorted(list(set(A)))
MAX = 10 ** 6
is_divisible = [True] * (MAX + 1)
is_divisible[0] = False
for i in S:
if not is_divisible[i]:
continue
for j in range(i * 2, MAX + 1, i):
is_divisible[j] = False
for k, v in list(Counter(A).items()):
if v > 1:
is_divisible[k] = False
ans = len([a for a in A if is_divisible[a]])
print(ans)
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
cand = set(a)
exist = set()
dup = set()
for item in a:
if item in exist:
dup.add(item)
else:
exist.add(item)
dame_set = set()
a.sort()
ret = 0
for val in a:
if val in dup:
i = 1
cnt = 10 ** 6 // val
while i <= cnt:
tmp = i * val
if tmp in cand:
dame_set.add(tmp)
i += 1
else:
if val in dame_set:
continue
else:
ret += 1
i = 1
cnt = 10 ** 6 // val
while i <= cnt:
tmp = i * val
if tmp in cand:
dame_set.add(tmp)
i += 1
print(ret)
| n = int(eval(input()))
a = list(map(int, input().split()))
cand = set(a)
exist = set()
dup = set()
for item in a:
if item in exist:
dup.add(item)
else:
exist.add(item)
dame_set = set()
a.sort()
ret = 0
for val in a:
if val in dup:
if val in dame_set:
continue
else:
i = 1
cnt = 10 ** 6 // val
while i <= cnt:
tmp = i * val
if tmp in cand:
dame_set.add(tmp)
i += 1
else:
if val in dame_set:
continue
else:
ret += 1
i = 1
cnt = 10 ** 6 // val
while i <= cnt:
tmp = i * val
if tmp in cand:
dame_set.add(tmp)
i += 1
print(ret)
| p02642 |
import math , sys
N = int( eval(input()) )
A = list( map( int, input().split() ))
A.sort()
Cs = [0 for _ in range(10**6+1)]
#print(A)
i=0
#M = min(max(A),10**6+1)
for i in range(N):
e = A[i]
if Cs[e]==1:
Cs[e]=2
elif Cs[e]==0:
Cs[e]=1
for i in range(len(Cs)):
Cs[i] = Cs[i]%2
for e in A:
i = 2
while e*i <10**6+1:
Cs[e*i] = 0
i+=1
ans = sum(Cs)
print(ans)
| import math , sys
N = int( eval(input()) )
A = list( map( int, input().split() ))
A.sort()
Cs = [0 for _ in range(10**6+1)]
M = A[-1]
#print(A)
i=0
M = max(A)
for i in range(N):
e = A[i]
if Cs[e]==1:
Cs[e]=2
elif Cs[e]==0:
Cs[e]=1
for i in range(len(Cs)):
Cs[i] = Cs[i]%2
for e in A:
i = 2
while e*i <= M:
Cs[e*i] = 0
i+=1
ans = sum(Cs)
print(ans)
| p02642 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np
# from numpy import cumsum # accumulate
def solve():
N = II()
A = LI()
cost = {}
for a in A:
if cost.get(a, -1) == -1:
cost[a] = 1
else:
cost[a] = 0
A = sorted(A)
memo = [0] * (A[-1] + 1)
ans = 0
for a in A:
for i in range(1, int(a ** 0.5) + 1):
if a % i: continue
if memo[i] or memo[a//i]:
break
else:
ans += cost[a]
memo[a] = 1
print(ans)
if __name__ == '__main__':
solve()
| import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np
# from numpy import cumsum # accumulate
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def solve():
N = II()
A = LI()
mx = max(A)
memo = [0] * (mx + 1)
for a in A:
for i in range(a, mx+1, a):
memo[i] += 1
# print(memo)
ans = 0
for a in A:
if memo[a] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
solve()
| p02642 |
import os
import sys
from io import BytesIO, IOBase
def main():
n = int(eval(input()))
arr = list(map(int, input().split()))
arr.sort()
d = {}
ans = 0
s1 = 0
d = {i: 0 for i in range(1, 10 ** 6 + 1)}
for i in arr:
if i == 1:
s1 += 1
d[i] += 1
if s1 != 0:
if s1 > 1:
print((0))
quit()
else:
print((1))
quit()
for i in range(n):
x = arr[i]
if d[x] == 1:
f = 1
for j in range(2, int(x ** 0.5) + 1):
y = x // j
if (d[j] >= 1 and x % j == 0) or (d[y] >= 1 and x % (y) == 0):
f = 0
break
if f == 1:
ans += 1
print(ans)
# fast-io region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input():
return sys.stdin.readline().rstrip("\r\n")
def write(*args, end="\n"):
for x in args[:-1]:
sys.stdout.write(str(x) + " ")
sys.stdout.write(str(args[-1]))
sys.stdout.write(end)
def r_array():
return [int(x) for x in input().split()]
def r_int():
return int(eval(input()))
if __name__ == "__main__":
main()
|
import os
import sys
from io import BytesIO, IOBase
def main():
n = int(eval(input()))
arr = list(map(int, input().split()))
arr.sort()
ans = 0
k=max(arr)
d = [0]*(k+1)
if arr[0] == 1:
if n>1 and arr[1]==1:
print((0))
quit()
else:
print((1))
quit()
for i in range(n):
d[arr[i]]+=1
for i in range(n):
x=arr[i]
if d[x]==1:
ans+=1
for j in range(x,k+1,x):
d[j]+=1
print(ans)
# fast-io region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input():
return sys.stdin.readline().rstrip("\r\n")
def write(*args, end="\n"):
for x in args[:-1]:
sys.stdout.write(str(x) + " ")
sys.stdout.write(str(args[-1]))
sys.stdout.write(end)
def r_array():
return [int(x) for x in input().split()]
def r_int():
return int(eval(input()))
if __name__ == "__main__":
main()
| p02642 |
n = int(eval(input()))
a = sorted(map(int, input().split()))
l = [0]*(10**6+1)
for i in a:
if l[i] == 0:
l[i] = 1
for j in range(i*2, max(a)+1, i):
l[j] = -1
else:
l[i] = -1
print((l.count(1))) | n = int(eval(input()))
a = sorted(map(int, input().split()))
l = [0]*(10**6+1)
M = max(a)
for i in a:
if l[i] == 0:
l[i] = 1
for j in range(i*2, M+1, i):
l[j] = -1
else:
l[i] = -1
print((l.count(1))) | p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
x=0
for i in range(N):
for j in range(N):
if i==j:
pass
elif A[i]%A[j]==0:
break
else:
x+=1
print(x) | N=int(eval(input()))
A=list(map(int,input().split()))
AM=max(A)+1
B=[0]*AM
x=0
for i in A:
for j in range(i,AM,i):
B[j]+=1
for i in A:
if B[i]==1:
x+=1
print(x) | p02642 |
N=eval(input())
A=sorted(map(int,input().split()))
M=A[-1]+1
B=[True]*M
c=0
x=0
for i in A:
if B[i]==True:
if i!=c:
for j in range(i*2,M,i):
B[j]=False
x+=1
c=i
else:
B[i]=False
x-=1
print(x) | def main():
N=eval(input())
A=sorted(map(int,input().split()))
M=A[-1]+1
B=[True]*M
c=0
x=0
for i in A:
if B[i]:
if i!=c:
for j in range(i*2,M,i):
B[j]=False
x+=1
c=i
else:
B[i]=False
x-=1
print(x)
main() | p02642 |
N=int(eval(input()))
A=list(map(int, input().split()))
A=sorted(A)
DI={}
for i in A:
if i not in DI:
DI[i]=1
else:
DI[i]+=1
d=0
B=sorted(list(set(A)))
n=len(B)
for i in range(n):
if DI[B[i]]==1:
d+=1
for j in range(0,i):
if B[i]<B[j]*2:
break
if B[i]%B[j]==0:
d-=1
break
print(d) | N=int(eval(input()))
A=list(map(int, input().split()))
A=sorted(A)
D=[1]*(A[-1]+1)
for i in A:
if D[i]==1:
for j in range(A[-1]//i):
D[i*(j+1)]=0
D[i]=1
dic={}
for i in A:
if i not in dic:
dic[i]=1
else:
dic[i]+=1
for i in dic:
if dic[i]>1:
D[i]=0
ans=0
for i in A:
if D[i]==1:
ans+=1
print(ans) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans_list = [[1, 0] for i in range(1000001)]
for i in range(N):
now = A[i]
if ans_list[now][1] >= 2:
continue
elif ans_list[now][1] == 1:
ans_list[now][1] = 2
else:
ans_list[now][1] = 1
for j in range(2*now, 1000001, now):
ans_list[j][0] = 0
count = 0
for i in range(N):
now = A[i]
if ans_list[now][0] == 1 and ans_list[now][1] == 1:
count += 1
print(count) | N = int(eval(input()))
A = list(map(int, input().split()))
num = [1 for i in range(1000001)]
ans_list = [0 for i in range(1000001)]
for i in range(N):
now = A[i]
if ans_list[now] == 2:
continue
elif ans_list[now] == 1:
ans_list[now] = 2
else:
ans_list[now] = 1
for j in range(2*now, 1000001, now):
num[j] = 0
count = 0
for i in range(N):
now = A[i]
if num[now] == 1 and ans_list[now] == 1:
count += 1
print(count) | p02642 |
#!/usr/bin/env python3
import sys
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
A = LI()
A.sort()
MAX = 10**6+1
All = [0 for i in range(MAX)]
setA = set(A)
for i in A:
k = i
All[k] += 1
k += i
if All[i] == 2:
continue
while k < MAX and i in setA:
All[k] += 1
k += i
ans = 0
for i in range(1, MAX):
if All[i] == 1 and i in setA:
ans += 1
print(ans)
# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy
main()
| #!/usr/bin/env python3
import sys
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
A = LI()
A.sort()
MAX = A[-1]+1
All = [0 for i in range(MAX)]
setA = set(A)
for i in A:
k = i
All[k] += 1
k += i
if All[i] == 2:
continue
while k < MAX and i in setA:
All[k] += 1
k += i
ans = 0
for i in range(1, MAX):
if All[i] == 1 and i in setA:
ans += 1
print(ans)
# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy
main()
| p02642 |
#!/usr/bin/env python3
import sys
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
A = LI()
A.sort()
MAX = 10**6+1
All = [0] * MAX
setA = set(A)
for i in A:
k = i
All[k] += 1
k += i
if All[i] == 2:
continue
while k < MAX:
All[k] += 1
k += i
ans = 0
for i in range(1, MAX):
if All[i] == 1 and i in setA:
ans += 1
print(ans)
# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy
main()
| #!/usr/bin/env python3
import sys
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
A = LI()
A.sort()
MAX = 10**6+1
All = [0] * MAX
setA = set(A)
for i in A:
k = i
All[k] += 1
k += i
if All[i] >= 2:
continue
while k < MAX:
All[k] += 1
k += i
ans = 0
for i in range(1, MAX):
if All[i] == 1 and i in setA:
ans += 1
print(ans)
# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy
main()
| p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
import collections
c = collections.Counter(a)
d=[]
for ck,cv in list(c.items()):
if cv>=2:
d.append(ck)
dset=set(d)
aa=[]
while True:
aa.append(a[0])
a2=[]
for i in range(1,len(a)):
if a[i]%a[0]!=0:
a2.append(a[i])
# a=a2.copy()
if len(a2)==0:
break
aa.append(a2[0])
a=[]
for i in range(1,len(a2)):
if a2[i]%a2[0]!=0:
a.append(a2[i])
# a=a2.copy()
if len(a)==0:
break
aaset=set(aa)
aaset=aaset-dset
print((len(aaset))) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
amax=max(a)
dp=[True]*(amax+1)
import collections
c = collections.Counter(a)
d=[]
for ck,cv in list(c.items()):
if cv>=2:
d.append(ck)
dset=set(d)
aa=set()
for ai in a:
if dp[ai]:
aa.add(ai)
for aj in range(ai*2,amax+1,ai):
dp[aj]=False
aa=aa-dset
print((len(aa)))
| p02642 |
n=int(eval(input()))
arr=list(map(int,input().strip().split()))
arr.append(0)
arr.sort()
arr.append(0)
count=0
s=set()
for i in range(1,n+1):
if(arr[i]==arr[i-1] or arr[i]==arr[i+1]):
s.add(arr[i])
else:
if(len(s)):
crr=list(s)
flag=0
for j in range(len(s)):
if(arr[i]%crr[j]==0):
flag=1
break
if(flag==0):
count=count+1
s.add(arr[i])
else:
s.add(arr[i])
count=count+1
print(count)
| n=int(eval(input()))
arr=list(map(int,input().strip().split()))
arr.sort()
maxi=arr[-1]
booll=[True]*(maxi+1)
r=0
for i in range(n-1):
a=arr[i]
if(booll[a]==True):
for j in range(a,maxi+1,a):
booll[j]=False
if(a<arr[i+1]):
r=r+1
if(booll[arr[n-1]]==True):
r=r+1
print(r)
| p02642 |
from math import sqrt
from collections import Counter
def is_prime(n):
if n == 1:
return False
for i in range(2, int(sqrt(n))+1):
if n % i == 0:
return False
return True
def make_divisors(n, d):
lower_divisors , upper_divisors = [], []
i = 2
while i*i <= n:
if n % i == 0:
if d[i] > 0:
return True
if i != n // i and d[n//i] > 0:
return True
i += 1
return False
a=int(eval(input()))
b=[int(x) for x in input().split()]
b=sorted(b)
d=Counter(b)
c=0
if d[1] > 1:
print((0))
elif d[1] > 0:
print((1))
else:
for i in range(0, a):
if d[b[i]] > 1:
c+=1
elif not is_prime(b[i]):
if make_divisors(b[i], d):
c+=1
print((a-c)) | from collections import Counter
def board(dp, i):
m = 1
while i*m <= len(dp)-1:
dp[i*m]=False
m+=1
a=int(eval(input()))
b=[int(x) for x in input().split()]
b=sorted(b)
d=Counter(b)
dp=[True]*(b[-1]+1)
c=0
for i in b:
if dp[i] and d[i] < 2:
c+=1
board(dp, i)
print(c) | p02642 |
import collections,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
A = sorted(LI())
ans_bool = [0]*(10**6+1)
for a in A:
num = a
while num<=10**6:
ans_bool[num] += 1
num += a
ans = 0
for a in A:
if ans_bool[a]==1:
ans += 1
print(ans)
| import collections,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
A = sorted(LI())
counter_A = collections.Counter(A)
sequence = [0]*(10**6+1)
ans = 0
for k,v in list(counter_A.items()):
if sequence[k]==1:
continue
if v==1:
ans += 1
for i in range(k,10**6+1,k):
sequence[i] = 1
print(ans)
| p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
prime = [True] * (10 ** 6 + 10)
b = sorted(set(a))
for i in b:
num = i * 2
while True:
if num >= 10 ** 6 + 10:
break
prime[num] = False
num += i
ans = 0
for s in a:
if prime[s] == True and c[s] == 1:
ans += 1
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
prime = [True] * (10 ** 6 + 10)
b = sorted(set(a))
for i in b:
num = i * 2
while True:
if num >= 10 ** 6 + 1:
break
prime[num] = False
num += i
ans = 0
for s in a:
if prime[s] == True and c[s] == 1:
ans += 1
print(ans) | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
prime = [True] * (10 ** 6 + 10)
b = sorted(set(a))
for i in b:
num = i * 2
while True:
if num >= 10 ** 6 + 1:
break
prime[num] = False
num += i
ans = 0
for s in a:
if prime[s] == True and c[s] == 1:
ans += 1
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
prime = [True] * (10 ** 6 + 10)
b = sorted(set(a))
for i in b:
num = i * 2
while True:
if num >= 10 ** 6 + 10:
break
prime[num] = False
num += i
ans = 0
for s in a:
if prime[s] == True and c[s] == 1:
ans += 1
print(ans) | p02642 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n = I()
a = LI()
N = 10**6
f = [1]*(N+1)
a.sort()
cnt = [0]*(N+1)
for i in a:
cnt[i] += 1
for i in range(N+1):
if cnt[i] > 1:
f[i] = 0
ans = 0
for i in a:
if f[i]:
ans += 1
x = i
while x <= N:
f[x] = 0
x += i
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n = I()
a = LI()
N = 10**6
f = [1]*(N+1)
a.sort()
cnt = [0]*(N+1)
for i in a:
cnt[i] += 1
for i in range(N+1):
if cnt[i] > 1:
f[i] = 0
x = i
while x <= N:
f[x] = 0
x += i
ans = 0
for i in a:
if f[i]:
ans += 1
x = i
while x <= N:
f[x] = 0
x += i
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| p02642 |
from collections import *
from copy import *
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
l=Counter(a)
m=l.most_common()
f=[False for i in range(max(a)+1)]
ans=0
for i,j in m:
t=deepcopy(i)
if f[t]==False and j==1:
ans+=1
while t<=max(a):
f[t]=True
t+=i
elif f[t]==False and j!=1:
while t<=max(a):
f[t]=True
t+=i
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
dp=[0]*(a[-1]+1)
for i in a :
dp[i]+=1
for i in a :
if dp[i] :
for j in range(i*2,a[-1]+1,i) :
dp[j]=0
print((dp.count(1)))
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = max(a)
che,re = [1 for i in range(b)],[]
for i in a:
if i in re:
che[i-1] = 0
else:
re.append(i)
c = b // i
for j in range(2,c+1):
che[i*j-1] = 0
ans = 0
for i in re:
if che[i-1] == 1:
ans += 1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
b = max(a)
che = [1 for i in range(b)]
for i in a:
if che[i-1] == 1:
c = b // i
for j in range(2,c+1):
che[i*j-1] = 0
che[i-1] = 2
elif che[i-1] == 2:
che[i-1] = 0
ans = 0
for i in a:
if che[i-1] == 2:
ans += 1
print(ans)
| p02642 |
def resolve():
'''
code here
'''
import math
import collections
N = int(eval(input()))
A_list = [int(item) for item in input().split()]
A_list.sort()
cnt = 0
while len(A_list) > 0:
# print(A_list)
cnt += 1
temp = A_list[0]
del A_list[0]
is_same = False
for item in A_list[:]:
if item == temp:
is_same = True
if item % temp == 0:
A_list.remove(item)
if is_same:
cnt -= 1
print(cnt)
if __name__ == "__main__":
resolve() | def resolve():
'''
code here
'''
import collections
N = int(eval(input()))
A_list = [int(item) for item in input().split()]
A_list.sort()
dp = [0 for item in range(A_list[-1]+1)]
for item in A_list:
temp = item
while temp <= A_list[-1]:
dp[temp] += 1
temp += item
cnt = 0
for item in A_list:
if dp[item] == 1:
cnt += 1
print(cnt)
if __name__ == "__main__":
resolve()
| p02642 |
import sys
from collections import Counter
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return list(map(int, sys.stdin.readline().strip().split()))
def main():
n = _i()
a = list(_ia())
a.sort()
c = Counter(a)
w = set()
o = []
m = 10**6 + 1
for ai in a:
if ai in w:
continue
o.append(ai)
for j in range(ai+ai, m, ai):
w.add(j)
cnt = 0
for oi in o:
if c[oi] == 1:
cnt += 1
return cnt
if __name__ == "__main__":
print((main()))
| import sys
from collections import Counter
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return list(map(int, sys.stdin.readline().strip().split()))
def main():
_ = _i()
a = Counter(_ia())
k = sorted(a.keys())
m = max(k) + 1
c = [False for i in range(m)]
cnt = 0
for ki in k:
if c[ki]:
continue
if a[ki] == 1:
cnt += 1
for j in range(ki+ki, m, ki):
c[j] = True
return cnt
if __name__ == "__main__":
print((main()))
| p02642 |
import sys
import collections
import math
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
n = I()
mylist = sorted(list(MI()))
max_num = int(math.sqrt(mylist[n-1]))
start = mylist[0]
input_list = [0] * n
index = 0
while len(mylist) >= 1:
temp = mylist.pop(0)
if not(temp in mylist):
index += 1
for j in set(mylist):
if j % temp == 0:
while j in mylist:
mylist.remove(j)
print(index) | import sys
import collections
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
n = I()
mylist = list(MI())
max_a = max(mylist)
exclude_set = set()
tlist = [False] * (max_a+1)
for a in mylist:
if tlist[a]:
exclude_set.add(a)
else:
tlist[a] = True
ans = 0
for i in range(1, max_a//2 + 1):
if not tlist[i]:
continue
else:
for j in range(2*i, max_a+1, i):
tlist[j]=False
for i in range(len(tlist)):
if tlist[i] and not i in exclude_set:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02642 |
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
def get_divisors(n):
divs = []
for i in range(2, int(n**0.5)+1):
c = 0
while n % i == 0:
n = n // i
c += 1
if c > 0:
divs.append((i, c))
if n > 1:
divs.append((n, 1))
return divs
N = ri()
A = rl()
import collections
H = collections.defaultdict(set)
D = []
for i, a in enumerate(A):
divs = get_divisors(a)
D.append(divs)
for d, c in divs:
for j in range(1, c+1):
k = pow(d, j)
H[k].add(i)
del_list = set()
for i, divs in enumerate(D):
s = set(range(N))
for d, c in divs:
for j in range(1, c+1):
k = pow(d, j)
s &= H[k]
del_list |= s - set([i])
print((N-len(del_list)))
| import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
A = rl()
A.sort()
m = A[-1]
import collections
h = collections.Counter(A)
ans = 0
for a in A:
if h[a] == 0:
continue
if h[a] == 1:
ans += 1
for j in range(a, m+1, a):
h[j] = 0
print(ans)
| p02642 |
from sys import stdin
n = int(eval(input()))
a = list(map(int, stdin.readline().split()))
a.sort()
amax = max(a)+1
e = [True]*amax
Alice = set()
Bob = set()
ans = 0
for i in range(n):
if e[a[i]] == True:
Alice.add(a[i])
for j in range(a[i], amax, a[i]):
e[j] = False
else:
if a[i] in Alice:
Bob.add(a[i])
print((len(Alice - Bob))) | def main():
from sys import stdin
n = int(eval(input()))
a = list(map(int, stdin.readline().split()))
a.sort()
amax = max(a)+1
e = [True]*amax
Alice = set()
Bob = set()
ans = 0
for i in range(n):
if e[a[i]] == True:
Alice.add(a[i])
for j in range(a[i], amax, a[i]):
e[j] = False
else:
if a[i] in Alice:
Bob.add(a[i])
print((len(Alice - Bob)))
if __name__ == "__main__":
main() | p02642 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def make_divisors(n): # nの約数を列挙
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
def main():
# 約数
N = ir()
A = lr()
A.sort()
answer = 0
bl = [False] * (A[-1]+1)
used = set()
for i, a in enumerate(A):
if i < N-1 and a == A[i+1]:
bl[a] = True
continue
if a in used:
continue
used.add(a)
divs = make_divisors(a)
flag = True
for x in divs:
if bl[x]:
flag = False
break
bl[a] = True
if flag:
answer += 1
print(answer)
main()
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
A.sort()
bl = [True] * (A[-1]+1)
answer = 0
for i, a in enumerate(A):
if i < N-1 and A[i+1] == a:
pass
elif bl[a]:
answer += 1
if bl[a]:
bl[a] = False
next = a + a
while next <= A[-1]:
bl[next] = False
next += a
print(answer)
| p02642 |
from collections import Counter
N, *A = list(map(int, open(0).read().split()))
C = Counter(A)
B = sorted(list(C.items()), key=lambda x: x[0])
lim = B[-1][0] + 1
memo = set()
ans = 0
for k, v in B:
if k in memo:
continue
memo |= set(range(k, lim, k))
ans += (v == 1)
print(ans) | N, *A = list(map(int, open(0).read().split()))
A.sort()
lim = A[-1] + 1
dp = [0] * lim
for a in A:
dp[a] += 1
if dp[a] == 1:
for j in range(2 * a, lim, a):
dp[j] += 2
print((dp.count(1))) | p02642 |
n = int(eval(input()))
lst = list(map(int, input().split()))
lst.sort()
visited = [0 for _ in range(n)]
ans = n
for i in range(n):
if visited[i] == 0:
for j in range(i+1,n):
if lst[j] % lst[i] == 0 and visited[j] == 0:
ans -= 1
visited[j] = 1
if lst[j] == lst[i] and visited[i] == 0:
ans -= 1
visited[i] = 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
maxA = max(a)
dp = [0]*(maxA+1)
count = 0
for e in a:
for i in range(e,maxA+1,e):
dp[i] += 1
for e in a:
if dp[e] == 1:
count += 1
print(count)
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
O = A.copy()
O = [k for k in O if O.count(k) == 1]
for i in A:
for j in A:
if i != j:
if (i%j == 0):
if i in O:
O.remove(i)
ans = len(O)
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
mx = max(A)
x = [0] * (mx + 1) # len(x)
for i in A:
x[i] += 1
for i in range(1, mx + 1):
if x[i] != 0:
for j in range(2 * i, mx + 1, i):
x[j] = 0
if x[i] > 1:
x[i] = 0
print((sum(x))) | p02642 |
def main():
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
mod = 10**9 + 7
n = int(eval(input()))
a = [int(x) for x in input().split()]
a_set = set(a)
#約数の列挙
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
from collections import Counter
c = Counter(a)
cnt = 0
for i in a:
prime = make_divisors(i)
flag = 1
if c[i] > 1:
continue
for j in prime:
if j == i:
continue
if j in a_set:
flag = 0
break
if flag:
cnt += 1
print(cnt)
main()
| import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
max_a = a[-1]
is_True = [1]*(max_a + 1)
for i in a:
if is_True[i]:
for j in range(2*i, max_a + 1, i):
is_True[j] = False
cnt = 0
from collections import Counter
c = Counter(a)
for i in a:
if is_True[i] and c[i] == 1:
cnt += 1
print(cnt) | p02642 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A)
c = collections.Counter(A)
cnt = 0
max = int(10e5+1)
l = [0] * (max+1)
for n in A:
for j in range(n, max+1, n):
l[j] += 1
for n in A:
if c[n] > 1:
continue
if l[n] == 1:
cnt += 1
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
max = int(10e5+1)
l = [0] * (max+1)
for n in A:
if l[n] != 0:
l[n] = 2
continue
for j in range(n, max+1, n):
l[j] += 1
for n in A:
if l[n] == 1:
cnt += 1
print(cnt) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
INF = 10**6+1
lis = [1]*INF
exist = [0]*INF
for i in range(N):
a = A[i]
exist[a] += 1
if lis[a]:
q = 2
while a*q < INF:
lis[a*q] = 0
q += 1
cnt = 0
for a in A:
if lis[a] and exist[a] == 1:
cnt += 1
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
INF = 10**6+1
lis = [1]*INF
exist = [0]*INF
for i in range(N):
a = A[i]
if lis[a] and exist[a] < 1:
q = 2
while a*q < INF:
lis[a*q] = 0
q += 1
exist[a] += 1
cnt = 0
for a in A:
if lis[a] and exist[a] == 1:
cnt += 1
print(cnt) | p02642 |
from collections import defaultdict
def main():
MOD = 10**9+7
n = int(eval(input()))
A = list(map(int,input().split()))
dp = [True] * (max(A)+1)
for a in A:
c = 2
while a*c <= max(A):
dp[a*c] = False
c += 1
d = defaultdict(int)
for a in A:
d[a] += 1
ans = 0
for a in A:
if dp[a] == True and d[a]==1:
ans += 1
print(ans)
main() | from collections import defaultdict
def main():
MOD = 10**9+7
n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
T = A[-1]+1
dp = [True] * T
d = defaultdict(int)
for a in A:
d[a] += 1
if dp[a]:
for j in range(2*a,T,a):
dp[j] = False
ans = 0
for a in A:
if d[a] == 1 and dp[a] == True:
ans += 1
print(ans)
main() | p02642 |
from collections import Counter
from operator import mul
from functools import reduce
n = int(eval(input()))
A = list(map(int, input().split()))
cnt_a = Counter(A)
memo = [1] * 1000001
for a in A:
memo[a] = 1
A.sort()
for a in A:
for i in range(a * 2, 1000001, a):
memo[i] = -1
for l in list(cnt_a.keys()):
if cnt_a[l] >= 2:
memo[l] = "daburi"
ans = 0
for a in A:
if memo[a] == 1:
ans += 1
print(ans)
| from collections import Counter
from operator import mul
from functools import reduce
n = int(eval(input()))
A = list(map(int, input().split()))
cnt_a = Counter(A)
memo = [1] * 1000001
for a in A:
memo[a] = 1
A.sort()
a_max = max(A)
for a in A:
if not memo[a]:
continue
for i in range(a * 2, a_max + 1, a):
memo[i] = -1
for l in list(cnt_a.keys()):
if cnt_a[l] >= 2:
memo[l] = "daburi"
ans = 0
for a in A:
if memo[a] == 1:
ans += 1
print(ans)
| p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
U = [0]*(10**6+1)
for e in A:
U[e] += 1
ans = 0
for k in range(1,10**6+1):
if U[k] == 1:
ans += 1
if U[k] > 0:
for l in range(2*k,max(A)+1,k):
if U[l] > 0:
U[l] += 1
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
U = [0]*(10**6+1)
for e in A:
U[e] += 1
ans = 0
for k in range(1,max(A)+1):
if U[k] == 1:
ans += 1
if U[k] > 0:
for l in range(2*k,10**6+1,k):
if U[l] > 0:
U[l] += 1
print(ans)
| p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
U = [0]*(10**6+1)
for e in A:
U[e] += 1
ans = 0
for k in range(1,max(A)+1):
if U[k] == 1:
ans += 1
if U[k] > 0:
for l in range(2*k,10**6+1,k):
if U[l] > 0:
U[l] += 1
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
m = max(A)
U = [0]*(m+1)
for e in A:
U[e] += 1
ans = 0
for k in range(1,m+1):
if U[k] == 1:
ans += 1
if U[k] > 0:
for l in range(2*k,m+1,k):
if U[l] > 0:
U[l] += 1
print(ans)
| p02642 |
X=10**6+1
E=[1 for i in range(X)]
E[0]=0
N=int(eval(input()))
A=list(map(int,input().split()))
import copy
B=copy.deepcopy(A)
B.sort()
D={}
for i in range(N):
if A[i] not in D:
D[A[i]]=1
else:
D[A[i]]=2
ANS=0
for i in range(N):
if D[B[i]]==2:
for j in range(1,10**7):
if B[i]*j>=len(E):
break
else:
E[B[i]*j]=0
else:
if E[B[i]]!=0:
ANS+=1
for j in range(1,10**7):
if B[i]*j>=len(E):
break
else:
E[B[i]*j]=0
print(ANS)
| X=10**6+1
E=[1 for i in range(X)]
E[0]=0
N=int(eval(input()))
A=list(map(int,input().split()))
import copy
B=copy.deepcopy(A)
B.sort()
D={}
for i in range(N):
if A[i] not in D:
D[A[i]]=1
else:
D[A[i]]=2
ANS=0
for i in range(N):
if D[B[i]]==2 and E[B[i]]==1:
for j in range(1,10**7):
if B[i]*j>=len(E):
break
else:
E[B[i]*j]=0
elif D[B[i]]==2 and E[B[i]]==0:
continue
else:
if E[B[i]]!=0:
ANS+=1
for j in range(1,10**7):
if B[i]*j>=len(E):
break
else:
E[B[i]*j]=0
print(ANS)
| p02642 |
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
return lower_divisors + upper_divisors[:0:-1]
N = int(eval(input()))
As = list(map(int, input().split()))
st = set(As)
Fs = [0]*N
As.sort()
if N == 1:
print((1))
exit()
else:
rlt = 1
for i in range(1,N):
if As[i] == As[i-1]:
Fs[i] = 1
if Fs[i-1] == 0:
rlt -= 1
continue
ls = make_divisors(As[i])
for l in ls:
flag = 0
if l in st:
Fs[i] = 1
flag = 1
break
if flag == 0:
rlt += 1
print(rlt) | N = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
st = set(As)
m = As[-1]
rlt = 0
Fs = [1]*(m+1)
for i in range(N):
if i > 0 and As[i] == As[i-1]:
Fs[As[i]] = 0
continue
j = 2
while As[i]*j <= m:
Fs[As[i]*j] = 0
j += 1
for a in As:
rlt += Fs[a]
print(rlt) | p02642 |
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N = int(input())
A = list(map(int, input().split()))
maxA = max(A)
nums = set()
A.sort()
sA = list(set(A))
cnt = 0
ans = defaultdict(int)
for a in sA:
new = False
if not(a in nums):
cnt += 1
ans[a] += 1
new = True
nums.add(a)
# while new and a + mlt < maxA+2:
if new:
for val in range(a+a, maxA+2, a):
nums.add(val)
for an in ans.keys():
if A.count(an)>1:
cnt -= 1
print(cnt)
| #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N = int(input())
A = list(map(int, input().split()))
A.sort()
C = Counter(A)
S = set(A)
maxA = A[-1]
chk = [0] * (maxA+1)
for s in S:
for i in range(s, maxA+1, s):
chk[i] += 1
res = [s for s in S if chk[s] == 1 and C[s] == 1]
# print(res)
print(len(res))
| p02642 |
N = int(eval(input()))
nums = list(map(int, input().split()))
checked = [0 for _ in range(N)]
nums.sort()
answer = N
for i, num in enumerate(nums):
if checked[i] == 1:
continue
else:
if i == N-1:
break
same = False
for j in range(i+1, N):
if nums[j]%num == 0 and checked[j] == 0:
checked[j] = 1
answer -= 1
if nums[j] == num:
same = True
if same:
answer -= 1
print(answer) | N = int(eval(input()))
nums = list(map(int, input().split()))
nums.sort()
checked = [0 for _ in range(nums[-1]+1)]
answer = 0
for i in range(N-1):
if checked[nums[i]] == 1:
continue
else:
if nums[i] != nums[i+1]:
answer += 1
count = 1
temp = nums[i]
while(temp <= nums[-1]):
checked[temp] = 1
count += 1
temp= nums[i]*count
if checked[nums[-1]] == 0:
answer += 1
print(answer) | p02642 |
from math import sqrt
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i, val in enumerate(A):
curr_set = set(A[:i] + A[i+1:])
if val in curr_set:
continue
for j in range(1, int(sqrt(val)) + 1):
if (val % j == 0 and j in curr_set) or val / j in curr_set:
break
else:
ans += 1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
max_A = A[-1]
arr = [0] * (max_A + 1)
for val in A:
arr[val] += 1
if arr[val] == 1:
for j in range(2*val, max_A + 1, val):
arr[j] += 2
print((arr.count(1))) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
A.sort()
c= 0
if N>1:
if A[0]%A[1] >0:
count+=1
for k in range(1, len(A)):
if k<N-1:
if A[k] == A[k+1]:
continue
for j in range(c, k):
if A[k]%A[j] ==0:
del A[k]
A.insert(0, 0)
c +=1
break
else:
count +=1
#print(A[k])
if N ==1:
count = 1
print(count) | N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
A.sort()
c=0
"""
for k in range(len(A)-1):
if A[k] == A[k+1]:
del A[k]
A.insert(0,0)
c+=1
if k <len(A)-2:
if A[k+1] != A[k+2]:
del A[k+1]
A.insert(0,0)
c+=1
else:
del A[k+1]
A.insert(0,0)
c+=1
del A[:c]
if len(A)>0:
saidai = A[-1]
else:
saidai=0
#print(A)
"""
saidai = A[-1]
foo = [0 for k in range(saidai+1)]
for k in range(len(A)):
if foo[A[k]] == 1:
continue
else:
for j in range(A[k], saidai+1, A[k]):
foo[j] = 1
if k < len(A)-1:
if A[k] == A[k+1]:
continue
if 0 < k < len(A):
if A[k] == A[k-1]:
continue
count+=1
print(count) | p02642 |
n = int(eval(input()))
A = list(map(int, input().split()))
N = 10 ** 6 + 1
# 一度しか現れないものを抽出する
cnt = [0] * (N + 1)
for a in A:
cnt[a] += 1
once = []
for a in A:
if cnt[a] == 1:
once.append(a)
# 倍数を排除
bl = [True] * (N + 1)
A = list(set(A))
for elem in A:
for m in range(elem * 2, N + 1, elem):
bl[m] = False
res = 0
for elem in once:
if bl[elem]:
res += 1
print(res)
| n = int(eval(input()))
A = sorted(list(map(int, input().split())))
from collections import Counter
c = Counter(A)
MAX = 10 ** 6 + 1000
dp = [True] * MAX
for k, v in list(c.items()):
if dp[k] == False: continue
if v > 1: dp[k] = False
for x in range(k + k, MAX, k):
dp[x] = False
res = 0
for x in range(n):
if dp[A[x]]: res += 1
print(res) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
max_a = max(a)
b = [False] * (max_a + 1)
a.sort()
a = a + [0]
b[a[0]] = True
count = 0
for i in range(1, n):
flg = True
if b[a[i]]:
continue
for j in range(i - 1, -1, -1):
if a[i] % a[j] == 0 or a[i] == a[i+1]:
flg = False
b[a[i]] = True
k = 2
while k*a[i] < max_a:
b[k*a[i]] = True
k += 1
break
if flg:
count += 1
if a[0] != a[1]:
count += 1
print(count)
| n = int(eval(input()))
a = list(map(int, input().split()))
max_a = max(a)
b = [0] * (max_a + 1)
a.sort()
for i in a:
b[i] += 1
if b[i] == 1:
for j in range(2*i, max_a + 1, i):
b[j] += 2
print((b.count(1)))
| p02642 |
#!/usr/bin/env python3
import sys
def solve(N, A):
A = sorted(A)
dp = [True for i in range(N)] # Trueのものは、割り切れない（カウント対象）
for i, a in enumerate(A):
if dp[i] == False:
continue
elif A.count(a) > 1: # 同じ値が複数入っていたら、その値はカウント対象外
dp[i] = False
for j, target in enumerate(A[i + 1:]): # 探索対象の倍数を、リストから除外していく
if target % a == 0:
dp[i+j+1] = False
count = 0
for i in range(N):
if dp[i] == True:
count += 1
print(count)
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N, A):
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[p * q] = 0 # A[i]の倍数をすべて0にする
if A[i] != A[i + 1]:
ans += 1 # A[i]が重複していなければカウント
if dp[Amax] == 1: # 重複チェック時にレンジオーバーするためAmaxだけ別で判定
ans += 1
print(ans)
def solve_old(N, A):
A = sorted(A)
dp = [True for i in range(N)] # Trueのものは、割り切れない（カウント対象）
idx = 0
while True:
a = A[idx]
for j, target in enumerate(A[i+1:]):
if target % a == 0:
dp[idx + j + 1] = False
for i, a in enumerate(A):
if dp[i] == False:
continue
elif A.count(a) > 1: # 同じ値が複数入っていたら、その値はカウント対象外
dp[i] = False
continue
for j, target in enumerate(A[i + 1:]): # 探索対象の倍数を、リストから除外していく
if target % a == 0:
dp[i + j + 1] = False
count = 0
for i in range(N):
if dp[i] == True:
count += 1
print(count)
def solve_old(N, A):
A = sorted(A)
dp = [True for i in range(N)] # Trueのものは、割り切れない（カウント対象）
for i, a in enumerate(A):
if dp[i] == False:
continue
elif A.count(a) > 1: # 同じ値が複数入っていたら、その値はカウント対象外
dp[i] = False
continue
for j, target in enumerate(A[i + 1:]): # 探索対象の倍数を、リストから除外していく
if target % a == 0:
dp[i+j+1] = False
count = 0
for i in range(N):
if dp[i] == True:
count += 1
print(count)
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == '__main__':
main() | p02642 |
import sys
from collections import Counter
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
ansList = [1]*n
for i in range(n):
if ansList[i] == 1:
for j in range(i+1,n):
if a[i]%a[j] == 0:
ansList[i] = 0
if a[j]%a[i] == 0:
ansList[j] = 0
c = Counter(ansList)
print((c[1])) | # 解説を見て解きました。
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
# aの最大値+1(0を含むので)
m_a = a[-1]+1
# dp[i](aの最小値<=i<=aの最大値)が1の個数の合計が答え
dp = [0]*m_a
for i in a:
# dp[i]の初期値は0なので1を足す
dp[i] += 1
# dp[i]が2以上の時は列挙する必要がないのでパス
if dp[i] == 1:
# aの最大値までのiの倍数を列挙
for j in range(i*2, m_a, i):
# 倍数をはじくためにdp[j]を2以上にする
dp[j] += 2
print((dp.count(1))) | p02642 |
n=int(eval(input()))
a=list(map(int, input().split()))
a.sort()
dp = [True] * (max(a) + 1)
ans = 0
for i,num in enumerate(a):
if dp[num-1]:
j= 2 * num
while j <= max(a):
dp[j-1] = False
j += num
if not i+1==len(a):
if a[i]==a[i+1]:
dp[num-1] = False
for k in a:
if dp[k-1]:
ans += 1
#print(dp)
print(ans) | n=int(eval(input()))
a=list(map(int, input().split()))
a.sort()
dp = [True] * a[-1]
ans = 0
for i,num in enumerate(a):
if dp[num-1]:
j= 2 * num
while j <= a[-1]:
dp[j-1] = False
j += num
if not i+1==len(a):
if a[i]==a[i+1]:
dp[num-1] = False
for k in a:
if dp[k-1]:
ans += 1
#print(dp)
print(ans)
| p02642 |
n = int(eval(input()))
A = list(map(int,input().split()))
L = [0]*(10**6+1)
for a in A:
temp = a
while temp < 10**6+1:
L[temp] += 1
temp += a
ans = 0
for a in A:
if L[a] == 1:
ans += 1
print(ans)
| n = int(eval(input()))
A = list(map(int,input().split()))
A_max = max(A)
L = [0]*(A_max+1)
A.sort()
for a in A:
temp = a
while temp < A_max+1:
L[temp] += 1
temp += a
ans = 0
for a in A:
if L[a] == 1:
ans += 1
print(ans)
| p02642 |
from collections import Counter
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N, *A = list(map(int, read().split()))
t = Counter(A)
A.sort()
table = [True] * (A[-1] + 1)
n = len(table)
seen = set()
for a in A:
if a in seen:
continue
for i in range(2*a, n, a):
table[i] = False
seen.add(a)
ans = 0
for k, v in list(t.items()):
if v > 1:
continue
else:
if table[k]:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N,*A = list(map(int, read().split()))
A.sort()
table = [0] * (A[-1] + 1)
n = len(table)
for a in A:
if table[a] > 1:
continue
if table[a] == 0:
for i in range(2*a, n, a):
table[i] = 2
table[a] += 1
ans = 0
for a in A:
if table[a] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02642 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
def get_primes(n=10**3):
is_prime = [True]*(n+1)
is_prime[0] = 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
return [i for i in range(n+1) if is_prime[i]]
def prime_factor(n):
res = []
for i in range(2,int(n**0.5)+1):
while n%i==0: res.append(i); n //= i
if n != 1: res.append(n)
return res
#======================================================#
def main():
n = II()
aa = MII()
aa.sort()
lst = []
ans = []
while aa:
x = aa[0]
lst = []
flag=False
for a in aa[1:]:
if a%x!=0:
lst.append(a)
else:
if a==x:
flag=True
if not flag:
ans.append(x)
aa = lst
# print(ans)
print((len(ans)))
if __name__ == '__main__':
main() | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
#======================================================#
def main():
n = II()
aa = MII()
aa.sort()
maxa = aa[-1]
dp = [False]*(maxa+1)
for a in aa:
dp[a] = True
dup = set()
for a in aa:
if a in dup:
dp[a] = False
continue
else:
dup.add(a)
if dp[a]:
for j in range(a*2,maxa+1,a):
dp[j] = False
print((sum(1 for d in dp if d)))
if __name__ == '__main__':
main() | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
left = 0
right = n - 1
ans = 0
for i in range(n):
left = 0
right = n - 1
while left <= right:
if i == left == right:
left, right = left + 1, right - 1
continue
elif i == left:
if a[i] % a[right] == 0:
break
elif i == right:
if a[i] % a[left] == 0:
break
else:
if a[i] % a[left] == 0 or a[i] % a[right] == 0:
break
left, right = left + 1, right - 1
if left > right:
ans += 1
print(ans)
| n = int(eval(input()))
a = sorted(list(map(int, input().split())))
ans = 0
dp = [0] * (a[-1] + 1)
for i in range(n):
tmp = a[i]
while tmp <= a[-1]:
dp[tmp] += 1
tmp += a[i]
for i in a:
if dp[i] == 1:
ans += 1
print(ans)
| p02642 |
import functools
def f(l, d):
le = len(l)
if le == 0:
return []
elif le == 1:
if l[0] % d == 0:
return []
return l
m = functools.reduce(lambda x, y: x*y, l)
if m % d != 0:
return l
h = le//2
return f(l[:h], d) + f(l[h:], d)
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(key=lambda x: -x)
i = 0
p = []
while len(a) != 0:
i = a.pop()
if i in a:
a.pop()
while i in a:
a.pop()
continue
p.append(i)
a = f(a, i)
print((len(p))) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
mx = a[-1]
dp = [True for _ in range(mx)]
cnt = 0
for i, ai in enumerate(a):
if dp[ai-1]:
if i >= len(a)-1 or ai != a[i+1]:
cnt += 1
for j in range(ai - 1, mx, ai):
dp[j] = False
print(cnt) | p02642 |
import sys, collections
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def S(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def resolve():
N = I()
A = LI()
cnt = collections.Counter(A)
A = list(set(A))
A.sort()
A_max = A[-1]
divisible = [False] * (A_max + 1)
for i in A:
for j in range(2 * i, A_max+1, i):
divisible[j] = True
ans = 0
for i in A:
tmp = 0
if not divisible[i] and cnt[i] == 1:
tmp += 1
ans += tmp
print(ans)
if __name__ == '__main__':
resolve() | import sys, collections
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def S(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def resolve():
N = I()
A = LI()
cnt = collections.Counter(A)
A = list(set(A))
A.sort()
A_max = A[-1]
divisible = [False] * (A_max + 1)
for i in A:
for j in range(2 * i, A_max+1, i):
divisible[j] = True
ans = 0
for i in A:
if not divisible[i] and cnt[i] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
resolve() | p02642 |
import sys
from collections import Counter
input = lambda: sys.stdin.readline().rstrip()
MAX = 1000001
dp = [True for _ in range(MAX)]
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
cnt = Counter(a)
ans = 0
for v in a:
if cnt[v] <= 1 and dp[v]:
ans += 1
m = v
while m < MAX:
dp[m] = False
m += v
print(ans) | import sys
from collections import Counter
input = lambda: sys.stdin.readline().rstrip()
MAX = 1000001
dp = [True for _ in range(MAX)]
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = Counter(a)
a = sorted(list(set(a)))
ans = 0
for v in a:
if cnt[v] <= 1 and dp[v]:
ans += 1
m = v
while m < MAX:
dp[m] = False
m += v
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
res = 0
cnt = [False] * a[-1]
for i in range(n):
j = 1
while j * j <= a[i]:
if a[i] % j == 0 and (cnt[j-1] or cnt[a[i]//j-1]):
res += 1
break
j += 1
if j * j > a[i] and i + 1 < n and a[i] == a[i+1]:
res += 1
cnt[a[i]-1] = True
print((n - res)) | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
used = [False] * a[-1]
res = 0
for i in range(n):
if used[a[i]-1]:
continue
if i == n - 1 or a[i] != a[i+1]:
res += 1
for j in range(a[i], a[-1]+1, a[i]):
used[j-1] = True
print(res) | p02642 |
n = int(eval(input()))
A = [int(x) for x in input().split()]
A.sort()
ans = 0
for i, a in enumerate(A):
if i != n - 1 and A[i + 1] == a:
continue
do_count = True
for j in range(i):
b = A[j]
if a % b == 0:
do_count = False
break
if do_count:
ans += 1
print(ans)
| n = int(eval(input()))
A = [int(x) for x in input().split()]
A.sort()
lim = A[-1]
se = [True for i in range(lim + 1)]
ans = 0
for i, a in enumerate(A):
if se[a]:
if not((i != n - 1 and A[i + 1] == a) or (i != 0 and A[i - 1] == a)):
ans += 1
tmp = a
while not tmp > lim:
se[tmp] = False
tmp += a
print(ans)
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
T = [1] * N
for i in range(N):
if T[i] == 1:
for j in range(N):
if i != j:
if A[i] == A[j]:
T[i] = 0
if T[j] == 1 and A[j] % A[i] == 0:
T[j] = 0
print((sum(T))) | N = int(eval(input()))
A = list(map(int, input().split()))
M = max(A)
num = [0] * (M)
T = [0] * (M)
for a in A:
num[a-1] += 1
T[a-1] = 1
for i in range(M):
if num[i] != 0 and T[i] == 1:
n = 2 * (i + 1)
while n <= M:
T[n-1] = 0
n += (i + 1)
ans = 0
for i in range(M):
if T[i] == 1 and num[i] == 1:
ans += 1
print(ans) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
res = 0
while A:
if len(A) == 1:
res += 1
else:
if A[0] != A[1]:
res += 1
t = A[0]
NA = []
for a in A:
if a % t != 0:
NA.append(a)
A = NA[:]
print(res)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
MA = max(A)
dp = [True for _ in range(MA+1)]
flag = [False for _ in range(MA+1)]
for i in range(N):
a = A[i]
if not flag[a]:
flag[a] = True
t = a*2
while t <= MA:
dp[t] = False
t += a
elif flag[a] == 1:
dp[a] = False
res = 0
for a in A:
if dp[a]:
res += 1
print(res)
| p02642 |
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
return lower_divisors + upper_divisors[::-1]
N = int(eval(input()))
A = list(map(int, input().split()))
setA = set(A)
dup = set([x for x in setA if A.count(x) > 1])
count = 0
for i in range(len(A)):
flag = False
if A[i] in dup:
continue
for div in make_divisors(A[i]):
if div == A[i]:
continue
elif div in setA:
flag = True
break
if not flag:
count += 1
print(count)
| # エラトステネスの篩
N = int(eval(input()))
A = sorted(map(int, input().split()))
maxA = A[N - 1]
dp = [0] * (maxA + 1)
for i in range(len(A)):
cursor = A[i]
while cursor <= maxA:
dp[cursor] += 1
cursor += A[i]
ans = 0
for a in A:
if dp[a] == 1:
ans += 1
print(ans)
| p02642 |
n = int(eval(input()))
l = sorted(list(map(int,input().split())))
num = max(l)+1
rcd = [0 for _ in range(num)]
for i in range(1, num):
for j in l:
if i % j == 0:
rcd[i] += 1
if rcd[i] >= 2:
break
else:
continue
ans = 0
for k in l:
if rcd[k] == 1:
ans += 1
print(ans) | n = int(eval(input()))
l = list(map(int,input().split()))
num = max(l)+1
rcd = [0 for _ in range(num)]
for v in l:
rcd[v] += 1
unq = []
for w in range(num):
if rcd[w] == 1:
unq.append(w)
#print(unq)
rcd = [0 for _ in range(num)]
l = set(l)
for x in l:
for y in range(2*x, num, x):
rcd[y] = 1
#print(rcd)
ans = 0
for z in unq:
if rcd[z] == 0:
ans += 1
print(ans)
| p02642 |
n = int(eval(input()))
l = list(map(int,input().split()))
num = max(l)+1
rcd = [0 for _ in range(num)]
for v in l:
rcd[v] += 1
unq = []
for w in range(num):
if rcd[w] == 1:
unq.append(w)
#print(unq)
rcd = [0 for _ in range(num)]
l = set(l)
for x in l:
for y in range(2*x, num, x):
rcd[y] = 1
#print(rcd)
ans = 0
for z in unq:
if rcd[z] == 0:
ans += 1
print(ans)
| # '重複する要素があると条件から逸脱する' と '他の要素が約数になると条件から逸脱する'
# 上記2つの問題を 前半と後半に分けて処理する、
n = int(eval(input()))
l = list(map(int,input().split()))
# 重複問題
num = max(l)+1
rcd = [0 for _ in range(num)] # indexを数列Aと読み替え可能な配列として初期化
for v in l: # 重複する配列を区別するため各要素数をカウントして...
rcd[v] += 1
unq = []
for w in range(num): # 重複がない要素のみ'unq'に集約
if rcd[w] == 1: # 1個の場合のみが該当
unq.append(w)
#print(unq)
# 約数問題
rcd = [0 for _ in range(num)] # 再度初期化
l = set(l) # ここでは重複を考慮しないため集合化
for x in l: # 自身以外の約数の有無を確認するためのループ
for y in range(2*x, num, x): # ※自身を約数としてカウントしない工夫！
rcd[y] = 1 # 自身以外の約数がある場合は'1'が代入される
#print(rcd)
# まとめ
ans = 0
for z in unq: # 'unq'の中で...
if rcd[z] == 0: # 自身以外に約数を持たない要素のみを...
ans += 1 # カウント
print(ans)
| p02642 |
from sys import stdin, stdout
int_in = lambda: int(stdin.buffer.readline())
arr_in = lambda: [int(x) for x in stdin.buffer.readline().split()]
out = lambda o: stdout.write("{}\n".format(o))
def divisors(n, items_in_a):
i = 2
result = set()
while i * i <= n:
if n % i == 0:
opp = n // i
if i in items_in_a or opp in items_in_a:
return [n] # short circuit hack
result.add(i)
result.add(opp)
i += 1
return result
def solve(n, a):
counts = {}
for item in a:
if item not in counts:
counts[item] = 0
counts[item] += 1
if 1 in counts:
return 1 if counts[1] == 1 else 0
items_in_a = set(a)
result = 0
for item in a:
if counts[item] == 1:
d = divisors(item, items_in_a)
if len(items_in_a.intersection(d)) == 0:
result += 1
return result
if __name__ == "__main__":
n = int_in()
a = arr_in()
out(solve(n, a)) | from math import sqrt
from sys import stdin, stdout
out = lambda o: stdout.write("{}\n".format(o))
def solve(a):
a.sort()
size = a[-1] + 1
seive = [1] * size
seen = set()
for item in a:
if item in seen:
seive[item] = 0
seen.add(item)
for item in a:
for j in range(2 * item, size, item):
seive[j] = 0
return sum([seive[x] for x in a])
if __name__ == "__main__":
n = int(stdin.buffer.readline())
a = [int(x) for x in stdin.buffer.readline().split()]
out(solve(a)) | p02642 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
a_list.sort()
a_max = a_list[-1]
dup_set = set(x for x in set(a_list) if a_list.count(x) > 1)
divisible = [False] * (a_max + 1)
count = 0
i = 0
for a in a_list:
if divisible[a]:
continue
if not a in dup_set:
count += 1
x = a
while x <= a_max:
divisible[x] = True
x += a
print(count) | n = int(eval(input()))
a_list = list(map(int, input().split()))
a_list.sort()
a_max = a_list[-1]
divisible = [False] * (a_max + 1)
count = 0
i = 0
for i in range(n):
if divisible[a_list[i]]:
continue
if i < n - 1 and a_list[i] == a_list[i + 1]:
while i < n - 1 and a_list[i] == a_list[i + 1]:
i += 1
else:
count += 1
x = a_list[i]
while x <= a_max:
divisible[x] = True
x += a_list[i]
print(count) | p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = Counter(A)
A = list(set(A))
A.sort()
C = [0]*(10**6+1)
ans = 0
for a in A:
if cnt[a] == 1 and C[a] == 0:
ans += 1
i = 1
while True:
if a*i > 10**6:
break
C[a*i] = 1
i += 1
print(ans) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = Counter(A)
A = list(set(A))
A.sort()
C = [0]*(10**6+1)
ans = 0
for a in A:
if C[a] == 0:
i = 1
while True:
if a*i > 10**6:
break
C[a*i] = 1
i += 1
if cnt[a] == 1:
ans += 1
print(ans) | p02642 |
# Contest No.: ABC170
# Problem No.: D
# Solver: JEMINI
# Date: 20200614
import sys
import heapq
def main():
n = int(eval(input()))
nums = list(map(int, sys.stdin.readline().split()))
nums.sort()
check = [False] * (10 ** 6 + 1)
for i in range(1, n):
if nums[i] == nums[i - 1]:
check[nums[i]] = True
ans = 0
for i in range(n):
if check[nums[i]] == False:
ans += 1
cnt = nums[i] * 2
while cnt < 10 ** 6 + 1:
check[cnt] = True
cnt += nums[i]
print(ans)
return
if __name__ == "__main__":
main() | # Contest No.: ABC170
# Problem No.: D
# Solver: JEMINI
# Date: 20200614
import sys
import heapq
def main():
n = int(eval(input()))
nums = list(map(int, sys.stdin.readline().split()))
nums.sort()
check = [False] * (10 ** 6 + 1)
for i in range(1, n):
if nums[i] == nums[i - 1]:
check[nums[i]] = True
#print(nums)
ans = 0
for i in range(n):
if check[nums[i]] == False:
ans += 1
if i == 0 or (i > 0 and nums[i] != nums[i - 1]):
cnt = nums[i] * 2
while cnt < 10 ** 6 + 1:
#print(cnt)
check[cnt] = True
cnt += nums[i]
#print(ans)
print(ans)
return
if __name__ == "__main__":
main() | p02642 |
def main():
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from collections import Counter
n = int(readline())
a = list(map(int, readline().split()))
memo = [True] * (10 ** 6 + 1)
ans = 0
for k, v in sorted(Counter(a).items()):
if v == 1 and memo[k]:
ans += 1
memo[k] = False
for i in range(1, 10 ** 6 + 1):
if 10 ** 6 + 1 <= i * k:
break
memo[i * k] = False
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = list(map(int, readline().split()))
a.sort()
limit = a[-1]
dp = [0] * (limit + 1)
for aa in a:
dp[aa] += 1
if dp[aa] == 1:
for i in range(aa * 2, limit + 1, aa):
dp[i] += 1
print((sum((1 for aa in a if dp[aa] == 1))))
if __name__ == '__main__':
main()
| p02642 |
def main():
N=int(eval(input()))
D=[0]*(10**6+1)
for a in sorted(map(int,input().split())):
if D[a]==0:
D[a]=1
for i in range(2*a,10**6+1,a):
D[i]=-1
else:
D[a]=-1
print((D.count(1)))
main()
| def main():
N=int(eval(input()))
D=[0]*(10**6+1)
A=sorted(map(int,input().split()))
m=max(A)+1
for a in A:
if D[a]==0:
D[a]=1
for i in range(2*a,m,a):
D[i]=-1
else:
D[a]=-1
print((D.count(1)))
main()
| p02642 |
from collections import Counter
N = int(eval(input()))
numbers = [int(i) for i in input().split()]
c = Counter(numbers)
divisors = sorted(set(numbers))
target_numbers = sorted([k for k, v in list(c.items()) if v == 1])
cnt = N - len(target_numbers)
for n in target_numbers:
for d in divisors:
if n == d:
continue
if n % d == 0:
cnt += 1
break
if n /2 < d:
break
print((N - cnt)) | N = int(eval(input()))
numbers = [int(i) for i in input().split()]
d = set()
s = set()
for n in numbers:
if n in s:
d.add(n)
else :
s.add(n)
M = max(s)
X = [1 for _ in range(M+1)]
for a in s:
if a in d:
X[a] = 0
for i in range(2*a, M+1, a):
X[i] = 0
output = 0
for n in numbers:
if X[n] == 1:
output += 1
print(output) | p02642 |
import sys
n=int(eval(input()))
a=list(map(int,input().split()))
if n==1:
print((1))
sys.exit()
"""
def fsort(a,max):
n=len(a)
f=[0]*(max+1)
b=[0]*n
for i in range(n):
f[a[i]]+=1
for i in range(1, max+1):
f[i]+=f[i-1]
for i in range(n-1,-1,-1):
f[a[i]]-=1; b[f[a[i]]]=a[i]
for i in range(n):
a[i]=b[i]
fsort(a, 10**6)
"""
def quicksort(a, left: int, right: int):
#a[left]〜a[right]をクイックソート
pl=left
pr=right
pivot= a[(left +right)//2]
#print(f'a[{left}]~a[{right}] : ', *a[left : right +1])
while pl<=pr:
while a[pl] <pivot: pl+=1
while a[pr] >pivot: pr-=1
if pl <= pr:
a[pl], a[pr]= a[pr], a[pl]
pl+=1
pr-=1
if left < pr: quicksort(a, left, pr)
if pl < right: quicksort(a, pl, right)
def quick_sort(a):
quicksort(a, 0, len(a)-1)
quick_sort(a)
if a[0]==1:
if a[1]==1:
print((0))
sys.exit()
else:
print((1))
sys.exit()
if a[0]==a[1]:
count=0
else:
count=1
for i in range(n-2):
if a[i+2]==a[i+1]:
continue
if a[i+1]==a[i]:
continue
for l in range(i+1):
if a[i+1]%a[l]==0:
break
if i==l:
count+=1
if a[n-1]!=a[n-2]:
for i in range(n):
if a[n-1]%a[i]==0:
break
if i==n-2:
count+=1
print(count) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
amx=max(a)+1
l=[True]*amx
ans=0
for i in range(n-1):
if l[a[i]]:
for j in range(a[i],amx,a[i]):
l[j]=False
if a[i]<a[i+1]:
ans+=1
if l[-1]:
ans+=1
print(ans) | p02642 |
### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def resolve():
readline=sys.stdin.readline
n=int(readline())
arr=list(map(int, readline().rstrip().split()))
arr.sort()
tb=[False]*(10**6 + 10)
ans=0
for i in range(n):
flg=0
x=arr[i]
if tb[x]==False:
flg=1
if i < (n-1):
if arr[i]==arr[i+1]:
flg=0
ans+=flg
for j in range(x,10**6+5,x):
tb[j]=True
print(ans)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ---------------- | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
import collections
def resolve():
readline=sys.stdin.readline
n=int(readline())
arr=list(map(int, readline().rstrip().split()))
c=collections.Counter(arr)
tb=[False]*(10**6 + 10)
ans=0
for x in list(c.keys()):
for j in range(x*2,10**6+5,x):
tb[j]=True
for x in list(c.keys()):
if tb[x]==0 and c[x]==1:
ans+=1
print(ans)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ---------------- | p02642 |
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
num_tmp = [0]*(A[-1]+1)
for a in A:
num_tmp[a] += 1
if num_tmp[a] == 1:
for i in range(2*a,max(A)+1,a):
num_tmp[i] = 2
print((num_tmp.count(1)))
main() | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
MAX = A[-1]+1
num_tmp = [0]*MAX
for a in A:
num_tmp[a] += 1
if num_tmp[a] == 1:
for i in range(2*a,MAX,a):
num_tmp[i] = 2
print((num_tmp.count(1)))
main() | p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
d={}
for a in A:
if a in d:
d[a]+=1
else:
d[a]=1
if 1 in d:
if d[1]==1:
ans=1
else:
ans=0
else:
ans=0
m=min(A)
for i in d:
if d[i]>1 or (i!=m and i%m==0):
continue
p=1
for j in range(2,int(i**0.5)+1):
if i%j==0:
if j in d or i//j in d:
p=0
break
ans+=p
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort(reverse=True)
M=max(A)+1
table=[0 for _ in range(M)]
for i in range(N):
if i>0 and A[i]==A[i-1]:
table[A[i]]=0
continue
table[A[i]]=1
for n in range(2,M):
if A[i]*n>=M:
break
table[A[i]*n]=0
print((sum(table))) | p02642 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
A = LI()
y = [0] * (10**6 + 1)
for i in range(N):
y[A[i]] += 1
ans = 0
for i in range(N):
x = A[i]
if x > 1:
if y[1] : continue
if y[x] > 1: continue
f = 1
for j in range(2,int(math.sqrt(x))+1):
if x % j == 0 and (y[j] or y[x//j]):
f = 0
break
ans += f
print(ans)
if __name__ == '__main__':
main()
| import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
y = [0] * (10**6 + 1)
A = []
for x in sys.stdin.readline().split():
x = int(x)
A.append(x)
y[x] += 1
ans = 0
for i in range(N):
x = A[i]
if x > 1:
if y[1] : continue
if y[x] > 1: continue
f = 1
for j in range(2,int(math.sqrt(x))+1):
if x % j == 0 and (y[j] or y[x//j]):
f = 0
break
ans += f
print(ans)
if __name__ == '__main__':
main()
| p02642 |
from bisect import bisect_left, bisect_right
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
B = set(A)
for a in B:
flag = False
left = bisect_left(A, a)
right = bisect_right(A, a)
if right-left > 1:
continue
divs = make_divisors(a)
for d in divs:
if d in B and d != a:
flag = True
break
if flag == False:
ans += 1
print(ans)
if __name__ == "__main__":
main() | def solve(A):
n = A[-1]
is_nodiv = [True for _ in range(n+1)]
pre = 0
for a in A:
if pre == a or not is_nodiv[a]:
is_nodiv[a] = False
continue
for j in range(2*a, n+1, a):
is_nodiv[j] = False
pre = a
return sum([is_nodiv[a] for a in A])
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = solve(A)
print(ans)
if __name__ == "__main__":
main()
| p02642 |
def solve(A):
n = A[-1]
is_nodiv = [True for _ in range(n+1)]
pre = 0
for a in A:
if pre == a or not is_nodiv[a]:
is_nodiv[a] = False
continue
for j in range(2*a, n+1, a):
is_nodiv[j] = False
pre = a
return sum([is_nodiv[a] for a in A])
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = solve(A)
print(ans)
if __name__ == "__main__":
main()
| def solve(A):
n = A[-1]
is_nodiv = [True] * (n+1)
pre = 0
for a in A:
if pre == a or not is_nodiv[a]:
is_nodiv[a] = False
continue
for j in range(2*a, n+1, a):
is_nodiv[j] = False
pre = a
return sum([is_nodiv[a] for a in A])
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = solve(A)
print(ans)
if __name__ == "__main__":
main()
| p02642 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
from collections import deque
N = int(eval(input()))
a = [int(y) for y in input().split()]
a.sort()
q = deque()
for i in range(N):
q.append(a[i])
cnt = 0
while N > 0:
flag = True
res = q.popleft()
for i in range(N-1):
now = q.popleft()
if now == res and flag:
cnt -= 1
flag = False
if now % res != 0:
q.append(now)
N = len(q)
cnt += 1
print(cnt) | 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
for i in a:
ans += flag[i]
print(ans) | p02642 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.