반응형
n = int(input())
a=input().split()
result=[]
def f(n):
found = True
if n < 2:
return -1
elif n == 2:
return n
else:
for i in range(2,int(n/2)+1):
if n%i==0:
found = False
if found:
return n
else:
return -1
for i in range(n):
if f(int(a[i]))!= -1:
result.append(a[i])
print(len(result))
반응형
'Algorithm > Baekjoon' 카테고리의 다른 글
11729 (0) | 2021.05.09 |
---|---|
2581 (0) | 2021.05.08 |
2839 (0) | 2021.05.08 |
2775 (0) | 2021.05.06 |
10250 (0) | 2021.05.06 |