input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = [int(hoge) for hoge in input().split()]
A.sort()
dp = [False] * (max(A) + 1)
ans = 0
prev = -1
for a in A:
if dp[a] == False:
for j in range(2,1 + (max(A) // a)):
dp[a*j] = True
if a != prev:
ans += 1
else:
dp[a] = True
ans -= 1
prev = a
print(ans) | N = int(eval(input()))
A = [int(hoge) for hoge in input().split()]
A.sort()
M = max(A)
dp = [False] * (M+ 1)
ans = 0
prev = -1
for a in A:
if dp[a] == False:
for j in range(2,1 + (M// a)):
dp[a*j] = True
if a != prev:
ans += 1
else:
dp[a] = True
ans -= 1
prev = a
print(ans) | p02642 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
M = 10**6+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans) | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list)+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans)
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 0
while len(a) >= 1:
ans += 1
temp=a.pop(0)
if len(a) >= 1:
if a[0] == temp:
ans -= 1
a = list([x for x in a if x % temp != 0])
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
dp = [0]*a[n-1]
ans = 0
temp2 = 0
for i in range(n):
if temp2 == a[i]:
ans -= 1
temp2=0
if dp[a[i]-1] == 0:
ans += 1
temp = a[i]
temp2 = a[i]
while temp <= a[n-1]:
dp[temp-1] = 1
temp = temp+a[i]
#print(dp)
print(ans) | p02642 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
A = LIST()
def primes_for(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
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]]
ans = 0
lim = 10**6+1
ok = [True]*lim
for a in sorted(A):
for j in range(a*2, lim, a):
ok[j] = False
cnt = Counter(A)
for a in A:
if cnt[a] == 1 and ok[a]:
ans += 1
print(ans)
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
A = LIST()
ans = 0
lim = max(A)+1
ok = [True]*lim
checked = [False]*lim
for a in sorted(A):
if (not checked[a]) and ok[a]:
checked[a] = True
for j in range(a*2, lim, a):
ok[j] = False
cnt = Counter(A)
for a in A:
if cnt[a] == 1 and ok[a]:
ans += 1
print(ans)
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = [0]*(max(A) + 5)
for i in A:
ans[i] += 1
if ans[i] == 1:
for j in range(i*2, max(A) + 5, i):
ans[j] = 2
print((ans.count(1))) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
max_A = A[-1] + 1
ans = [0]*max_A
for i in A:
ans[i] += 1
if ans[i] == 1:
for j in range(i*2, max_A, i):
ans[j] = 2
print((ans.count(1))) | p02642 |
n = int(eval(input()))
a = list(map(int,input().split()))
t = []
for i in range(1000):
t.append([])
for i in range(n):
j = a[i]//1024
t[j].append(a[i])
#print(t)
p = n
for i in range(len(t[0])):
for j in range(len(t[0])):
if(i != j):
if(t[0][i] % t[0][j] == 0):
p -= 1
#print(t[0][i],t[0][j])
break
for i in range(1,1000):
for j in range(len(t[i])):
x = 0
for k in range(len(t[i])):
if(j != k):
if(t[i][j] == t[i][k]):
p -= 1
#print(t[i][j],t[i][k],-1)
x = 1
break
if(x == 0):
for k in range((i+2)//2):
for l in range(len(t[k])):
if(t[i][j] % t[k][l] == 0):
p -= 1
#print(t[i][j],t[k][l])
x = 1
break
if(x == 1):
break
print(p) | n = int(eval(input()))
a = list(map(int,input().split()))
m = max(a)
t = [1]*(m+1)
for i in range(n):
if(t[a[i]] == 1):
x = a[i]*2
while(x <= m):
t[x] = 0
x += a[i]
for i in range(n):
if(t[a[i]] == 0):
n -= 1
elif(t[a[i]] == 1):
t[a[i]] = -1
elif(t[a[i]] == -1):
t[a[i]] = -2
n -= 2
else:
n -= 1
print(n) | p02642 |
N = int(eval(input()))
Alist = list(map(int,input().split(" ")))
ansList = list(range(N))
count = 0
for i in range(N):
flag = False
for j in range(N):
if i != j:
if (Alist[i]%Alist[j]==0):
flag = True
if flag==False:
count+=1
print(count) | N = int(eval(input()))
Alist = list(map(int,input().split(" ")))
Alist.sort()
Amax = Alist[-1]
dp = [1]*(Amax+1)
count = 0
for i in range(len(Alist)-1):
p = Alist[i]
if dp[p] == 1:
for j in range(Amax//p+1):
dp[p*j] = 0
if Alist[i] != Alist[i+1]:
count+=1
if dp[Amax] == 1:
count += 1
print(count) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
countList = [0]*(10**6 + 1)
answer = 0
# Aにnがm個あるときcountList[n] = m
for i in A:
countList[i] += 1
for j in range(10**6 + 1):
# Aにjが含まれていれば、jの倍数をすべてcountListから除外
# jの倍数pはjで割り切れるので除外可能
# pの倍数qはjでも割り切れるのでjの時の処理によって除外される
if countList[j] > 0:
for k in range(2 * j, 10**6 + 1, j):
countList[k] = 0
# jが2個以上ある場合にはそれを正解としてカウントしない
if countList[j] == 1:
answer += 1
print(answer) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
minNum = A[0]
maxNum = A[N - 1]
countList = [0]*(10**6 + 1)
answer = 0
# Aにnがm個あるときcountList[n] = m
for i in A:
countList[i] += 1
for j in range(minNum, maxNum + 1):
# Aにjが含まれていれば、jの倍数をすべてcountListから除外
# jの倍数pはjで割り切れるので除外可能
# pの倍数qはjでも割り切れるのでjの時の処理によって除外される
if countList[j] > 0:
for k in range(2 * j, 10**6 + 1, j):
countList[k] = 0
# jが2個以上ある場合にはそれを正解としてカウントしない
if countList[j] == 1:
answer += 1
print(answer) | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
minNum = A[0]
maxNum = A[N - 1]
countList = [0]*(10**6 + 1)
answer = 0
# Aにnがm個あるときcountList[n] = m
for i in A:
countList[i] += 1
for j in range(minNum, maxNum + 1):
# Aにjが含まれていれば、jの倍数をすべてcountListから除外
# jの倍数pはjで割り切れるので除外可能
# pの倍数qはjでも割り切れるのでjの時の処理によって除外される
if countList[j] > 0:
for k in range(2 * j, 10**6 + 1, j):
countList[k] = 0
# jが2個以上ある場合にはそれを正解としてカウントしない
if countList[j] == 1:
answer += 1
print(answer) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
minNum = A[0]
maxNum = A[N - 1]
countList = [0]*(10**6 + 1)
answer = 0
# Aにnがm個あるときcountList[n] = m
for i in A:
countList[i] += 1
for j in range(minNum, maxNum + 1):
# Aにjが含まれていれば、jの倍数をすべてcountListから除外
# jの倍数pはjで割り切れるので除外可能
# pの倍数qはjでも割り切れるのでjの時の処理によって除外される
if countList[j] > 0:
for k in range(2 * j, maxNum + 1, j):
countList[k] = 0
# jが2個以上ある場合にはそれを正解としてカウントしない
if countList[j] == 1:
answer += 1
print(answer) | p02642 |
from sys import stdin
input = stdin.readline
n = int(eval(input()))
a = [int(x) for x in input().split()]
b = [0] * 1000001
for x in a:
for y in range(x, 1000001, x):
b[y] += 1
cnt = 0
for x in a:
if b[x] == 1:
cnt += 1
print(cnt) | from sys import stdin
input = stdin.readline
n = int(eval(input()))
a = [int(x) for x in input().split()]
b = [0] * 1000001
chk = [0] * 1000001
s = set(a)
for x in a:
chk[x] += 1
for x in s:
for y in range(x, 1000001, x):
b[y] += 1
cnt = 0
for x in s:
if b[x] == 1 and chk[x] == 1:
cnt += 1
print(cnt) | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
p = [True] * (10 ** 6 + 1)
s = list(set(a))
for x in s:
t = x * 2
while t <= 10 ** 6:
p[t] = False
t += x
ans = 0
for x in a:
if c[x] == 1 and p[x] == True:
ans += 1
print(ans) | #Ai/Aj not integer
#5
#24 11 8 3 16
#のときは、24は8,3があるからダメ 16も8があるからダメ
N=int(eval(input()))
A=[int(i) for i in input().split()]
D=set()
S=set()
for i in range(N):
if A[i] in S:
D.add(A[i])
else:
S.add(A[i])
M=max(S)
X=[1 for i 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
ans=0
for i in range(N):
if X[A[i]]==1:
ans+=1
print(ans)
| p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
num = [0]*(10**6 + 1)
for i in range(n):
for j in range(1, 10**6//a[i]+1):
num[a[i]*j] += 1
ans = 0
for i in range(n):
if num[a[i]] < 2:
ans += 1
# print(num[:30])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
num = [0]*(10**6+1)
for x in a:
if num[x] != 0:
num[x] = 2
continue
for i in range(x, 10**6+1, x):
num[i] += 1
ans = 0
for x in a:
if num[x] == 1:
ans += 1
print(ans) | p02642 |
import sys
# x,y = map(int,input().split())
n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a)
ans = 0
M = 1000005
cnt = [0 for _ in range(M)]
for x in a:
for j in range(x,M,x):
cnt[j] += 1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a)
ans = 0
M = 1000005
cnt = [0 for _ in range(M)]
mx = max(a)+1
for x in a:
for j in range(x,mx,x):
cnt[j] += 1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans)
| p02642 |
from collections import defaultdict
N = int(eval(input()))
a = list(map(int, input().split()))
anstable = [0] * (10 ** 6 + 1)
d = defaultdict(int)
for i in a:
d[i] += 1
u = []
for i, v in list(d.items()):
if v == 1:
u.append(i)
for i in a:
for j in range(i * 2, 10 ** 6 + 1, i):
anstable[j] += 1
cnt = 0
for i in u:
if anstable[i] == 0:
cnt += 1
print(cnt) | from collections import defaultdict
N = int(eval(input()))
a = list(map(int, input().split()))
anstable = [0] * (10 ** 6 + 1)
d = defaultdict(int)
for i in a:
d[i] += 1
u = []
for i, v in list(d.items()):
if v == 1:
u.append(i)
a = set(a)
for i in a:
for j in range(i * 2, 10 ** 6 + 1, i):
anstable[j] += 1
cnt = 0
for i in u:
if anstable[i] == 0:
cnt += 1
print(cnt) | p02642 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
B = [True]*(10**6+1)
from collections import Counter
c = Counter(A)
bl = set()
for k, v in list(c.items()):
if v >= 2:
bl.add(k)
ans = 0
for a in A:
if a not in bl and B[a]:
ans += 1
for i in range(1, 10**6):
if 10**6 < a*i:
break
B[a*i] = False
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
B = [True]*(10**6+1)
from collections import Counter
c = Counter(A)
bl = set()
for k, v in list(c.items()):
if v >= 2:
bl.add(k)
ans = 0
for a in set(A):
if a not in bl and B[a]:
ans += 1
for i in range(1, 10**6):
if 10**6 < a*i:
break
B[a*i] = False
print(ans)
if __name__ == '__main__':
main()
| p02642 |
def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
from collections import Counter
c = Counter(A)
for a in set(A):
v = 2*a
while v <= 10**6:
c[v] += 1
v += a
ans = 0
for a in A:
if c[a] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0]*(10**6+1)
for a in A:
B[a] += 1
for a in set(A):
v = 2*a
while v <= 10**6:
B[v] += 1
v += a
ans = 0
for a in A:
if B[a] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02642 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
if n == 1:
print((1))
exit()
num = 1
count = 1
for i in range(1,n):
for j in range(num):
if i+1 < n and a[i] == a[i+1]:
count -= 1
break
if a[i] % a[j]== 0:
count -= 1
break
num += 1
count += 1
if a[0] == a[1]:
count -= 1
print(count)
| n = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
if n == 1:
print((1))
exit()
ans = [1] * (a[n-1]+1)
for i in range(n):
if i >= 1 and a[i] == a[i-1]:
ans[a[i]] = 0
else:
j = 2
while j*a[i] <= a[n-1]:
ans[j*a[i]] = 0
j += 1
sum = 0
for i in range(n):
sum += ans[a[i]]
print(sum)
| p02642 |
#dame datta....
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
a = Counter(A)
l = [0] * (10**6+1)
for i in A:
t = 2*i
while t < 10**6 + 1:
l[t] = 1
t += i
r = 0
for i in A:
if l[i] == 0 and a[i] == 1:
r += 1
return r
print((main()))
| #dame datta....
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = sorted(A)
a = Counter(A)
l = [0] * (10**6+1)
v = [0] * (10**6+1)
for i in B:
if v[i] == 1 or l[i] == 1:
continue
else:
v[i] = 1
t = 2*i
while t < 10**6 + 1:
l[t] = 1
t += i
r = 0
for i in A:
if l[i] == 0 and a[i] == 1:
r += 1
return r
print((main()))
| p02642 |
from collections import Counter
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = Counter(A)
A.sort()
ans = 0
MX = 10**6
P = [0] * (MX+1)
for a in A:
if P[a]==0:
for i in range(MX+1):
x = a*i
if x > MX:
break
P[x] = 1
if cnt[a]==1:
ans+=1
print (ans) | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
from collections import Counter
cnt = Counter(a)
lim = max(a) + 1
tmp = [0] * (lim)
# set_a = list(set(a))
# set_a.sort()
a.sort()
for aa in a:
if tmp[aa] == 0:
for j in range(lim):
if aa * j > lim-1:
break
tmp[aa*j] = 1
if cnt[aa] == 1:
# print(aa, ans)
ans += 1
print(ans)
if __name__=='__main__':
main()
| p02642 |
n = int(eval(input()))
*a, = list(map(int, input().split()))
dp = [False] * n
for i in range(n):
for j in range(n):
if (i != j) and (a[i] % a[j] == 0):
break
else:
dp[i] = True
print((dp.count(True))) | n = int(eval(input()))
*a, = sorted(map(int, input().split()))
a_max = a[n-1]
dp = [True] * a_max
ans = 0
recent = 0
if n == 1:
print((1))
exit()
for i in a:
if recent == i:
ans -= 1
recent = 0
if dp[i-1] == False:
continue
else:
for j in range(i, a_max+1, i):
dp[j-1] = False
ans += 1
recent = i
print(ans) | p02642 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def eratosthenes(n):
p = []
t = [True] * n
for i in range(2, int(math.ceil(math.sqrt(n)))):
if t[i]:
p.append(i)
for j in range(2*i, n, i):
t[j] = False
for j in range(i+1, n):
if t[j]:
p.append(j)
return p, t
P, T = eratosthenes(int(math.sqrt(10**6))+1)
def e(n):
c = []
for p in P:
while n % p == 0:
# c[p] += 1
c.append(p)
n //= p
if n == 1:
break
if n != 1:
# c[n] += 1
c.append(n)
return c
@mt
def slv(N, A):
ans = 0
A.sort()
ac = Counter(A)
for i in range(N):
# print(i)
a = A[i]
if ac[a] >= 2:
continue
c = e(a)
for j in range(len(c)):
f = False
for i in combinations(c, r=j):
m = reduce(mul, i, 1)
# error_print(a, m)
if ac[m] >= 1:
# error_print('b', a)
break
else:
f = True
if not f:
break
else:
ans += 1
return ans
def main():
N = read_int()
A = read_int_n()
print(slv(N, A))
# from random import randint
# N = 2* (10**5)
# A = [randint(1, 10**6) for _ in range(N)]
# print(slv(N, A))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
from collections import Counter
c = Counter()
ma = max(A)
for a in A:
for i in range(ma//a + 1):
c[a*i] += 1
ans = 0
for a in A:
if c[a] == 1:
ans += 1
return ans
def main():
N = read_int()
A = read_int_n()
print(slv(N, A))
# from random import randint
# N = 2* (10**5)
# A = [randint(1, 10**6) for _ in range(N)]
# print(slv(N, A))
if __name__ == '__main__':
main()
| p02642 |
sieve=[0]*1000009
n=int(eval(input()))
s=sorted(map(int,input().split()))
for i in s:
for j in range(i,1000009,i):sieve[j]+=1
print((sum(sieve[i]==1for i in s))) | sieve=[0]*1000009
n=int(eval(input()))
s=sorted(map(int,input().split()))
for i in s:
if sieve[i]<2:
for j in range(i,1000009,i):sieve[j]+=1
print((sum(sieve[i]==1for i in s))) | p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
A = set(A)
MAX_A = 10 ** 6
X = [0] * (MAX_A + 1)
for a in A:
for i in range(a, MAX_A + 1, a):
X[i] += 1
ans = len([a for a in A if (X[a] == 1) and (C[a] == 1)])
print(ans) | from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
C = Counter(A)
A = set(A)
B = [True] * (10 ** 6 + 1)
for a in A:
for i in range(2 * a,10**6 + 1 ,a):
B[i] = False
cnt = 0
for a in A:
if (B[a] == True) and (C[a] == 1):
cnt += 1
print(cnt) | p02642 |
n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
set_a = set(a)
max_a = max(a)
dup_a = {ai for ai in set_a if a.count(ai) > 1}
nd = [True] * (max_a + 1)
cnt = 0
for ai in sorted(list(set_a)):
if nd[ai] == True and ai not in dup_a:
cnt += 1
elif nd[ai] == False:
continue
multi = 2
while ai*multi <= max_a:
nd[ai*multi] = False
multi += 1
print(cnt) | n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
max_a = max(a)
cnt_d = [0] * (max_a + 1)
for ai in a:
for multi in range(ai, max_a + 1, ai):
cnt_d[multi] += 1
cnt_nd = 0
for ai in a:
if cnt_d[ai] == 1:
cnt_nd += 1
print(cnt_nd) | p02642 |
n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
max_a = max(a)
cnt_d = [0] * (max_a + 1)
for ai in a:
for multi in range(ai, max_a + 1, ai):
cnt_d[multi] += 1
print((sum(cnt_d[ai] == 1 for ai in a))) | n = int(eval(input()))
a = [int(i) for i in input().split()]
max_a = max(a)
cnt_d = [0] * (max_a + 1)
for ai in a:
for multi in range(ai, max_a + 1, ai):
cnt_d[multi] += 1
print((sum(cnt_d[ai] == 1 for ai in a))) | p02642 |
# D - Not Divisible
N = int(eval(input())) # 【1行】1数字
num_list = list(map(int, input().split()))
ind_list = [1 for _ in range(N)]
num_list.sort()
for i in range(N-1):
if num_list[i+1] == num_list[i]:
ind_list[i] = -1
continue
for j in range(i):
if num_list[i] % num_list[j] == 0 :
ind_list[i] = -1
break
for i in range(N-1):
if num_list[N-1] % num_list[i] == 0 :
ind_list[N-1] = -1
break
print((ind_list.count(1))) | # D - Not Divisible
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
answer = 0
for i in range(N):
if l[a[i]] == 1:
answer += 1
for g in range(a[i], MAX+1, a[i]):
l[g] = 10
print(answer) | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
import heapq
heapq.heapify(A)
while A != []:
a = heapq.heappop(A)
ans += 1
AA = []
if a in A:
ans -= 1
for i in range(len(A)):
if not (A[i] % a == 0):
AA.append(A[i])
A = AA
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
s = A[-1]
p = [0 for _ in range(s+1)]
for i in A:
p[i] += 1
if p[i] > 1:
continue
for j in range(i*2,s+1,i):
p[j] += 1
ans = 0
for i in A:
if p[i] == 1:
ans += 1
print(ans) | p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
# サイズA_maxのbool配列dpを用意し、trueで初期化する
A_max = max(A)
dp = [True] * (A_max + 1)
# 数列の要素を昇順に見る O(nloglogn)
for x in range(A_max):
# すでに計算していれば再度計算しない
if not dp[x]:
continue
# xが数列Aに含まれているとき、xより大きいxの倍数yについて、dp[y]をfalseに変更する
if x in A:
t = 2
while x * t <= A_max:
dp[x * t] = False
t += 1
# 同じ値が複数存在するかチェックする用のカウンタ
C = {a: 0 for a in A}
for a in A:
C[a] += 1
ans = 0
for a in A:
if C[a] == 1 and dp[a] is True:
ans += 1
print(ans)
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
# 同じ値が複数存在するかチェックする用のカウンタ
counter = Counter(A)
# D[a] = True: Aにaより小さいaの約数が存在する
A_max = max(A)
dp = {a: False for a in A}
for a in A:
# xが数列Aに含まれているとき、aより大きいaの倍数tについて、dp[a * t]をTrueに変更する
if counter[a] > 0:
t = 2
while a * t <= A_max:
dp[a * t] = True
t += 1
ans = 0
for a in A:
if counter[a] == 1 and dp[a] is False:
ans += 1
print(ans)
| p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=set(A)
A.sort()
ans=[1]*max(A)
for i in range(len(A)):
if ans[A[i]-1]!=0:
if i>0 and A[i]==A[i-1]:
ans[A[i]-1]=0
for j in range(A[i]*2,max(A)+1,A[i]):
ans[j-1]=0
k=0
for i in A:
if ans[i-1]==1:
k+=1
print(k) | N=int(eval(input()))
A=list(map(int,input().split()))
B=set(A)
A.sort()
S=max(A)
ans=[1]*S
for i in range(len(A)):
if ans[A[i]-1]!=0:
if i>0 and A[i]==A[i-1]:
ans[A[i]-1]=0
for j in range(A[i]*2,S+1,A[i]):
ans[j-1]=0
k=0
for i in A:
if ans[i-1]==1:
k+=1
print(k) | p02642 |
def solve():
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
a2=set(a)
a2=list(sorted(a2))
num3=0
if a2[0]==1:
if a.count(1)==1:
ans=1
else:
ans=0
else:
len2=len(a2)
def c1(num1):
return a.count(num1)
def l1():
return len(a2)
for i in range(len2):
num=0
if c1(a2[i-num3])==1:
for j in range(i-num3):
if a2[i-num3]%a2[j]==0:
num=1
a2.remove(a2[i-num3])
num3+=1
break
if a2[i-num3]/2+1<a2[j]:
break
if num==0:
ans+=1
print(ans)
solve()
| n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
a.sort()
num=a[-1]
dp=[True]*num
seen=[0]*num
for i in range(n):
num2=a[i]
if dp[num2-1]==True:
if seen[num2-1]==1:
dp[num2-1]=False
for j in range(2,num//num2+1):
dp[j*num2-1]=False
seen[a[i]-1]=1
ans=0
for i in range(n):
if dp[a[i]-1]==True:
ans+=1
print(ans)
| p02642 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
Nmax = 10**6+1
A = list(map(int, input().split()))
A. sort()
prime = [0]*Nmax
for i in range(N):
if prime[A[i]] == 0:
prime[A[i]] = 1
else:
prime[A[i]] = -1
for a in A:
if prime[a] != 0:
for q in range(a*2, Nmax, a):
prime[q] = 0
res = 0
for a in prime:
if a == 1:
res += 1
print(res)
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A. sort()
Nmax = A[-1] + 1
prime = [0]*Nmax
for i in range(N):
if prime[A[i]] == 0:
prime[A[i]] = 1
else:
prime[A[i]] = -1
for a in A:
if prime[a] != 0:
for q in range(a*2, Nmax, a):
prime[q] = 0
res = 0
for a in prime:
if a == 1:
res += 1
print(res)
if __name__ == '__main__':
main() | p02642 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
c = Counter(A)
minus = []
for i in list(c.items()):
if i[1] > 1:
minus.append(i[0])
flag = True
A = sorted(set(A))
i = 0
j = len(A)-1
while i < j:
if A[j] % A[i] == 0:
A.pop(j)
j -= 1
if j == i:
j = len(A)-1
i += 1
cnt = 0
for n in minus:
if n in A:
cnt += 1
ans = len(A) - cnt
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
l = max(A)+1
li = [0]*(l)
A.sort()
for a in A:
if li[a] == 0:
li[a] = 1
for i in range(a*2, l, a):
li[i] = 2
elif li[a] == 1:
li[a] = 2
print((li.count(1)))
| p02642 |
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
THE_NUM = 10**6 + 1
dp = [True] * THE_NUM
prev_num = -1
for i in A:
# if the same number appears as before, that number cannot be counted in the answer.
if prev_num == i:
dp[i] = False
prev_num = i
for j in range(i * 2, THE_NUM, i):
dp[j] = False
ans = 0
for i in A:
# the same number after the second will not counted in the answer.
if dp[i] == True:
ans += 1
print(ans)
| N = int(eval(input()))
A = sorted(list(map(int, input().split())))
THE_NUM = 10**6 + 1
dp = [True] * THE_NUM
prev_num = -1
for i in A:
# if the same number appears as before, that number cannot be counted in the answer.
if prev_num != i:
for j in range(i * 2, THE_NUM, i):
dp[j] = False
else:
dp[i] = False
prev_num = i
ans = 0
for i in A:
# the same number after the second will not counted in the answer.
if dp[i] == True:
ans += 1
print(ans)
| p02642 |
#!/usr/bin/env python3
from collections import Counter
n, *A = list(map(int, open(0).read().split()))
A.sort()
c, s = Counter(A), set()
M = max(A) + 1
ans = 0
for a in A:
if a in s:
continue
ans += c[a] == 1
for i in range(a, M, a):
s.add(i)
print(ans) | from collections import Counter
n, *A = list(map(int, open(0).read().split()))
A.sort()
c, s = Counter(A), set()
M = max(A) + 1
ans = 0
for a in A:
if a in s:
continue
ans += c[a] == 1
for i in range(a, M, a):
s.add(i)
print(ans) | p02642 |
import math
n = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort()
b = set()
c = 0
for i, v in enumerate(a):
flag = True
for j in range(1, int(math.sqrt(v))+1):
if v % j == 0 and (j in b or v/j in b):
flag = False
break
if flag == True:
b.add(v)
if i+1 >= len(a):
c += 1
elif a[i+1] != v:
c += 1
print(c) | import math
n = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort()
b = [0 for _ in range(a[-1])]
c = 0
for i in a:
x = i-1
while len(b) > x:
b[x] += 1
x += i
for i in a:
if b[i-1] == 1:
c += 1
print(c) | p02642 |
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
if __name__ == "__main__":
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
M = 1000005
dp = [0]*(max(a)+1)
for i in range(n):
if dp[a[i]] != 0:
dp[a[i]] = 2
continue
for j in range(a[i],max(a)+1,a[i]):
dp[j]+=1
cnt = 0
for i in range(n):
if dp[a[i]] == 1:
cnt+=1
print(cnt) | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
if __name__ == "__main__":
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
M = 1000005
m = max(a)
dp = [0]*(m+1)
for i in range(n):
if dp[a[i]] != 0:
dp[a[i]] = 2
continue
for j in range(a[i],m+1,a[i]):
dp[j]+=1
cnt = 0
for i in range(n):
if dp[a[i]] == 1:
cnt+=1
print(cnt) | p02642 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
AList = list(map(int, input().split()))
AList.sort()
ResultList = []
PrimeList = []
tmp = 0
if N > 1:
if AList[0] != AList[1]:
ResultList.append(AList[0])
else:
ResultList.append(AList[0])
PrimeList.append(AList[0])
for p in range(1, N - 1):
tmp = 0
if AList[p - 1] != AList[p] and AList[p] != AList[p + 1]:
for q in PrimeList:
if AList[p] % q == 0:
tmp = 1
break
if tmp == 0:
ResultList.append(AList[p])
PrimeList.append(AList[p])
else:
PrimeList.append(AList[p])
tmp = 0
if N > 1:
if AList[N - 2] != AList[N - 1]:
for q in PrimeList:
if AList[N - 1] % q == 0:
tmp = 1
break
if tmp == 0:
ResultList.append(AList[N - 1])
print((len(ResultList))) | import sys
input = sys.stdin.readline
N = int(eval(input()))
AList = list(map(int, input().split()))
AList.sort()
dp = [0] * (AList[-1] + 1)
for i in AList:
dp[i] += 1
if dp[i] == 1:
for p in range(2 * i, len(dp), i):
dp[p] += 2
print((dp.count(1))) | p02642 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
s = list(set(a))
P = [0] * (10 ** 6 + 1)
for x in s:
t = x
while t <= 10**6:
P[t] += 1
t += x
ans = 0
for x in a:
#print(P[x])
if P[x] == 1 and c[x] == 1:
ans += 1
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
p = [True] * (10 ** 6 + 1)
s = list(set(a))
for x in s:
t = x * 2
#print(t)
while t <= 10 ** 6:
p[t] = False
t += x
ans = 0
for x in a:
#print(x)
if c[x] == 1 and p[x] == True:
ans += 1
print(ans) | p02642 |
from sys import stdin, setrecursionlimit
from collections import deque
def main():
input = stdin.buffer.readline
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
q = deque(a)
ans = 0
while q:
a = q.popleft()
m = len(q)
for i in range(m):
b = q.popleft()
if i == 0 and b == a:
ans -= 1
if b % a != 0:
q.append(b)
else:
ans += 1
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
max_a = max(a)
dp = [True] * (max_a + 1)
ans = 0
for i in range(n):
ai = a[i]
if dp[ai]:
if not (i < n - 1 and a[i] == a[i + 1]):
ans += 1
x = 1
while ai * x < max_a + 1:
dp[ai * x] = False
x += 1
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| p02642 |
import sys
from collections import Counter
def ii(): return int(sys.stdin.readline())
def li(): return list(map(int, sys.stdin.readline().split()))
if __name__ == "__main__":
n = ii()
a = li()
c = Counter(a)
del_list = []
for k, v in list(c.items()):
if v >= 2:
del_list.append(k)
a = sorted(set(a))
if len(a) == 0:
print((0))
exit()
max_a = a[-1]
b = [True] * (max_a + 1)
def sived(x):
for not_ans in range(x+x, max_a + 1, x):
b[not_ans] = False
for i in a:
if b[i]:
sived(i)
ans = 0
for i in a:
if b[i]:
if i in del_list:
continue
ans += 1
print(ans)
| import sys
from collections import Counter
def ii(): return int(sys.stdin.readline())
def li(): return list(map(int, sys.stdin.readline().split()))
if __name__ == "__main__":
n = ii()
a = li()
a = sorted(a)
a_max = a[-1]
sive = [True] * (a_max + 1)
def sived(x):
for non_ans in range(x, a_max+1, x):
sive[non_ans] = False
ans = 0
for i in range(len(a)-1):
if sive[a[i]]:
sived(a[i])
if a[i] != a[i+1]:
ans += 1
if sive[a_max]:
ans += 1
print(ans)
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
DP = [-1 for i in range(max(A)+1)]
A.sort()
for a in A:
if DP[a] != 0:
if DP[a] == 1:
DP[a] = 0
continue
for i in range(2*a, max(A)+1, a):
DP[i] = 0
DP[a] = 1
ans = 0
for i in DP:
if i == 1:
ans += 1
print(ans) | 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
for i in range(2*a, maxA+1, a):
DP[i] = 0
DP[a] = 1
ans = 0
for i in DP:
if i == 1:
ans += 1
print(ans) | p02642 |
import heapq
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def make_divisors(n):
divisors = set()
i = 1
while i*i <= n:
if n % i == 0:
divisors.add(i)
if i != n // i:
divisors.add(n//i)
i += 1
return divisors
def main():
N = int(input().strip())
divisors = set()
ans = set()
l = [int(i) for i in input().strip().split()]
heapq.heapify(l)
for _ in range(N):
n = heapq.heappop(l)
if n in divisors:
if n in ans:
ans.remove(n)
continue
divs = make_divisors(n)
for d in divs:
if d in divisors:
divisors.add(n)
break
else:
divisors.add(n)
ans.add(n)
return len(ans)
if __name__ == "__main__":
print((main())) | import heapq
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = int(input().strip())
l = [int(i) for i in input().strip().split()]
ans = 0
m = max(l)
dp = [0] * (m+1)
for n in l:
for j in range(n, m + 1, n):
dp[j] += 1
for n in l:
if dp[n] == 1:
ans += 1
return ans
if __name__ == "__main__":
print((main()))
| p02642 |
#import numpy as np
from operator import add
import sys
def calc_double(n,i):
return float(n/i)
listA=[]
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
N=listA[0]
lis_0=[0]*N[0]
lis=listA[1]
for idx1,i in enumerate(lis):
lis_=[]
for val in lis:
lis_.append(calc_double(val,i))
for idx,num in enumerate(lis_):
if idx!=idx1:
if num.is_integer(): lis_[idx]=1
else: lis_[idx]=0
else:lis_[idx]=0
lis_0 = list(map(add, lis_, lis_0))
print((lis_0.count(0))) | ## 動画見てアルゴリズムを知った
listA=[]
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
lis=listA[1]
m=max(lis)
lis0=[0]*(m+1)
for i in lis:
if lis0[i]!=2:
j=1
while i*j<=m:
lis0[i*j]+=1
j+=1
count=0
for i in lis:
if lis0[i]==1: count+=1
print(count) | p02642 |
N = int(eval(input()))
A = list(map(int,input().split()))
M = 1000001
cnt = [0]*M
ans = 0
for x in A:
if cnt[x] != 0:
cnt[x] = 2
for i in range(x,M,x):
cnt[i] += 1
for x in A:
if cnt[x] == 1:
ans += 1
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
M = 1000001
cnt = [0]*M
ans = 0
for x in A:
if cnt[x] != 0:
cnt[x] = 2
continue
for i in range(x,M,x):
cnt[i] += 1
for x in A:
if cnt[x] == 1:
ans += 1
print(ans)
| p02642 |
from collections import Counter
import sys
def input():
return sys.stdin.readline().strip()
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
yield i
if i != n // i:
yield n//i
i += 1
n,*A = get_all_int()
A.sort()
C = dict(Counter(A))
keys = C.keys()
# log(C)
checks = [False] * (1000009)
B = []
for i,a in enumerate(A):
if C[a] == 1:
B.append(a)
else:
for j in range(a, 1000009, a):
checks[j] = True
# log(B)
ans = 0
for i,a in enumerate(B):
if not checks[a]:
ans += 1
for j in range(a, 1000009, a):
checks[j] = True
print(ans)
| from collections import Counter
import sys
def input():
return sys.stdin.readline().strip()
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
yield i
if i != n // i:
yield n//i
i += 1
n,*A = get_all_int()
A.sort()
C = dict(Counter(A))
keys = C.keys()
# log(C)
checks = [False] * (1000009)
B = []
for i,a in enumerate(A):
if C[a] == 1:
B.append(a)
elif not checks[a]:
for j in range(a, 1000009, a):
checks[j] = True
# log(B)
ans = 0
for i,a in enumerate(B):
if not checks[a]:
ans += 1
for j in range(a, 1000009, a):
checks[j] = True
print(ans)
| p02642 |
# D - Not Divisible
n = int(eval(input()))
a = list(map(int, input().split()))
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
multiples = set()
upper = 10 ** 6
for k in list(dic.keys()):
i = 2
while True:
if k * i <= upper:
multiples.add(k * i)
i += 1
else:
break
ans = 0
for k, v in list(dic.items()):
if v == 1:
if not k in multiples:
ans += 1
print(ans)
| import sys
input = sys.stdin.readline
# D - Not Divisible
n = int(eval(input()))
a = list(map(int, input().split()))
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
multiples = set()
upper = 10 ** 6
for k in list(dic.keys()):
i = 2
while True:
if k * i <= upper:
multiples.add(k * i)
i += 1
else:
break
ans = 0
for k, v in list(dic.items()):
if v == 1:
if not k in multiples:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
cnt = [0 for _ in range(10**6+5)]
ans = 0
for x in a:
for i in range(x, 10**6+5, x):
cnt[i] += 1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
cnt = [0 for _ in range(10**6+5)]
ans = 0
if n == 1:
print((1))
exit()
if a[0] == 1:
if a[1] != 1:
print((1))
else:
print((0))
exit()
for x in a:
for i in range(x, 10**6+5, x):
cnt[i] += 1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
checker = [1 for _i in range(10**6+1)]
a.sort()
a.append(-1)
result = 0
for i in range(n):
if a[i] == a[i+1]:
checker[a[i]] = 0
result += checker[a[i]]
checker[a[i]] = 0
x = 2
while a[i]*x <= 10**6:
checker[a[i]*x] = 0
x += 1
print(result) | n = int(eval(input()))
a = list(map(int, input().split()))
checker = [1 for _i in range(10**6+1)]
a.sort()
a.append(-1)
result = 0
for i in range(n):
if a[i] == a[i-1]:
continue
if a[i] == a[i+1]:
checker[a[i]] = 0
result += checker[a[i]]
checker[a[i]] = 0
x = 2
while a[i]*x <= 10**6:
checker[a[i]*x] = 0
x += 1
print(result) | p02642 |
def make_divisors(n):
i = 1
flg = True
while i*i <= n:
if n % i == 0:
if i in s and i != n:
flg = False
break
ii = n//i
if i != ii:
if ii in s and ii != n:
flg = False
break
i += 1
return flg
def main():
cnt = 0
from collections import Counter
c = Counter(a)
for i in range(n):
if c[a[i]] > 1:
continue
if make_divisors(a[i]):
cnt += 1
print(cnt)
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(int,input().split()))
s = set(a)
main() | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
ans = set(a)
ma = max(a)
from collections import Counter
c = Counter(a)
for i in range(n):
t = a[i]
if c[t] > 1 and t in ans:
ans.remove(t)
continue
j = 2
tmp = t*j
while tmp <= ma:
if tmp in ans:
ans.remove(tmp)
j += 1
tmp = t*j
print((len(ans)))
if __name__ == '__main__':
main()
| p02642 |
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)
# UnionFind
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# ダイクストラ
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge%(10**6)]:
continue
v = minedge%(10**6)
d[v] = minedge//(10**6)
used[v] = False
for e in edge[v]:
if used[e[1]]:
heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
return d
# 素因数分解
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
# 2数の最小公倍数
def lcm(x, y):
return (x * y) // gcd(x, y)
# リストの要素の最小公倍数
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
# リストの要素の最大公約数
def gcd_list(numbers):
return reduce(gcd, numbers)
# 素数判定
def is_prime(n):
if n <= 1:
return False
p = 2
while True:
if p ** 2 > n:
break
if n % p == 0:
return False
p += 1
return True
# limit以下の素数を列挙
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
while True:
prime = min(A)
if prime > sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
if A[i] % prime == 0:
A.pop(i)
continue
i += 1
for a in A:
P.append(a)
return P
# 同じものを含む順列
def permutation_with_duplicates(L):
if L == []:
return [[]]
else:
ret = []
# set（集合）型で重複を削除、ソート
S = sorted(set(L))
for i in S:
data = L[:]
data.remove(i)
for j in permutation_with_duplicates(data):
ret.append([i] + j)
return ret
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 = sorted(list(map(int, input().split())))
cnt = 0
cnt1 = 0
for i in a:
if i == 1:
cnt1 += 1
if cnt1 == 2:
print((0))
sys.exit()
# if cnt1 > 1:
# print(0)
# sys.exit()
if cnt1 == 1:
print((1))
sys.exit()
if n == 1:
print((1))
sys.exit()
for i in range(n):
# d = make_divisors(a[i])
# print(d)
if i == 0 and a[i] == a[i + 1]:
continue
if i == n - 1 and a[i - 1] == a[i]:
continue
if i not in [0, n - 1] and (a[i - 1] == a[i] or a[i] == a[i + 1]):
continue
d = make_divisors(a[i])
if len(d) == 2:
cnt += 1
continue
d = d[:-1]
for j in d:
if a[bisect_left(a, j)] == j:
break
else:
cnt += 1
print(cnt) | import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)
# UnionFind
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
# ダイクストラ
def dijkstra_heap(s, edge, n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge%(10**6)]:
continue
v = minedge%(10**6)
d[v] = minedge//(10**6)
used[v] = False
for e in edge[v]:
if used[e[1]]:
heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
return d
# 素因数分解
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
# 2数の最小公倍数
def lcm(x, y):
return (x * y) // gcd(x, y)
# リストの要素の最小公倍数
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
# リストの要素の最大公約数
def gcd_list(numbers):
return reduce(gcd, numbers)
# 素数判定
def is_prime(n):
if n <= 1:
return False
p = 2
while True:
if p ** 2 > n:
break
if n % p == 0:
return False
p += 1
return True
# limit以下の素数を列挙
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
while True:
prime = min(A)
if prime > sqrt(limit):
break
P.append(prime)
i = 0
while i < len(A):
if A[i] % prime == 0:
A.pop(i)
continue
i += 1
for a in A:
P.append(a)
return P
# 同じものを含む順列
def permutation_with_duplicates(L):
if L == []:
return [[]]
else:
ret = []
# set（集合）型で重複を削除、ソート
S = sorted(set(L))
for i in S:
data = L[:]
data.remove(i)
for j in permutation_with_duplicates(data):
ret.append([i] + j)
return ret
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 = sorted(list(map(int, input().split())))
m = max(a)
dp = [0 for i in range(m + 1)]
for i in a:
cnt = 1
while i * cnt <= m:
dp[i * cnt] += 1
cnt += 1
ans = 0
# print("dp =", dp)
for i in range(n):
if i > 0 and a[i] == a[i - 1]:
continue
if dp[a[i]] <= 1:
ans += 1
print(ans) | p02642 |
from math import sqrt
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
p = [0] * (10**6 + 1)
c = Counter(A)
for a in list(c.keys()):
tmp = a * 2
while tmp <= 10**6:
p[tmp] = 1
tmp += a
for a in A:
if p[a] == 0 and c[a] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| from math import sqrt
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = 0
p = [0] * (10**6 + 1)
c = Counter(A)
for a in list(c.keys()):
tmp = a * 2
while tmp <= 10**6:
p[tmp] = 1
tmp += a
for a in A:
if p[a] == 0 and c[a] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02642 |
import sys
def input():
return sys.stdin.readline()[:-1]
from itertools import count
from collections import Counter
def test():
n = int(eval(input()))
a = sorted([int(i) for i in input().split()])
mxn = a[-1]
c = Counter(a)
a = sorted(list(set(a)))
r = dict()
for i in a:
for j in count(1):
if i * j > mxn: break
r[i * j] = r.get(i * j, 0) + 1
print((len([k for k in a if r[k] == 1 and c[k] == 1])))
test() | # https://qiita.com/HUVEC/items/97739696ab51cacd10f2
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[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) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
for i in range(n):
for j in range(n):
if i != j and a[i] % a[j] == 0:
break
else:
count += 1
print(count)
| def func(n, a):
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))) # 31401
n = int(eval(input()))
a = list(map(int, input().split()))
func(n, a)
| p02642 |
#エラストテネスのふるいを用いることを考える
#出たものの倍数をいれるダメリストを準備しておく。
#各a[i]についてダメリストに入っていないものが求める個数である
#同じものが複数回出てくるもの（Counterを使えばいい）に関してはダメリストにその数もいれれば良い
from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
min_a=a[0]
max_a=a[n-1]
#同じものが複数回出てくるもののcheck
dic=Counter(a)
#別リスト
check=set()
for i in range(n):
if a[i] not in check:
if dic[a[i]]>=2:
check.add(a[i])
for j in range(2,int((max_a)/a[i])+1):
check.add(a[i]*j)
ans=0
for i in range(n):
if a[i] not in check:
ans=ans+1
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
k=max(a)
num_list=set()
prime_list=set()
from collections import Counter
dic=Counter(a)
a=set(a)
for i in dic:
if dic[i]>=2:
dic[i]=0
if i not in num_list:
for j in range(i*2,k+1,i):
if j in a:
dic[j]=0
num_list.add(j)
print((sum(dic.values())))
| p02642 |
N = int(eval(input()))
a_list = sorted(list(map(int, input().split())))
dp = [True] * N
for i, ai in enumerate(a_list):
if dp[i] == False:
continue
for j, aj in enumerate(a_list[i+1:]):
if ai == aj:
dp[i] = False
if aj%ai == 0:
dp[i+1+j] = False
if dp[i] > a_list[-1]**0.5+1:
break
print((sum(dp))) | N = int(eval(input()))
a_list = sorted(list(map(int, input().split())))
a_max = a_list[-1]
count = [0] * (a_max+1)
for a in a_list:
for j in range(a, a_max+1, a):
count[j] += 1
ans = 0
for a in a_list:
if count[a] == 1:
ans += 1
print(ans) | p02642 |
import math
import collections
n=int(eval(input()))
a=list(map(int,input().split()))
l=[]
d=collections.Counter(a)
count=0
for i in list(set(a)):
c=0
d[i]-=1
if d[i]==0:
del d[i]
for j in range(1,math.floor(math.sqrt(i))+1):
if i%j==0:
if j in d:
c=1
break
if i%(i//j)==0:
if (i//j) in d:
c=1
break
if c==0:
count+=1
if i not in d:
d[i]=1
else:
d[i]+=1
print(count) | n = int(eval(input()))
a = sorted(list(map(int,input().split())))
am = a[-1]+1
b = [0]*am
for i in a:
b[i]+=1
if b[i]==1:
for j in range(i*2,am,i):
b[j]=2
print((b.count(1))) | p02642 |
import sys
from collections import defaultdict
I=sys.stdin.readline
n=int(I())
arr=sorted(list(map(int,I().split())))
d=defaultdict(int)
for i in arr:
d[i]+=1
ans=0
visited=[0]*(10**6+1)
for i in arr:
if d[i]==1 and visited[i]==0:
ans+=1
for j in range(i,10**6+1,i):
visited[j]=1
print(ans)
| import sys
from collections import defaultdict
I=sys.stdin.readline
n=int(I())
arr=sorted(list(map(int,I().split())))
d=defaultdict(int)
for i in arr:
d[i]+=1
ans=0
visited=[0]*(arr[-1]+1)
for i in arr:
if d[i]==1 and visited[i]==0:
ans+=1
for j in range(i,arr[-1]+1,i):
visited[j]=1
print(ans)
| p02642 |
n= int(eval(input()))
l=list(map(int,input().split()))
flag=[0]*n
for i in range(len(l)):
for j in range(len(l)):
if i==j:
continue
elif flag[i]==1:
continue
elif l[i]%l[j]==0:
flag[i]=1
break
print((flag.count(0)))
| n= int(eval(input()))
l=list(map(int,input().split()))
l.sort()
maxnum=l[len(l)-1]
flag=[0]*(maxnum+1)
for num in l:
flag[num]+=1
if flag[num]>1:
continue
for j in range(num*2, maxnum+1, num):
flag[j]+=1
#print(flag)
ans=0
for num in l:
if flag[num]==1:
ans+=1
print(ans)
| p02642 |
def main():
MAX_VALUE = 10**6 + 5
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * MAX_VALUE
ans = 0
for x in a:
for i in range(x, MAX_VALUE, x):
cnt[i] += 1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
def main():
MAX_VALUE = 10**6 + 5
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * MAX_VALUE
ans = 0
for x in a:
if cnt[x] != 0:
cnt[x] = 2
continue
for i in range(x, MAX_VALUE, x):
cnt[i]+=1
for x in a:
if cnt[x] == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02642 |
MAX = 10 ** 6 + 5
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = [0] * MAX
for a in A:
cnt[a] += 1
for i in range(N):
a = A[i]
if cnt[a] == 0:
continue
for j in range(2 * a, MAX, a):
cnt[j] = 0
res = 0
for a in A:
if cnt[a] == 1:
res += 1
print(res) | MAX = 10 ** 6 + 1
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = [0] * MAX
f = [True] * MAX
for a in A:
cnt[a] += 1
if not f[a] or cnt[a] > 1:
continue
for j in range(2 * a, MAX, a):
f[j] = False
res = 0
for a in A:
if f[a] and cnt[a] == 1:
res += 1
print(res) | p02642 |
from collections import Counter
N = int(eval(input()))
A = [int(v) for v in input().split()]
l = [1 for i in range(max(A)+1)]
for v in sorted(A):
for j in range(2*v, max(A)+1, v):
l[j] = 0
ans = 0
c = Counter(A)
for a in A:
if c[a] > 1:continue
ans += l[a]
print(ans) | from collections import Counter
N = int(eval(input()))
A = [int(v) for v in input().split()]
m = max(A)
l = [1 for i in range(m+1)]
for v in sorted(A):
for j in range(2*v, m+1, v):
l[j] = 0
ans = 0
c = Counter(A)
for a in A:
if c[a] > 1:continue
ans += l[a]
print(ans) | p02642 |
from collections import Counter
#nの約数列挙
def divisor(n):
ass = []
for i in range(1, int(n**0.5)+1):
if n%i == 0:
ass.append(i)
if i**2 == n:
continue
ass.append(n//i)
return ass # sortされていない
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a_max = a[-1]
div = [0]*(a_max+1)
c = Counter(a)
#print(c)
count = 0
already = []
for i in range(n):
if c[a[i]] != 1:
div[a[i]] = 1
continue
div_a = divisor(a[i])
for j in div_a:
if div[j] == 1:
break
else:
count += 1
div[a[i]] = 1
print(count) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a_max = a[-1]
ban = [0]*(a_max+1)
count = 0
for i in range(n):
if ban[a[i]]:
continue
else:
if i == n-1 or a[i+1] != a[i]:
count += 1
x = a[i]
while x <= a_max:
ban[x] = 1
x += a[i]
#print(ban)
print(count) | p02642 |
n=int(eval(input("")))
aa=input("").split(" ")
lista=[]
for i in range(n):
lista+=[int(aa[i])]
s=0
lista.sort()
listde=set()
for i in range(n-1):
if(lista[i]==lista[i+1]):
listde.add(lista[i])
t=0
for i in range(n):
t=0
for k in listde:
if (lista[i]%k==0):
t=1
break
if (t==0):
s+=1
listde.add(lista[i])
print(s)
| n=int(eval(input("")))
aa=input("").split(" ")
lista=[]
for i in range(n):
lista+=[int(aa[i])]
lista.sort()
listtf=[]
s=0
for i in range(lista[n-1]):
listtf+=[True]
for i in range(n):
if(listtf[lista[i]-1]):
if(i<n-1 and lista[i]==lista[i+1]):
s-=1
s+=1
t=1
while(t*lista[i]<=lista[n-1]):
listtf[lista[i]*t-1]=False
t+=1
print(s)
| p02642 |
N = int(eval(input()))
A = sorted(list(map(int, input().split()))) + [0]
memo = ['Y'] * (10**6+1)
count = 0
for i in range(N):
if memo[A[i]] == 'N':
continue
for j in range(A[i], max(A)+1, A[i]):
memo[j] = 'N'
if A[i] == A[i+1]:
continue
count += 1
print(count) | N = int(eval(input()))
A = sorted(list(map(int, input().split()))) + [0]
memo = ['Y'] * (10**6+1)
mx = max(A) + 1
count = 0
for i in range(N):
if memo[A[i]] == 'N':
continue
for j in range(A[i], mx, A[i]):
memo[j] = 'N'
if A[i] == A[i+1]:
continue
count += 1
print(count) | p02642 |
n=int(eval(input()))
alist=list(map(int,input().split()))
alist.sort()
blist=alist
blist=list(set(alist))
for i in range(n-1):
for j in range(i+1,n):
if alist[j]%alist[i]==0:
if alist[j] in blist:
blist.remove(alist[j])
'''
ans=0
for i in range(len(blist)):
if blist[i]>0:
ans+=1
print(ans)
'''
print((len(blist))) |
n=int(eval(input()))
alist=list(map(int,input().split()))
alist.sort()
hurui=[0]*(alist[-1]+1)
for i in range(n):
for j in range(1,alist[-1]//alist[i]+1):
hurui[alist[i]*j]+=1
ans=0
for i in range(n):
if hurui[alist[i]]==1:
ans+=1
print(ans)
| p02642 |
#maspyさんを参考に
import sys
#import numpy as np
#from numba import njit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# この最適化がよくわからん。Numpyループなら行けるらしい
# 400msくらいは最低でもかかるけど、N=10^5でも2でも変わらんと言う
#@njit('(i4[::1],)', cache=True)
def solve(A):
# エラトステネス古いって値側のバリエーションとして配列をとるんや
# maxA = 10**6って言うのがポイントっぽいなあ。。
count = np.zeros(10**6 + 10, np.int32)
for x in A:
if count[x] > 1:
continue
count[::x] += 1
ret = 0
for x in A:
ret += count[x] == 1
return ret
def solve2(A):
count = [0 for _ in range(10**6 + 10)]
for x in A:
if count[x] > 1:
continue
for a in range(0,len(count),x):
count[a] += 1
ret = 0
for x in A:
ret += (1 if count[x] == 1 else 0)
#print(count[:24])
return ret
# このコードわからなかった。一行目のNをSKIPしたリストになっている。。
#A = np.array(read().split(), np.int32)[1:]
N = int(eval(input()))
A = list(map(int, input().split()))
# この手法だとソート不要なのか？？だから早いのか？？
print((solve2(A)))
| #maspyさんを参考に
import sys
#import numpy as np
#from numba import njit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# この最適化がよくわからん。Numpyループなら行けるらしい
# 400msくらいは最低でもかかるけど、N=10^5でも2でも変わらんと言う
#@njit('(i4[::1],)', cache=True)
def solve(A):
# エラトステネス古いって値側のバリエーションとして配列をとるんや
# maxA = 10**6って言うのがポイントっぽいなあ。。
count = np.zeros(10**6 + 10, np.int32)
for x in A:
if count[x] > 1:
continue
count[::x] += 1
ret = 0
for x in A:
ret += count[x] == 1
return ret
def solve2(A):
count = [0 for _ in range(10**6 + 10)]
for x in A:
if count[x] > 1:
continue
for a in range(0,len(count),x):
count[a] += 1
ret = 0
for x in A:
ret += (1 if count[x] == 1 else 0)
#print(count[:24])
return ret
# このコードわからなかった。一行目のNをSKIPしたリストになっている。。
#A = np.array(read().split(), np.int32)[1:]
N = int(eval(input()))
A = list(map(int, input().split()))
# この手法だとソート不要なのか？？だから早いのか？？
print((solve2(sorted(A))))
| p02642 |
#import numpy as np
import time
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()#わるほう
remove_list = []
kouho = sorted([x for x in set(A) if A.count(x) == 1])
#maxA = 10**5
#target = kouho[:]
if kouho != []:
maxA = kouho[-1]
for i in range(len(A)):
if kouho == []:
break
maxN = int(maxA/A[i])
for n in range(2,maxN+1):
buf = A[i]*n
remove_list.append(buf)
#print(A[i]*n)
#target = kouho[:]
kouho = list(set(kouho) - set(remove_list))
print((len(kouho))) | #import numpy as np
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()#わるほう
#kouho = sorted([x for x in set(A) if A.count(x) == 1])
#maxA = 10**5
#target = kouho[:]
maxA = A[-1]
work=[0]*(A[-1]+1)
for i in range(len(A)):
if work[A[i]]<=1:
maxN = int(maxA/A[i])
for n in range(1,maxN+1):
buf = A[i]*n
#remove_list.append(buf)
work[buf]+=1
#print(A[i]*n)
#target = kouho[:]
#kouho = list(set(kouho) - set(remove_list))
sm=0
for s in A:
if work[s]==1: sm+=1
print(sm)
#print(len(kouho)) | p02642 |
#import numpy as np
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()#わるほう
#kouho = sorted([x for x in set(A) if A.count(x) == 1])
#maxA = 10**5
#target = kouho[:]
maxA = A[-1]
work=[0]*(A[-1]+1)
for i in range(len(A)):
if work[A[i]]<=1:
maxN = int(maxA/A[i])
for n in range(1,maxN+1):
buf = A[i]*n
#remove_list.append(buf)
work[buf]+=1
#print(A[i]*n)
#target = kouho[:]
#kouho = list(set(kouho) - set(remove_list))
sm=0
for s in A:
if work[s]==1: sm+=1
print(sm)
#print(len(kouho)) | #import numpy as np
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()#わるほう
#kouho = sorted([x for x in set(A) if A.count(x) == 1])
#maxA = 10**5
#target = kouho[:]
maxA = A[-1]
work=[0]*(A[-1]+1)
for i in range(len(A)):
maxN = int(maxA/A[i])
for n in range(1,maxN+1):
buf = A[i]*n
#remove_list.append(buf)
work[buf]+=1
#print(A[i]*n)
#target = kouho[:]
#kouho = list(set(kouho) - set(remove_list))
sm=0
for s in A:
if work[s]==1: sm+=1
print(sm)
#print(len(kouho)) | p02642 |
from collections import Counter
N=list(map(int,input().split()))
A=list(map(int,input().split()))
counter = Counter(A)
A=list(set(A))
A.sort()
check=A.copy()
search=[]
while True:
if len(check)<=0:
break
c = check.pop(0)
search.append(c)
check = [ _ for _ in check if (_%c !=0)or(_ < c**(1/2)) ]
ans=[s for s in search if counter[s]==1]
print((len(ans))) | # %%time
# from collections import Counter
N=list(map(int,input().split()))
A=list(map(int,input().split()))
# A=list(range(2,10**6))
# counter = Counter(A)
A.sort()
max=A[-1]
dp=[0]*(max+1)
for i in A:
if dp[i]!=0:
dp[i]+=1
continue
for j in range(1*i,max+1,i):
dp[j]+=1
ans=[]
for a_idx,a in enumerate(A):
if dp[a] == 1:
ans.append(a)
print((len(ans))) | p02642 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
dp = [True] * (a[-1] + 1)
ans = 0
m = a[-1]
for i, x in enumerate(a[:-1]):
if not a[i+1] == x and dp[x]:
ans += 1
for b in range(x, m + 1, x):
dp[b] = False
if dp[a[-1]]:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
max_a = a[-1]
is_available = [True] * (max_a + 1)
ans = 0
for i, x in enumerate(a[:-1]):
if not a[i+1] == x and is_available[x]:
ans += 1
for b in range(x, max_a + 1, x):
is_available[b] = False
if is_available[a[-1]]:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [0]*(10**6)
count = [0]*(10**6)
for i in a:
count[i-1] += 1
for j in range(i*2, 10**6+1, i):
dp[j-1] = 1
ans = 0
for i in a:
if count[i-1] == 1 and dp[i-1] == 0:
ans +=1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
dp = [0]*(10**6)
count = [0]*(10**6)
for i in a:
count[i-1] += 1
b = list(set(a))
for i in b:
for j in range(i*2, 10**6+1, i):
dp[j-1] = 1
ans = 0
for i in a:
if count[i-1] == 1 and dp[i-1] == 0:
ans +=1
print(ans) | p02642 |
import io,sys
sys.setrecursionlimit(10**6)
def main():
import bisect
n = int(eval(input()))
A = list(map(int,sys.stdin.readline().rstrip().split()))
A.sort()
ans = 0
a_max = A[-1]
note = [True]*(a_max+1)
for j in range(n):
a = A[j]
if note[a]:
if j != n-1 and A[j]==A[j+1]:
ans-=1
ans+=1
# for i in range(a,a_max+1):
# if i%a==0:
# note[i] = False
temp = a
while temp <= a_max:
note[temp]=False
temp+=a
print(ans)
main() | def main():
n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
A_max = A[-1]
g = []
table = [True]*(A_max+1)
for i,a in enumerate(A):
if table[a]:
temp = a
while A_max >= temp:
table[temp] = False
temp+=a
if i==n-1 or a!=A[i+1]:
g.append(a)
print((len(g)))
main() | p02642 |
#!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, randint, randrange, shuffle, sample
# import string # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate # accumulate(iter[, f])
# from operator import itemgetter # itemgetter(1), itemgetter('key')
# from fractions import Fraction # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
# from fractions import gcd # for Python 3.4 (previous contest @AtCoder)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79e+308
# inf = 2 ** 63 - 1 # (for fast JIT compile in PyPy) 9.22e+18
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(eval(input()))
def isp(): return input().split()
def mi(): return list(map(int, input().split()))
def mi_0(): return [int(x)-1 for x in input().split()]
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list([int(x)-1 for x in input().split()])
def li(): return list(eval(input()))
def enum_duplicate_num(L):
cnt = Counter(L)
buf = set()
for num in L:
if cnt[num] > 1:
buf.add(num)
return buf
def fill_mul_false(num, table):
for ind in range(num*2, 10**6+1, num):
table[ind] = False
n = ii()
command = lmi()
dup_num_set = enum_duplicate_num(command)
table = [False] * (10 ** 6 + 1)
for num in command:
table[num] = True
for num in command:
if table[num]:
fill_mul_false(num, table)
for num in dup_num_set:
table[num] = False
print((table.count(True)))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, randint, randrange, shuffle, sample
# import string # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate # accumulate(iter[, f])
# from operator import itemgetter # itemgetter(1), itemgetter('key')
# from fractions import Fraction # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
# from fractions import gcd # for Python 3.4 (previous contest @AtCoder)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79e+308
# inf = 2 ** 63 - 1 # (for fast JIT compile in PyPy) 9.22e+18
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(eval(input()))
def isp(): return input().split()
def mi(): return list(map(int, input().split()))
def mi_0(): return [int(x)-1 for x in input().split()]
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list([int(x)-1 for x in input().split()])
def li(): return list(eval(input()))
def enum_duplicate_num(L):
cnt = Counter(L)
dup_num_set = set()
buf = []
for num in L:
if cnt[num] > 1 and num not in dup_num_set:
dup_num_set.add(num)
buf.append(num)
elif cnt[num] == 1:
buf.append(num)
return dup_num_set, buf
def fill_mul_false(num, table):
for ind in range(num*2, 10**6+1, num):
table[ind] = False
n = ii()
command = lmi()
dup_num_set, command = enum_duplicate_num(command)
table = [False] * (10 ** 6 + 1)
for num in command:
table[num] = True
for num in command:
if table[num]:
fill_mul_false(num, table)
for num in dup_num_set:
table[num] = False
print((table.count(True)))
if __name__ == "__main__":
main()
| p02642 |
from collections import Counter
import math
def factors(n):
fhead = []
ftail = []
for x in range(1, int(math.sqrt(n)) + 1):
if n % x == 0:
fhead.append(x)
if x * x != n:
# This check is to not insert sqrt(n) twice in head and tail portion of the list
ftail.append(n // x)
return fhead + ftail[::-1]
(N,) = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
freq = Counter(A)
count = 0
for x in A:
bad = False
for d in factors(x):
if (d == x and freq[d] >= 2) or (d != x and freq[d]):
bad = True
break
if not bad:
count += 1
print(count)
| from collections import Counter
(N,) = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
freq = Counter(A)
if freq[1] == 1:
print((1))
elif freq[1] >= 2:
print((0))
else:
bad = set()
for k, v in list(freq.items()):
if v >= 2:
bad.add(k)
mx = max(A)
for x in list(freq.keys()):
for times in range(2, 10 ** 6 + 1):
if x * times > mx:
break
if x * times in freq:
bad.add(x * times)
count = 0
for x in A:
if x not in bad:
count += 1
print(count)
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
b = [False] * len(A)
for i in range(N):
for j in range(N):
if b[j] or i == j or A[i] > 500000:
continue
if A[j] % A[i] == 0:
b[j] = True
# print(b)
print((len(tuple([x for x in b if x == False]))))
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
M = A[-1]
b = [True] * (M + 1)
count = 0
for i, a in enumerate(A):
if not b[a]:
continue
for j in range(a, M+1, a):
b[j] = False
if i < N-1 and A[i+1] == a:
continue
count += 1
print(count)
| p02642 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
flg=0
for j in range(n):
if i==j:
continue
if a[i]%a[j]==0:
flg+=1
if flg==0:
cnt+=1
print(cnt) | n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(a)
m=max(a)
dp=[0]*(m+1)
d={}
cnt=0
for i in range(n):
b=a[i]
if b in d:
d[b]+=1
continue
else:
d[b]=1
j=b
while b<=m+b:
if b>m:
break
dp[b]+=1
b+=j
for i in a:
if dp[i]==1 and d[i]==1:
cnt+=1
print(cnt) | p02642 |
import sys
from collections import Counter
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
D = Counter(A)
B = []
W = set()
for k, v in list(D.items()):
if v == 1:
B.append(k)
else:
W.add(k)
res = 0
for a in A:
for i in range(1, int(pow(a, 0.5)) + 1):
if a % i == 0:
if i in W or a // i in W:
break
else:
res += 1
W.add(a)
print(res)
if __name__ == '__main__':
resolve()
| import sys
from collections import Counter
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
D = Counter(A)
dup = set()
for k, v in list(D.items()):
if v > 1:
dup.add(k)
judge = [False] * (A[-1] + 1)
res = 0
for a in A:
if judge[a]:
continue
else:
if a not in dup:
res += 1
for i in range(a, A[-1] + 1, a):
judge[i] = True
print(res)
if __name__ == '__main__':
resolve()
| p02642 |
import sys
from collections import Counter
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
D = Counter(A)
dup = set()
for k, v in list(D.items()):
if v > 1:
dup.add(k)
judge = [False] * (A[-1] + 1)
res = 0
for a in A:
if judge[a]:
continue
else:
if a not in dup:
res += 1
for i in range(a, A[-1] + 1, a):
judge[i] = True
print(res)
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
num = [True] * (max(A) + 1)
appear = set()
for a in A:
if a not in appear:
appear.add(a)
else:
num[a] = False
for a in A:
for i in range(a * 2, len(num), a):
num[i] = False
res = 0
for a in A:
if num[a]:
res += 1
print(res)
if __name__ == '__main__':
resolve()
| p02642 |
n = int(eval(input()))
a = list(map(int,input().split()))
c = [0]*1000001
for i in range(n):
c[a[i]] -= 1
for j in range(a[i],1000001,a[i]):
c[j] += 2
ans=c.count(1)
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
kmax = sorted(a)[-1]
c = [0]*(kmax+1)
for i in range(n):
c[a[i]] -= 1
for j in range(a[i],(kmax+1),a[i]):
c[j] += 2
ans=c.count(1)
print(ans) | p02642 |
from collections import deque
import collections
import math
"""
#n = int(input())
#A = [int(i) for i in input().split()]
n = 10**5
A = [int(i)+1 for i in range(10**5,0,-1)]
A.sort()
ans = 0
ans_list = []
kaburi = {}
for i in A:
Flag = True
for j in ans_list:
if i==j:
kaburi[i]=True
Flag = False
break
if i%j==0:
Flag = False
break
if Flag:
ans_list.append(i)
ans += 1
print(ans-len(kaburi))
"""
n = int(eval(input()))
A = [int(i) for i in input().split()]
Max = max(A)
cnt_dict = collections.Counter(A)
#Dict[i]はi未満の約数がAに存在しなければTrue
Dict = {a:True for a in A}
for a in A:
times = 2
while a*times<=Max:
Dict[a*times]=False
times +=1
ans = 0
for a in A:
if cnt_dict[a]==1 and Dict[a]:
ans +=1
print(ans)
| from collections import deque
import collections
import math
"""
#n = int(input())
#A = [int(i) for i in input().split()]
n = 10**5
A = [int(i)+1 for i in range(10**5,0,-1)]
A.sort()
ans = 0
ans_list = []
kaburi = {}
for i in A:
Flag = True
for j in ans_list:
if i==j:
kaburi[i]=True
Flag = False
break
if i%j==0:
Flag = False
break
if Flag:
ans_list.append(i)
ans += 1
print(ans-len(kaburi))
"""
n = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
Max = max(A)
cnt_dict = collections.Counter(A)
#Dict[i]はi未満の約数がAに存在しなければTrue
Dict = {a:True for a in A}
for a in A:
times = 2
while a*times<=Max:
Dict[a*times]=False
times +=1
ans = 0
for a in A:
if cnt_dict[a]==1 and Dict[a]:
ans +=1
print(ans)
| p02642 |
N = int(eval(input()))
*A, = list(map(int, input().split()))
A = sorted(A)
cnt = [0] * (10**6 + 1)
for a in A: cnt[a] += 1
checked = [True] * N
ans = 0
for i, a in enumerate(A):
if not checked[i]: continue
flag = True
for j in range(i+1, N):
if A[j] % a == 0:
checked[j] = False
if A[j] == a: flag = False
if flag: ans += 1
print(ans) | from collections import Counter
N = int(eval(input()))
*A, = list(map(int, input().split()))
A = sorted(A)
max_A = A[-1]
cnt = Counter(A)
admissible = [True] * (max_A + 1)
checked = [False] * (max_A + 1)
ans = 0
for a in A:
if not admissible[a] or checked[a]: continue
ans += 1
i = 2
while a * i <= max_A:
admissible[a * i] = False
i += 1
checked[a] = True
if cnt[a] > 1: ans -= 1
print(ans) | p02642 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce
from operator import mul
import pprint
sys.setrecursionlimit(2147483647)
INF = 100
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n = I()
A = sorted(LI())
ans = 0
cnt = Counter(A)
B = [0] * (10 ** 6 + 1)
for a in A:
if B[a] == 0 and cnt[a] == 1:
ans += 1
for i in range(a * 2, 10 ** 6 + 1, a):
B[i] = 1
print(ans)
| from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce
from operator import mul
import pprint
sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n = I()
A = sorted(LI())
ans = 0
cnt = Counter(A)
m = max(A) + 1
B = [0] * (10 ** 6 + 1)
for a in A:
if B[a] == 0 and cnt[a] == 1:
ans += 1
for i in range(a * 2, m, a):
B[i] = 1
print(ans)
| p02642 |
import bisect
import copy
N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
table = [True for i in range(N)]
cands = [i for i in range(N)]
for i in range(N):
if table[i]:
idx = bisect.bisect_left(cands, i)
del cands[idx]
if i < N-1 and A[i] == A[i+1]:
table[i] = False
new_cands = copy.deepcopy(cands)
for j in cands:
if A[j] % A[i] == 0:
table[j] = False
idx = bisect.bisect_left(new_cands, j)
del new_cands[idx]
cands = copy.deepcopy(new_cands)
print((table.count(True)))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
a_max = max(A)
table = [True for i in range(a_max+1)]
for a in A:
i = 2
k = a * 2
while k <= a_max:
table[k] = False
k += a
count = 0
for i, a in enumerate(A):
if i < N - 1 and A[i] == A[i+1]:
table[a] = False
if table[a]:
count += 1
print(count)
| p02642 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
L=list(map(int,input().split()))
count = 0
for i in range(n):
val = L[i]
for j in range(n):
if j!=i:
if L[i]%L[j]!=0:
continue
else:
count+=1
break
print((n-count))
| import sys
input = sys.stdin.readline
n=int(eval(input()))
L=list(map(int,input().split()))
L.sort()
hb = L[-1]
dp = [-1 for i in range(hb+1)]
for i in L:
if dp[i]!=0:
if dp[i]==1:
dp[i]=0
continue
dp[i]=1
for j in range(2*i,hb+1,i):
dp[j]=0
ans=0
for i in L:
if dp[i]==1:
ans+=1
print(ans)
| p02642 |
import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : list(map(int, input().split()))
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
n = int(eval(input()))
#b , c = tin()
#s = input()
al=lin()
vm=10**6+1
rr = [0]*(vm)
for v in al:
rr[v]+=1
for v in list(set(al)):
for i in range(2*v, vm, v):
rr[i]=0
ret = rr.count(1)
print(ret)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : list(map(int, input().split()))
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
n = int(eval(input()))
#b , c = tin()
#s = input()
al=lin()
vm=10**6+1
rr = [0]*(vm)
for v in al:
rr[v]+=1
ual=list(set(al))
ual.sort()
for v in ual:
if rr[v]==0:
continue
for i in range(2*v, vm, v):
rr[i]=0
ret = rr.count(1)
print(ret)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | p02642 |
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
cnt=[0]*((10**6)+1)
for elem in A:
cnt[elem]+=1
unique=[]
for i in range((10**6)+1):
if cnt[i]==1:
unique.append(i)
cnt=[0]*((10**6)+1)
for elem in A:
for m in range(elem*2,10**6+1,elem):
cnt[m]=1
ans=0
for i in unique:
if cnt[i]==0:
ans+=1
print(ans) | def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
cnt=[0]*((10**6)+1)
for elem in A:
cnt[elem]+=1
unique=[]
for i in range((10**6)+1):
if cnt[i]==1:
unique.append(i)
cnt=[0]*((10**6)+1)
A=list(set(A))
for elem in A:
for m in range(elem*2,10**6+1,elem):
cnt[m]=1
ans=0
for i in unique:
if cnt[i]==0:
ans+=1
print(ans) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
d = defaultdict(int)
for i in a:
d[i]+=1
arr = []
remain = set()
for i in d:
if d[i]!=1:
remain.add(i)
arr = a[:]
arr.sort()
if len(arr)==0:
print((0))
exit()
maxa = 10**6+1
ans = [0]*(maxa+1)
for i in arr:
ans[i]=1
for i in arr:
if ans[i]:
for j in range(i*2,len(ans),i):
ans[j]=0
tyo = 0
for i in remain:
if ans[i]==1:
tyo+=1
print((ans.count(1)-tyo)) | import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
d = defaultdict(int)
for i in a:
d[i]+=1
arr = []
remain = set()
for i in d:
if d[i]!=1:
remain.add(i)
arr = list(set(a))
arr.sort()
if len(arr)==0:
print((0))
exit()
maxa = 10**6+1
ans = [0]*(maxa+1)
for i in arr:
ans[i]=1
for i in arr:
if ans[i]:
for j in range(i*2,len(ans),i):
ans[j]=0
tyo = 0
for i in remain:
if ans[i]==1:
tyo+=1
print((ans.count(1)-tyo)) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
max_a = 10**6
ans = [[0,0] for i in range(max_a+1)]
for i in a:
ans[i][0]+=1
ans[i][1]+=1
for i in set(a):
if ans[i][1]>0:
for j in range(i*2,len(ans),i):
ans[j][0]+=2
count = 0
for i in ans:
if i[1]>0 and i[0]==1:
count+=1
print(count) | import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
max_a = 10**6
ans = [0]*(max_a+1)
for i in a:
ans[i]+=1
for i in set(a):
if ans[i]>0:
for j in range(i*2,len(ans),i):
ans[j]+=2
count = 0
print((ans.count(1))) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
max_a = 10**6
ans = [0]*(max_a+1)
for i in a:
ans[i]+=1
for i in set(a):
if ans[i]>0:
for j in range(i*2,len(ans),i):
ans[j]+=2
count = 0
print((ans.count(1))) | import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
#max_a = 10**6
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
ans[i]+=1
for i in set(a):
if ans[i]>0:
for j in range(i*2,len(ans),i):
ans[j]+=2
count = 0
print((ans.count(1))) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
#max_a = 10**6
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
if ans[i]!=2:
ans[i]+=1
for i in set(a):
if ans[i]<=2:
for j in range(i*2,len(ans),i):
ans[j]+=3
print((ans.count(1))) | import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
#max_a = 10**6
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
if ans[i]!=2:
ans[i]+=1
for i in set(a):
if ans[i]<=2:
for j in range(i*2,len(ans),i):
ans[j]=3
print((ans.count(1))) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
#max_a = 10**6
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
if ans[i]!=2:
ans[i]+=1
for i in set(a):
if ans[i]<=2:
for j in range(i*2,len(ans),i):
ans[j]=3
print((ans.count(1))) | import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
#max_a = 10**6
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
if ans[i]!=2:
ans[i]+=1
for i in set(a):
if ans[i]:
for j in range(i*2,len(ans),i):
ans[j]=0
print((ans.count(1))) | p02642 |
import math
from collections import deque
from collections import defaultdict
import itertools as it
#自作関数群
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
if len(res)==0:
res = [n]
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def combmod(n,r,mod):
return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
r=copyQueue(q)
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list([int(x) for x in list((zero+bin(x)[2:])[-1*n:])]))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
def maxValue(a,b,v):
v2 = v
for i in range(v2,-1,-1):
for j in range(v2//a+1): #j:aの個数
k = i-a*j
if k%b==0:
return i
return -1
def copyQueue(q):
nq = queue.Queue()
n = q.qsize()
for i in range(n):
x = q.get()
q.put(x)
nq.put(x)
return nq
def get_sieve_of_eratosthenes(n):
data = [2]
#data = [0,0,0]
for i in range(3,n+1,2):
data.append(i)
data.append(0)
for i in range(len(data)):
interval = data[i]
if interval!=0:
for j in range(i+interval,n-1,interval):
data[j] = 0
ans = [x for x in data if x!=0]
#ans = data[:]
return ans
n = readInt()
a = readInts()
a.sort()
max_a = a[-1]
ans = [0]*(max_a+1)
for i in a:
ans[i]+=1
for i in set(a):
if ans[i]:
for j in range(i*2,len(ans),i):
ans[j]=0
print((ans.count(1))) | n,a=int(eval(input())),sorted(list(map(int,input().split())))
m,s=a[-1],[0]*(a[-1]+1)
for i in a:s[i]+=1
for i in set(a):
if s[i]:
for j in range(i*2,m+1,i):s[j]=0
print((s.count(1))) | p02642 |
import itertools
n = int(eval(input()))
nlist = list(map(int, input().split()))
perm = list(itertools.permutations(nlist, 2))
ref = []
tmp = []
for num, j in enumerate(perm):
tmp.append(j[0] % j[1])
if (num + 1) % (len(nlist) - 1) == 0:
ref.append(tmp)
tmp = []
check = 0
for ind, i in enumerate(ref):
if 0 in i:
check += 1
print((len(nlist) - check)) | n = int(eval(input()))
nlist = list(map(int, input().split()))
check = 0
for inum, i in enumerate(nlist[:]):
for jnum, j in enumerate(nlist[:]):
if inum != jnum:
if i % j == 0:
check += 1
break
print((len(nlist) - check)) | p02642 |
def main():
numbers = int(eval(input()))
array = [int(x) for x in input().split()]
maximum = 1000001
counter = [0] * maximum
for x in array:
if counter[x] != 0:
counter[x] = 2
continue
else:
for multiple in range(x, maximum, x):
counter[multiple] += 1
ans = 0
for x in array:
if counter[x] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| def main():
eval(input())
array = sorted(int(x) for x in input().split())
maximum = 1000001
counter = [0] * maximum
for x in array:
if counter[x] != 0:
counter[x] = 2
continue
else:
for multiple in range(x, maximum, x):
counter[multiple] += 1
ans = 0
for x in array:
if counter[x] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02642 |
from collections import defaultdict
def main():
eval(input())
array = sorted(int(x) for x in input().split())
maximum = 1000003
counter = defaultdict(int)
for x in array:
counter[x] += 1
maximum = array[-1] + 1
candidates = [True] * maximum
for key, value in list(counter.items()):
if value > 1: # duplicate
candidates[key] = False
for i in range(key * 2, maximum, key):
candidates[i] = False
ans = sum(candidates[x] for x in array)
print(ans)
if __name__ == '__main__':
main()
| def main():
eval(input())
array = sorted(int(x) for x in input().split())
maximum = array[-1] + 1
counter = [0] * maximum
for x in array:
if counter[x] != 0:
counter[x] = 2
continue
else:
for multiple in range(x, maximum, x):
counter[multiple] += 1
ans = 0
for x in array:
if counter[x] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
if N == 1:
print((1))
exit()
check_list = [0] * (10**6 + 1)
cnt = 0
for i in range(len(A)):
tmp = A[i]
while True:
if tmp > 10**6:
break
check_list[tmp] += 1
tmp += A[i]
for a in A:
if check_list[a] == 1:
cnt += 1
print(cnt) | N = int(eval(input()))
A = sorted(list(map(int, input().split())))
if N == 1:
print((1))
exit()
check_list = [0] * (10**6 + 1)
cnt = 0
for i in range(len(A)):
tmp = A[i]
while True:
if tmp > A[-1]:
break
check_list[tmp] += 1
tmp += A[i]
for a in A:
if check_list[a] == 1:
cnt += 1
print(cnt) | p02642 |
M=10**7
A=[0]*M
_,*l=list(map(int,open(0).read().split()))
for i in sorted(l):
A[i]+=1
if A[i]==1:
for j in range(2*i,M,i):A[j]+=9
print((A.count(1))) | M=10**6+1
_,*l=list(map(int,open(0).read().split()))
a=[0]*M
for i in sorted(l):
a[i]+=1
if a[i]==1:
for j in range(2*i,M,i): a[j]+=9
print((a.count(1))) | p02642 |
M=10**7
_,*l=list(map(int,open(0).read().split()))
a=[0]*M
for i in sorted(l):
a[i]+=1
if a[i]==1:
for j in range(2*i,M,i):a[j]+=9
print((a.count(1))) | M=10**6+1
_,*l=list(map(int,open(0).read().split()))
a=[0]*M
for i in sorted(l):
a[i]+=1
if a[i]==1:
for j in range(2*i,M,i):a[j]+=9
print((a.count(1))) | p02642 |
n = int(eval(input()))
A = list(map(int, input().split()))
nux = max(A)
B = set(A)
A.sort()
ans = 0
table = [True]*(nux+1)
for ii, s in enumerate(A):
if table[s] == False:
continue
if ii == n-1:
ans += 1
elif A[ii+1] != s:
ans += 1
i = 1
while i*s <= nux:
table[i*s] = False
i += 1
print(ans)
| n = int(eval(input()))
A = sorted(map(int, input().split()))
nux = A[-1]+1
ans = 0
table = [True]*nux
for i, s in enumerate(A):
if table[s] == False:
continue
if i == n-1:
ans += 1
elif A[i+1] != s:
ans += 1
b = 1
while b*s < nux:
table[b*s] = False
b += 1
print(ans)
| p02642 |
n=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
M=10**6+1
cnt=[0]*M
for i in A:
if cnt[i]!=0:
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) | from collections import Counter
max_=10**6+1
ans=0
n=int(eval(input()))
data=list(map(int,input().split()))
b=[True]*(max_+1)
data.sort()
c=Counter(data)
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.