Submission #22158748

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
import collections
N = int(input())
A = list(map(int, input().split())) 
CA = collections.Counter(A)
A.sort()
ma = A[-1]#Aの最大値
S = [True]*(ma+1)
cnt = 0
for a in A:
    if not S[a]:
        continue
    for i in range(a*2,ma+1,a):
        S[i]=False
    if CA[a]>=2:
        S[a]=False
    cnt+=S[a]
print(cnt)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import collections
N = int(input())
A = list(map(int, input().split())) 
CA = collections.Counter(A)
A.sort()
ma = A[-1]#Aの最大値
S = [True]*(ma+1)
cnt = 0
for a in A:
    if not S[a]:
        continue
    for i in range(a*2,ma+1,a):
        S[i]=False
    if CA[a]>=2:
        S[a]=False
    cnt+=S[a]
print(cnt)

Submission Info

Judge Result