input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import deque
import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, readline().split()))
a -= 1; b -= 1
G[a].append(b)
G[b].append(a)
def check(s, t):
u = [0]*N
u[s] = u[... | from collections import deque
import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, readline().split()))
a -= 1; b -= 1
G[a].append(b)
G[b].append(a)
def check(s, t):
u = [0]*N
u[s] = ... | p03091 |
import sys
def solve(n, m, links):
v4 = set()
v6 = 0
for v, link in enumerate(links):
l = len(link)
if l % 2 == 1:
return False
if l == 4:
v4.add(v)
elif l >= 6:
v6 += 1
if v6 > 0:
return True
if len(v4) > ... | import sys
def solve(n, m, links):
v4 = set()
v6 = 0
for v, link in enumerate(links):
l = len(link)
if l % 2 == 1:
return False
if l == 4:
v4.add(v)
elif l >= 6:
v6 += 1
if v6 > 0:
return True
if len(v4) > ... | p03091 |
# AGC032C
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
def hoge():
from collections import defaultdict
n, m = list(map(int, input().split()))
ns = defaultdict(set)
used = {}
for _ in range(m):
u,v = list(map(int, input().... | # AGC032C
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
def hoge():
from collections import defaultdict
n, m = list(map(int, input().split()))
ns = defaultdict(set)
used = {}
for _ in range(m):
u,v = list(map(int, input().sp... | p03091 |
# -*- coding: utf-8 -*-
from collections import defaultdict
def solve():
N, M = list(map(int, input().split()))
F = defaultdict(list)
D = defaultdict(int)
for _ in range(M):
a, b = list(map(int, input().split()))
D[a] += 1
D[b] += 1
F[a] += F[a] + [b]
... | # -*- coding: utf-8 -*-
def solve():
N, M = list(map(int, input().split()))
F = [list() for _ in range(N+1)]
D = [int() for _ in range(N+1)]
for _ in range(M):
a, b = list(map(int, input().split()))
D[a] += 1
D[b] += 1
F[a].append(b)
F[b].append(a)
... | p03091 |
while 1:
a, b, c = list(map(int, input().split()))
if not a:
break
n = eval(input())
I = []; J = []; K = []
res = [2]*(a+b+c)
for p in range(n):
i, j, k, r = list(map(int, input().split()))
i -= 1; j -= 1; k -= 1
if r:
res[i] = res[j] = re... | while 1:
a, b, c = list(map(int, input().split()))
if not a:
break
I = []
res = [2]*(a+b+c)
for p in range(int(input())):
i, j, k, r = list(map(int, input().split()))
i -= 1; j -= 1; k -= 1
if r:
res[i] = res[j] = res[k] = 1
else:
... | p00437 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "lazy"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.el... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "lazy"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.el... | p02350 |
import math
from collections import deque
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "lazy"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
... | import math
from collections import deque
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "lazy"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
... | p02350 |
INT_MAX = (1<<31) - 1
_N,query_num = list(map(int, input().split()))
queries = [list(map(int, input().split())) for i in range(query_num)]
N = 1<<17
arr_size = 2*N - 1
A = [INT_MAX]*(arr_size)
lazy_A = [None]*(arr_size)
def tree_propagate(k):
if(lazy_A[k] is None):
return
if(k < N // 2):
... | INT_MAX = (1<<31) - 1
_N,query_num = list(map(int, input().split()))
queries = [list(map(int, input().split())) for i in range(query_num)]
N = 1<<17
N1 = N - 1
N2 = N1 // 2
arr_size = 2*N - 1
A = [INT_MAX]*(arr_size)
lazy_A = [-1]*(arr_size)
def tree_propagate(k):
if(lazy_A[k] == -1):
return
... | p02350 |
from math import log2, ceil
class SegmentTree:
def __init__(self, n):
self.n = n
tn = 2 ** ceil(log2(n))
self.a = [2 ** 31 - 1] * (tn * 2)
self.tn = tn
def find(self, s, t):
return self.__find(1, 0, st.n - 1, s, t)
def __find(self, c, l, r, s, t):
... | from math import log2, ceil
class SegmentTree:
def __init__(self, n):
self.n = n
tn = 2 ** ceil(log2(n))
self.a = [2 ** 31 - 1] * (tn * 2)
self.tn = tn
def find(self, s, t):
return self.__find(1, 0, self.tn - 1, s, t)
def __find(self, c, l, r, s, t):
... | p02350 |
n, c = list(map(int, input().split()))
sushi = []
for i in range(n):
x, v = list(map(int, input().split()))
sushi.append((x, v))
sushi.sort()
sushi_reversed = list(reversed([(c - x, v) for x, v in sushi]))
# def solve(s, sr):
# d = 0
# v = 0
# v_d_max = (0, 0)
# v_2d_max = (0, 0)
... | n, c = list(map(int, input().split()))
sushi = []
for i in range(n):
x, v = list(map(int, input().split()))
sushi.append((x, v))
sushi.sort()
sushi_reversed = list(reversed([(c - x, v) for x, v in sushi]))
def accum_max(s):
v = 0
res = [(0, 0)]
for x_i, v_i in s:
v += v_i
... | p03374 |
import sys
N,C = list(map(int,input().split()))
table=[]
for i in range(N):
x,v=list(map(int,input().split()))
table.append([x,v])
ans=0
if N==1:
ans=max(0,table[0][1]-table[0][0],table[0][1]+table[0][0]-C)
print(ans)
sys.exit()
V=[0]*N
clo=[0]*N
V[0]=table[0][1]
clo[0]=V[0]-table[0][0... | N,C = list(map(int,input().split()))
X=[]
V=[]
for i in range(N):
x,v=list(map(int,input().split()))
X.append(x)
V.append(v)
#時計回りで見る
R=[0]*(N+1)#0番目は１に格納する
Rans=[0]*(N+1)
for i in range(N):
R[i+1]=R[i]+V[i]
Rans[i+1]=max(Rans[i],R[i+1]-X[i])
L=[0]*(N+1)
Lans=[0]*(N+1)
for i in range(... | p03374 |
import sys
input=sys.stdin.readline
def main():
N,C = list(map(int, input().split()))
X = []
for _ in range(N):
X.append(list(map(int, input().split())))
cw = [0] # 時計回りに数えて i 番目までを食べた時に摂取できるカロリー
ccw = [0] # 反時計回り
for i in range(N):
cw.append(cw[i] + X[i][1])
... | import sys
input=sys.stdin.readline
def main():
N,C = list(map(int, input().split()))
X = []
for _ in range(N):
X.append(list(map(int, input().split())))
cw = [0] # 時計回りに数えて i 番目までを食べた時に摂取できるカロリー
ccw = [0] # 反時計回り
for i in range(N):
cw.append(cw[i] + X[i][1])
... | p03374 |
N, C = list(map(int, input().split()))
xs = []
vs = []
for i in range(N):
x, v = list(map(int, input().split()))
xs += [x]
vs += [v]
sumVtos = [vs[0]]
for i in range(1, N):
sumVtos += [sumVtos[-1] + vs[i]]
sumV = sumVtos[-1]
sumVfrs = [sumV]
for i in range(1, N):
sumVfrs += [sumVfrs... | N, C = list(map(int, input().split()))
xs = []
vs = []
for i in range(N):
x, v = list(map(int, input().split()))
xs += [x]
vs += [v]
fAs = [0] * N
fAs[0] = vs[0]
for A in range(1, N):
fAs[A] = fAs[A - 1] + vs[A]
for A in range(N):
fAs[A] -= xs[A]
gAs = [0] * N
gAs[0] = 0
for A i... | p03374 |
import random
def slv(N, C, X, V):
# cal_l = 0
# move = 0
# for x, v in zip(X, V):
# if x-move > v:
# break
# cal_l += v
# move = x
# cal_l -= move
# cal_r = 0
# move = 0
# tmp =list(zip(X, V))
# for x, v in tmp[::-1]:
# if ... | import random
def slv(N, C, X, V):
ans_l = [(0, 0)]
ans_l_ = [0]
for x, v in zip(X, V):
ans_l_.append(max(ans_l_[-1], ans_l[-1][1] + v - x))
ans_l.append((x, ans_l[-1][1] + v))
ans_l_.pop(0)
ans_l.pop(0)
ans_r = [(0, 0)]
ans_r_ = [0]
for x, v in list(zip(... | p03374 |
n, c = list(map(int, input().split()))
lx, lv = [], []
for _ in range(n):
tmpx, tmpv = list(map(int, input().split()))
lx.append(tmpx)
lv.append(tmpv)
lux = [c-x for x in reversed(lx)]
#両方向の累積和
tmpv1, tmpv2 = 0,0
vc, vuc = [],[]
for i in range(n):
tmpv1 += lv[i]
tmpv2 += lv[n-1-i... | n, c = list(map(int, input().split()))
lx, lv = [], []
for _ in range(n):
tmpx, tmpv = list(map(int, input().split()))
lx.append(tmpx)
lv.append(tmpv)
lux = [c-x for x in reversed(lx)]
#両方向の累積和
tmpv1, tmpv2 = 0,0
vc, vuc = [],[]
for i in range(n):
tmpv1 += lv[i]
tmpv2 += lv[n-1-i... | p03374 |
from itertools import accumulate
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, C = list(map(int, input().split()))
posDist = []
posVal = []
for _ in range(N):
d, v = list(map(int, input().split()))
posDist.append(d)
posVal.append(v)
negD... | # python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, C = list(map(int, input().split()))
sushis = [list(map(int, input().split())) for _ in range(N)]
# Aを時計回り,Bを反時計回りとする
# O->Aと0->A->Oのコストを計算
valA = []
valArev = []
sumV = 0
tmpMax = -float('inf')
for d, v ... | p03374 |
N,C=list(map(int, input().split()))
#Aは時計回り
A,B=[],[]
allv=0
for i in range(N):
a,b=list(map(int, input().split()))
A.append([a,b])
B.append([C-a,b])
allv+=b
A,B=sorted(A),sorted(B)
OA,OB,AS,BS=[],[],[],[]
ax,av,bx,bv=0,0,0,0
for i in range(N):
ax,bx=A[i][0],B[i][0]
av+=A[i][1]
bv+=B[i][1]
... | N,C=list(map(int, input().split()))
#Aは時計回り
A,B=[],[]
allv=0
for i in range(N):
a,b=list(map(int, input().split()))
A.append([a,b])
B.append([C-a,b])
allv+=b
A,B=sorted(A),sorted(B)
OA,OB,AS,BS=[],[],[],[]
ax,av,bx,bv=0,0,0,0
for i in range(N):
ax,bx=A[i][0],B[i][0]
av+=A[i][1]
bv+=B[i][1]
... | p03374 |
n, c = list(map(int, input().split()))
xv = [[int(x) for x in input().split()] for _ in range(n)]
n += 1
oa = [0] * n
ob = [0] * n
xv.insert(0, [0, 0])
maxcal = 0
for i in range(1,n):
oa[i] = oa[i-1] + xv[i][1]
ob[n-1] = xv[i][1]
for i in reversed(list(range(0,n-1))):
ob[i] = xv[i][1] + ob[i+1]
for ... | n, c = list(map(int, input().split()))
xv = [[int(x) for x in input().split()] for _ in range(n)]
xv.insert(0, [0, 0])
n += 1
oa = [0] * (n + 1)
ob = [0] * (n + 1)
maxr = [0] * (n + 1)
maxl = [0] * (n + 1)
for i in range(1, n):
oa[i] = oa[i - 1] + xv[i][1]
maxr[i] = max(maxr[i - 1], oa[i] - xv[i][0])
... | p03374 |
n,c=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
rev=[None]*(n+1)
norm=[None]*(n+1)
rev[0]=(0,0)
norm[0]=(0,0)
ans=0
# normal rotation
for i in range(1,n+1):
x,v=l[i-1]
norm[i]=(x,v+norm[i-1][1])
# reverse rotation
for i in range(1,n+1)[::-1]:
x,v=l[... | n,c=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
rev=[None]*(n+1)
norm=[None]*(n+1)
revmax=[None]*(n+1)
rev[0]=(0,0)
revmax[0]=(0,0)
norm[0]=(0,0)
ans=0
# normal rotation
for i in range(1,n+1):
x,v=l[i-1]
norm[i]=(x,v+norm[i-1][1])
# reverse rotation
... | p03374 |
N, C = [int(_) for _ in input().split()]
xv = [[int(_) for _ in input().split()] for i in range(N)]
def solve(N, C, xv):
from itertools import accumulate
xs = [0] + [_[0] for _ in xv] + [C]
vs = [0] + [_[1] for _ in xv] + [0]
xs_rev = [C - x for x in xs[::-1]]
vs_rev = vs[::-1]
... | N, C = [int(_) for _ in input().split()]
xv = [[int(_) for _ in input().split()] for i in range(N)]
def solve(N, C, xv):
from itertools import accumulate
xs = [0] + [_[0] for _ in xv] + [C]
vs = [0] + [_[1] for _ in xv] + [0]
xs_rev = [C - x for x in xs[::-1]]
vs_rev = vs[::-1]
... | p03374 |
N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
count = 0
Sosu = True
for i in range(0,N):
Sosu = True
for j in range(2,a[i]):
if a[i] % j == 0:
Sosu = False
break
else :
pass
if Sosu :
count... | N = int(eval(input()))
a = []
count = 0
for i in range(N):
x=int(eval(input()))
if x == 2:
count+=1
else:
if pow(2, x-1,x ) == 1:
count+=1
else:
pass
print(count)
| p02257 |
import sys
def is_prime(x,y):
while(y < x):
if(x % y == 0):
return 0
y += 2
return 1
a = ""
l = []
count = 0
for input in sys.stdin:
a += input
l = (a.split())
b = int(l[0])
l = sorted(set(l[1:]))
for i in l:
if(int(i) == 2):
count += 1
elif(... | import sys
def is_prime(x):
if(x <= 3 and x > 1):
return True
elif(x % 2 == 0 or x % 3 == 0 or x < 2):
return False
i = 5
while(i * i <= x):
if(x % i == 0 or x % (i + 2) == 0):
return False
i += 6
return True
l = []
count = 0
for input in... | p02257 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
import math
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
i = 3
x_sqrt = math.sqrt(x)
while i <... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
return pow(2, x - 1, x) == 1
def solve(_c_list):
c... | p02257 |
import math
def isPrime(x) :
if x == 2 :
return True
if x < 2 or x % 2 == 0 :
return False
i = 3
while i <= math.sqrt(x) :
if x % i == 0 :
return False
i += 2
return True
def main() :
n = int(eval(input()))
nums = []
... | def is_prime(x) :
if x == 2 :
return True
if x < 2 or x % 2 == 0 :
return False
return pow(2, x-1, x) == 1
def main() :
n = int(eval(input()))
nums = []
for _ in range(n) :
x = int(eval(input()))
nums.append(x)
count = 0
for num in nums ... | p02257 |
def is_prime(x):
if x == 1:
return False
l = x ** 0.5
n = 2
while n <= l:
if x % n == 0:
return False
n += 1
return True
import sys
def solve():
file_input = sys.stdin
N = file_input.readline()
cnt = 0
for l in file_input:
... | def is_prime(x):
if x == 1:
return 0
l = x ** 0.5
n = 2
while n <= l:
if x % n == 0:
return 0
n += 1
return 1
import sys
def solve():
N = int(eval(input()))
cnt = 0
for i in range(N):
cnt += is_prime(int(eval(input())))
... | p02257 |
def is_prime(x):
if x == 2:
return 1
elif x % 2 == 0:
return 0
l = x ** 0.5
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return 0
return 1
import sys
def solve():
file_input = sys.stdin
N = file_input.readline()
cnt = 0
... | # Fermat's little theorem
def is_prime(x):
if x == 2:
return 1
elif x % 2 == 0:
return 0
else:
return pow(2, x - 1, x) == 1
import sys
def solve():
file_input = sys.stdin
N = file_input.readline()
cnt = 0
for n in map(int, file_input):
cnt +=... | p02257 |
n = int(eval(input()))
count = 0
for i in range(n):
check = True
key = int(eval(input()))
for i in range(2,key):
if key % i == 0:
check = False
if check:
count += 1
print(count)
| def isPrime(n):
for i in range(2, n):
if i * i > n:
return 1
if n % i == 0:
return 0
return 1
ans = 0
n = int(eval(input()))
for i in range(n):
x = int(eval(input()))
ans = ans + isPrime(x)
print(ans)
| p02257 |
prime_numbers = [2]
def is_prime(n):
if n in prime_numbers: return True
if n > prime_numbers[-1]:
for i in range(prime_numbers[-1] + 1, n):
is_prime(i)
for i in prime_numbers:
if i ** 2 > n: break
if n % i == 0: return False
prime_numbers.append(n)
return True
N = int(eval(inp... | def is_prime(n):
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0: return False
return True
count = 0
for i in range(int(eval(input()))):
if is_prime(int(eval(input()))) : count += 1
print(count) | p02257 |
import math
def prime(n):
for i in range(2, int(n/2)+1):
if n % i == 0:
return False
return True
num_prime = []
k = 0
while True:
try:
n = eval(input())
except:
break
if prime(int(n)):
if not int(n) in num_prime:
k += 1
... | import math
def prime(n):
for i in range(2, int(math.sqrt(n))+1):
if n % i == 0:
return False
return True
num_prime = []
k = 0
while True:
try:
n = eval(input())
except:
break
if prime(int(n)):
if not int(n) in num_prime:
k ... | p02257 |
c=0
n=int(eval(input()))
for _ in range(n):
x=int(eval(input()))
for i in range(2,int(x**.5+1)):
if x%i==0:c+=1;break
print((n-c))
| c=0
n=int(eval(input()))
for _ in range(n):
x=int(eval(input()))
if x!=2 and x%2==0:c+=1;continue
for i in range(3,int(x**.5+1),2):
if x%i==0:c+=1;break
print((n-c))
| p02257 |
c=0
for _ in[0]*int(eval(input())):
x=int(eval(input()))
if 2 in[x,pow(2,x,x)]:c+=1
print(c)
| import sys
eval(input());c=0
for e in sys.stdin:
x=int(e)
if 2 in[x,pow(2,x,x)]:c+=1
print(c)
| p02257 |
import sys
eval(input());c=0
for x in map(int,sys.stdin):
if 2 in[x,pow(2,x,x)]:c+=1
print(c)
| import sys
eval(input())
print((sum(2 in[x,pow(2,x,x)]for x in map(int,sys.stdin))))
| p02257 |
import sys
eval(input())
def f():print((sum(2 in[x,pow(2,x,x)]for x in map(int,sys.stdin))))
f()
| import sys
eval(input())
print((sum(2 in[x,pow(2,x,x)]for x in map(int,sys.stdin.readlines()))))
| p02257 |
import sys
import math
def get_prime(m):
a = [2]+[i for i in range(3,m+1,2)]
end = int(math.sqrt(m))
for i in range(3, end, 2):
if (i in a):
for j in range(i*2, m, i):
if (j in a):
a.remove(j)
return a
n = int(eval(input())... | import math
n = int(eval(input()))
cnt = 0
for i in range(n):
num = int(eval(input()))
flag = True
for j in range(2, int(math.sqrt(num))+1):
if num%j == 0:
flag = False
break
if flag:
cnt+=1
print(cnt) | p02257 |
import math
def is_prime(num):
i = 2
while i <= math.sqrt(num):
if num % i == 0:
return False
i = i + 1
return True
N = int(eval(input()))
cnt = 0
for i in range(0, N):
n = int(eval(input()))
if (is_prime(n)):
cnt = cnt + 1
print(cnt) | def is_prime(num):
i = 2
while i*i <= num:
if num % i == 0:
return False
i = i + 1
return True
N = int(eval(input()))
cnt = 0
for i in range(0, N):
n = int(eval(input()))
if (is_prime(n)):
cnt = cnt + 1
print(cnt) | p02257 |
def checker(x):
for i in range(2,x//2+1):
if x % i == 0:
return False
return True
cnt = 0
q = int(eval(input()))
for _ in range(q):
v=int(eval(input()))
if checker(v):
cnt += 1
print(cnt) | def checker(x):
if x == 2:
return True
if x < 2 or x % 2 == 0 :
return False
for i in range(2,int(x**0.5)+1):
if x % i == 0 :
return False
return True
cnt=0
q=int(eval(input()))
for _ in range(q):
v=int(eval(input()))
if checker(v):
cnt... | p02257 |
import math
def prime_numbers(numbers):
return list(map(is_prime, numbers)).count(True)
def is_prime(n):
if (n == 2):
return True
elif (n % 2 == 0):
return False
else:
for i in range(3, int(n / 2), 2):
if n % i == 0:
return False
... | import math
def prime_numbers(numbers):
return list(map(is_prime, numbers)).count(True)
def is_prime(n):
if (n == 2):
return True
elif (n % 2 == 0):
return False
else:
i = 3
while i <= math.sqrt(n):
if n % i == 0:
return False... | p02257 |
def isPrime(n):
if n <= 2:
return n == 2
if (n % 2 == 0):
return False
for i in range(3, n // 2 + 1, 2):
if n % i == 0:
return False
return True
N = int(eval(input()))
print((len(list(filter(isPrime, [int(eval(input())) for i in range(N)])))))
| import math
def isPrime(n):
if n <= 2:
return n == 2
if (n % 2 == 0):
return False
for i in range(3, int(math.sqrt(n)) + 2, 2):
if n % i == 0:
return False
return True
N = int(eval(input()))
print((len(list(filter(isPrime, [int(eval(input())) for i ... | p02257 |
def isprime(n):
if n < 2: return 0
elif n == 2: return 1
if n % 2 == 0: return 0
for i in range(3, n, 2):
if n % i == 0 : return 0
return 1
N = int(eval(input()))
n = [int(eval(input())) for i in range(N)]
a = [i for i in n if isprime(i)]
print((len(a)))
| def isprime(n):
if n < 2: return 0
elif n == 2: return 1
if n % 2 == 0: return 0
for i in range(3, n, 2):
if i > n/i: return 1
if n % i == 0 : return 0
return 1
N = int(eval(input()))
n = [int(eval(input())) for i in range(N)]
a = [i for i in n if isprime(i)]
p... | p02257 |
def prime(n):
if (n==2):
return True
elif(n == 1):
return False
else:
pr = [2]
for i in range(3,n):
c = 0
for p in pr:
if (i % p != 0):
c = c + 1
if (c == len(pr)):
if n%i == ... | n = int(eval(input()))
mlist = []
for i in range(n):
m = int(eval(input()))
mlist.append(m)
mlist.sort()
plist = [2]
for i in range(3,mlist[-1]+1):
count = 0
for k in plist:
if (i%k != 0):
count += 1
else:
break
if (count == len(plist)):
... | p02257 |
import math
def prime_numbers(x):
i_a = list(range(2, x+1))
p_a = list()
e_a = math.sqrt(x)
h = i_a[0]
while h < e_a:
h = i_a[0]
p_a.append(h)
for j in i_a:
if j % h == 0:
i_a.remove(j)
p_a += i_a
p_a.sort()
return p_a
... | import math
def is_prime(x):
if x == 2:
return True
if x % 2 == 0 or x < 2:
return False
i = 3
x_sqrt = math.sqrt(x)
while i <= x_sqrt:
if x % i == 0:
return False
i += 2
return True
if __name__ == "__main__":
n = int(eval(i... | p02257 |
x = int(eval(input()))
count = 0
for i in range(0, x):
a = int(eval(input()))
if a == 2 or a == 3:
count += 0
elif a == 4:
count += 1
c =int(a / 2)
for j in range ( 2, c ):
if a % j == 0:
count += 1
break;
print((x-count))
... | x = int(eval(input()))
count = 0
for i in range(0, x):
a = int(eval(input()))
for j in range ( 2, a ):
c = int(a)
if a % j == 0:
count += 1
break;
if j * j > c:
break;
print((x-count))
| p02257 |
prime_list = [2,3,5,7,11]
def appendp(num):
for i in range(prime_list[-1], num+1, 2):
for j in prime_list:
if i % j == 0 or i in prime_list:
break
if j == prime_list[-1]:
prime_list.append(i)
def prime_number():
n = int(eval(input()))
... | def isPrime(num):
if num < 2: return False
if num == 2: return True
if num % 2 == 0: return False
sqrtnum = num ** 0.5
for i in range(3, int(sqrtnum + 1), 2):
if num % i == 0:
return False
return True
def prime_number():
n = int(eval(input()))
count = 0... | p02257 |
n = int(eval(input()))
prime = 0
for i in range(n):
m = int(eval(input()))
cout = 0
for j in range(m):
if m % (j+1) == 0:
cout += 1
if cout == 2:
prime += 1
print(prime) | n = int(eval(input()))
prime = 0
def is_prime(q):
if q == 2:
return True
if q < 2:
return False
return pow(2, q-1, q) == 1
prime = 0
for i in range(n):
m = int(eval(input()))
if is_prime(m):
prime += 1
print(prime) | p02257 |
def main():
n = int(eval(input()))
count = 0
for _ in range(n):
x = int(eval(input()))
count += isprime(x)
print(count)
def isprime(x: int):
if x == 2:
return True
if x % 2 == 0:
return False
for y in range(3, int(x**0.5)+1, 2):
if x % y... | def main():
A = set()
n_prime = 0
while True:
try:
x = int(eval(input()))
A.add(x)
except:
break
for x in A:
n_prime += is_prime(x)
print(n_prime)
def is_prime(x):
if x == 2:
return 1
elif x % 2 == 0... | p02257 |
def miller_rabin(n):
""" primality Test
if n < 3,825,123,056,546,413,051, it is enough to test
a = 2, 3, 5, 7, 11, 13, 17, 19, and 23.
Complexity: O(log^3 n)
"""
if n == 2: return True
if n <= 1 or not n&1: return False
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]
... | def miller_rabin(n):
""" primality Test
if n < 3,825,123,056,546,413,051, it is enough to test
a = 2, 3, 5, 7, 11, 13, 17, 19, and 23.
Complexity: O(log^3 n)
"""
if n == 2: return True
if n <= 1 or not n&1: return False
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]
... | p02257 |
n=int(eval(input()))
x=[0]*n
for i in range(n):
x[i]=int(eval(input()))
cnt=0
cnt2=0
for i in range(n):
for j in range(1,x[i]+1):
if x[i]%j==0:
cnt+=1
if cnt==2:
cnt2+=1
cnt=0
print(cnt2)
| import math
N=int(eval(input()))
A=[0 for i in range(N)]
for i in range(N):
A[i]=int(eval(input()))
c=0
cnt=0
for k in range(N):
x=math.sqrt(A[k])
x=(int)(x)
for j in range(2,x+1):
if A[k]%j==0:
cnt+=1
break
if cnt==0:
c+=1
cnt=0
print(c)
| p02257 |
class PrimeChecker(object):
def __init__(self):
self.primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]
def isPrime(self, n):
if n in self.primes:
return True
elif n < 53:
return False
else:
for i in self.primes:
... | class PrimeChecker:
def __init__(self):
self.primes = [2,3]
def isPrime(self, n):
if n in self.primes:
return True
else:
for i in self.primes:
if n % i == 0:
return False
i = 5
w = 2
w... | p02257 |
class PrimeChecker:
def __init__(self):
self.primes = [2,3,5]
def isPrime(self, n):
if n in self.primes:
return True
elif n < self.primes[-1]:
return False
else:
for i in self.primes:
if n % i == 0:
... | f=lambda x: 1 if x==2 or x==3 or (not x<2 and not x&1==0 and pow(2,x-1,x)==1) else 0
print((sum(f(int(eval(input()))) for _ in range(int(eval(input()))))))
| p02257 |
f=lambda x: 1 if x==2 or x==3 or (not x<2 and not x&1==0 and pow(2,x-1,x)==1) else 0
print((sum(f(int(eval(input()))) for _ in range(int(eval(input()))))))
| f=lambda x: 1 if x == 2 or x == 3 or (x>3 and x&1==1 and pow(2, x-1, x)==1) else 0
print((sum(f(int(eval(input()))) for _ in range(int(eval(input()))))))
| p02257 |
from sys import stdin
import math
def isPrime(x):
if x == 2 or x == 3: return True
elif (x < 2 or x % 2 == 0 or x % 3 == 0): return False
s = int(math.sqrt(x) + 1)
for i in range(5, s + 1, 2):
if x % i == 0: return False
return True
n = int(stdin.readline())
cnt = 0
for i in range... | from sys import stdin
def isPrime(x):
if x == 2: return 1
elif x % 2 == 0: return 0
return pow(2, x - 1, x) == 1
n = int(stdin.readline())
cnt = 0
for i in range(0, n):
cnt += isPrime(int(stdin.readline()))
print(cnt) | p02257 |
import sys
readline = sys.stdin.readline
prime = set([2])
for i in range(3, 10000, 2):
for j in prime:
if i % j == 0:
break
else:
prime.add(i)
n = int(eval(input()))
cnt = 0
for i in (int(readline()) for _ in range(n)):
if i in prime:
cnt += 1
contin... | from sys import stdin
import math
def isPrime(x):
if x == 2 or x == 3: return True
elif (x < 2 or x % 2 == 0 or x % 3 == 0): return False
s = int(math.sqrt(x) + 1)
for i in range(5, s + 1, 2):
if x % i == 0: return False
return True
print((sum([isPrime(int(stdin.readline())) for _ i... | p02257 |
#!/usr/bin/env python3
from functools import lru_cache
from itertools import count, takewhile
def prime():
prime = []
def _isPrime(n):
for d in takewhile(lambda x: x * x <= n, prime):
if n % d == 0:
return False
return True
for i in count(2):
... | #!/usr/bin/env python3
from itertools import takewhile
from math import sqrt
def is_prime(primes, i):
if i in primes:
return True
for p in takewhile(lambda x: x * x <= i, sorted(primes)):
if i % p == 0:
return False
return True
def sieve_of_eratosthenes(max):
... | p02257 |
import math
def isprime(x):
p = [2]
if x == 2:
return True
if x == 3:
return True
if max(p) < x**0.5:
for j in range(max(p), math.floor(x**0.5) + 1):
if all([j % k != 0 for k in p]):
p.append(j)
i = 0
while i <= len(p)-1:
... | import math
p = [2]
def isprime(x):
if x == 2:
return True
if x == 3:
return True
if max(p) < x**0.5:
for j in range(max(p), math.floor(x**0.5) + 1):
if all([j % k != 0 for k in p]):
p.append(j)
i = 0
while i <= len(p)-1:
... | p02257 |
import math
def is_prime(n):
global primes
if n == 1:
return False
if n == 2:
return True
if n % 2 == 0:
return False
s = int(math.sqrt(n))
for x in range(3, s + 1, 2):
if n % x == 0:
return False
else:
return True
... | import math
def is_prime(n):
global primes
if n == 1:
return False
if n == 2:
return True
if n % 2 == 0:
return False
s = int(math.sqrt(n))
for x in range(3, s + 1, 2):
if n % x == 0:
return False
else:
return T... | p02257 |
N = eval(input())
c = 0
p = [0 for i in range(N)]
for i in range(0,N):
p[i] = eval(input())
for i in range(N):
j = p[i]-1
while(j > 1):
if(p[i]%j == 0):break
j -= 1
if(j == 1):
c += 1
print(c) | import math
N = eval(input())
c = 0
p = [0 for i in range(N)]
for i in range(0,N):
p[i] = eval(input())
for i in range(N):
s = math.sqrt(p[i])
j = 2
while(j <= s):
if(p[i]%j == 0):
break
j += 1
if(j > s):
c += 1
print(c) | p02257 |
def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | p02257 |
def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | p02257 |
def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | def maybe_prime(d,s,n):
for a in (2,3,5,7):
p = False
x = pow(a,d,n)
if x==1 or x==n-1:
continue
for i in range(1,s):
x = x*x%n
if x==1: return False
elif x == n-1:
p = True
break
if n... | p02257 |
import math
n = int(input())
cnt = 0
for i in range(n):
j = 2
num = int(input())
while j <= math.sqrt(num):
if num % j == 0:
break
j+=1
if j > math.sqrt(num):
cnt+=1
print(cnt)
| import math
n = int(eval(input()))
cnt = 0
for i in range(n):
num = int(eval(input()))
flag = 1
if num == 2:
flag = 1
elif num % 2 == 0 or num < 2:
flag = 0
else:
for j in range(3, int(math.sqrt(num))+1, 2):
if num % j == 0:
flag = 0... | p02257 |
def primeq(x):
if x==1:return False
for i in range(2,x):
if x%i==0:return False
return True
c=0
for i in range(int(eval(input()))):
if primeq(int(eval(input()))):c+=1
print(c)
| def primeq(x):
if x==1:return False
for i in range(2,int(x**.5)+1):
if x%i==0:return False
return True
c=0
for i in range(int(eval(input()))):
if primeq(int(eval(input()))):c+=1
print(c)
| p02257 |
def is_prime(n):
ps = [2, 3, 5, 7, 11, 13, 17]
for p in ps:
if n == p: return 1
if n % p == 0: return 0
t = 19
while n > t:
if n % t == 0: return 0
t += 2
return 1
c = 0
for _ in range(int(eval(input()))):
c += is_prime(int(eval(input())))
print(c)
| def is_prime(x):
if x == 2: return 1
if x % 2 == 0: return 0
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0: return 0
return 1
c = 0
for _ in range(int(eval(input()))):
c += is_prime(int(eval(input())))
print(c)
| p02257 |
primes = [2]
def is_prime(num):
root = num ** 0.5
for prime in primes:
if root < prime:
break
if num % prime == 0:
return False
return True
def create_primes(primes, max):
for i in range(primes[-1] + 1,max):
if is_prime(i):
prim... | primes = [2]
def is_prime(num):
root = num ** 0.5
for prime in primes:
if root < prime:
break
if num % prime == 0:
return False
return True
def create_primes(primes, max):
for i in range(primes[-1] + 1,max):
if is_prime(i):
prim... | p02257 |
def judge_prime(x):
A = list(range(2,x+1))
while A[-1]==x:
if A[0]==x: return True
A = list([y for y in A if y%A[0]!=0])
return False
if __name__=='__main__':
N=int(eval(input()))
cnt=0
for _ in range(N):
if judge_prime(int(eval(input()))): cnt+=1
print(c... | def is_prime(x):
if x == 2:
return True
if x < 2 or x%2==0:
return False
i = 3
while i <= x**(0.5):
if x%i==0:
return False
i+=2
return True
if __name__=='__main__':
N=int(eval(input()))
cnt=0
for _ in range(N):
if is_p... | p02257 |
import math
ans = 0
N = int(eval(input()))
for i in range(N):
a = int(eval(input()))
if a != 2 and a%2 == 0:
continue
b = True
for j in range(3, int(math.sqrt(a))+1, 2):
if a%j == 0:
b = False
if b:
ans += 1
print(ans) | ans = 0
N = int(eval(input()))
for i in range(N):
a = int(eval(input()))
if a == 2:
ans += 1
elif a%2 == 0:
continue
else:
if pow(2, a-1, a) == 1:
ans += 1
print(ans) | p02257 |
def isPrime( x ):
if 2 == x or 3 == x:
return True
if 0 == x%2:
return False
i = 3
while i*i <= x:
if 0 == x%i:
return False
i += 1
return True
n = int( eval(input( )) )
cnt = i = 0
while i < n:
num = int( eval(input( )) )
if isPrime( num ):
cnt += 1
i += 1
print( cnt ) | def isPrime( x ):
if 2 == x or 3 == x:
return True
if 0 == x%2:
return False
i = 3
while i*i <= x:
if 0 == x%i:
return False
i += 1
return True
n = int( input( ) )
nums = []
i = 0
while i < n:
nums.append( int( input( ) ) )
i += 1
cnt = i = 0
for num in nums:
if isPrime( num ... | p02257 |
cnt = 0
for i in range(int(eval(input()))):
x = int(eval(input()))
flg = False # なんらかの数で割り切れるかどうか
if x == 1:
continue
if x == 2:
cnt += 1
continue
for k in range(2, x):
if not(x % k):
flg = True
break
if not flg:
cnt +... | import math
cnt = 0
for i in range(int(eval(input()))):
x = int(eval(input()))
flg = False # なんらかの数で割り切れるかどうか
if x == 1:
continue
if x == 2:
cnt += 1
continue
for k in range(2, math.floor(math.sqrt(x))+1):
if not(x % k):
flg = True
... | p02257 |
n = int(eval(input()))
c = 0
for i in range(n):
x = int(eval(input()))
counter = 0
for j in range(x):
if x % (j+1) == 0:
counter = counter + 1
if counter == 2:
c = c + 1
print(c) | n = int(eval(input()))
c = 0
def devisor(n):
if n == 2:
return 1
else:
if n < 2 or n % 2 == 0:
return 0
elif pow(2,n-1,n) == 1:
return 1
else: return 0
for i in range(n):
x = int(eval(input()))
c += devisor(x)
print(c) | p02257 |
import math
def is_prime(num):
if num <= 1: return False
if num == 2: return True
if num % 2 == 0: return False
i = 3
while i <= num**0.5:
if num % i == 0: return False
i += 2
return True
n = int(eval(input()))
count = 0
for i in range(n):
m = int(eval(input()))
if is_prime(m):
count +=... | def is_prime(num):
if num <= 1: return False
if num == 2: return True
if num % 2 == 0: return False
i = 3
while i <= num**0.5:
if num % i == 0: return False
i += 2
return True
n = int(eval(input()))
cnt = 0
for i in range(n):
if is_prime(int(eval(input()))):
cnt += 1
print(cnt)
| p02257 |
c = 0
n = int(eval(input()))
for _ in range(n):
t = int(eval(input()))
for i in range(2,t):
if t%i==0:
break
else:
c+=1
print(c) | import math
c = 0
n = int(eval(input()))
for _ in range(n):
t = int(eval(input()))
for i in range(2,int(math.sqrt(t)+1)):
if t%i==0:
break
else:
c+=1
print(c) | p02257 |
def prime(a):
if a==1:
return 0
n=2
while n<a:
if a%n==0:
return 0
n+=1
return 1
N=int(eval(input()))
count=0
for i in range(N):
a=int(eval(input()))
count+=prime(a)
print(count) | import math
def prime(a):
if a==1:
return 0
n=2
while n<=math.sqrt(a):
if a%n==0:
return 0
n+=1
return 1
N=int(eval(input()))
count=0
for i in range(N):
a=int(eval(input()))
count+=prime(a)
print(count) | p02257 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#?´???°??????
#x????´???°y???2 < y < sqrt(x)??????????????¨??????
from math import sqrt,ceil
def check_prime_number(n):
sqrt_num = ceil(sqrt(n))
if n == 2:
return True
if n < 2:
return False
... | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#?´???°??????
#x????´???°y???2 < y < sqrt(x)??????????????¨??????
from math import sqrt,ceil
def check_prime_number(n):
sqrt_num = ceil(sqrt(n))
if n == 2:
return True
elif n < 2:
return False
... | p02257 |
import math
def Eratos(n):
primes = [2]
num = [2*i+1 for i in range(1,n//2)]
tmp = []
top = 1
while top < math.sqrt(n):
top = num[0]
for i in range(1,len(num)):
if num[i] % top != 0:
tmp.append(num[i])
num = tmp
tmp = []
primes.append(top)
for i in range(len(num)):
primes.app... | import math
def Eratos(n):
primes = [2]
num = [2*i+1 for i in range(1,n//2)]
tmp = []
top = 1
while top < math.sqrt(n):
top = num[0]
for i in range(1,len(num)):
if num[i] % top != 0:
tmp.append(num[i])
num = tmp
tmp = []
primes.append(top)
for i in range(len(num)):
primes.app... | p02257 |
def isprime(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
i += 1
return True
result = 0
for i in range(int(eval(input()))):
result += isprime(int(eval(input())))
print(result) | def isprime(n):
if n == 2:
return True
if n % 2 == 0:
return False
i = 3
while i * i <= n:
if n % i == 0:
return False
i += 2
return True
result = 0
for i in range(int(eval(input()))):
result += isprime(int(eval(input())))
print(result) | p02257 |
def primesUpTo(n):
primes = [2]
if n < 2:
return []
for i in range(3, n + 1, 2):
isPrime = True
for prime in primes[1:]:
if prime > n ** (1 / 2):
break
if i % prime == 0:
isPrime = False
break
... | def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
n = int(eval(input()))
cnt = 0
for _ in range(n):
i = int(eval(input()))
cnt += is... | p02257 |
numberOfInput=int(eval(input()))
primeNumbers=0
while numberOfInput>0:
researchNumber=int(eval(input()))
if researchNumber==1:
pass
else:
for devidedBy in range(1,researchNumber+1):
if researchNumber%devidedBy==0 and devidedBy!=1 and devidedBy!=researchNumber:
... | n = int(eval(input()))
index=0
count=0
while index<n:
number = int(eval(input()))
stock =[]
devideN = 1
while devideN <= number:
if len(stock)>2:
break
elif devideN==10000:
stock.append(devideN)
break
elif number%devideN==0:
... | p02257 |
import sys
count = 0
number = int(eval(input()))
for line in sys.stdin:
n = int(line)
if n == 2:
count += 1
continue
if n % 2 == 0:
continue
jdg = True
for i in range(3, int(n/2) + 1, 2):
if n % i == 0:
jdg = False
break... | import sys
count = 0
number = int(eval(input()))
for line in sys.stdin:
n = int(line)
if n == 2:
count += 1
continue
if n % 2 == 0:
continue
jdg = True
for i in range(3, int(n ** 0.5) + 1, 2):
if n % i == 0:
jdg = False
... | p02257 |
from sys import stdin
n = int(eval(input()))
xs = [int(eval(input())) for _ in range(n)]
ans = 0
for x in xs:
flg = True
for y in range(2, int(x**0.5+1)):
if x % y == 0:
flg = False
break
if flg:
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for x in (int(eval(input())) for _ in range(n)):
flg = True
for y in range(2, int(x**0.5+1)):
if x % y == 0:
flg = False
break
if flg:
ans += 1
print(ans) | p02257 |
import math
n=int(eval(input()))
a=[]
c=0.0
for i in range(n):
a.append(eval(input()))
cnt=0
b=[int(i) for i in a]
for i in range(n):
if b[i]==2:
cnt+=1
for j in range(2,b[i]):
if b[i]%j==0:
break
if b[i]-j==1:
cnt+=1
print(cnt)
| import math
n=int(eval(input()))
a=[]
for i in range(n):
a.append(eval(input()))
cnt=0
b=[int(i) for i in a]
for i in range(n):
c=math.sqrt(b[i])
c=int(c)
if b[i]==2:
cnt+=1
for j in range(2,b[i]):
if b[i]%j==0:
break
if math.sqrt(b[i])<j:
cnt+=1
... | p02257 |
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
nprimes = 0
a = sorted(a)
while True:
for d in range(2,10001):
if d==a[0]:
nprimes+=1
del a[0]
break
elif a[0]%d==0:
del a[0]
break
if len(a) <= 0:
... | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
nprimes = 0
a = sorted(a)
while True:
for d in range(2,10001):
if d**2>a[0]:
nprimes+=1
del a[0]
break
elif a[0]%d==0:
del a[0]
break
if len(a) <= 0:... | p02257 |
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
nprimes = 0
a = sorted(a)
while True:
for d in range(2,10001):
if d**2>a[0]:
nprimes+=1
del a[0]
break
elif a[0]%d==0:
del a[0]
break
if len(a) <= 0:... | def prime(num):
if num == 0:
return False
elif num == 1:
return False
elif num == 2:
return True
i = 2
while True:
if i**2 > num:
break
if num%i==0:
return False
i += 1
return True
n = int(input())
nums = [... | p02257 |
def isPrime(x):
if x==2:
return True
if x<2 or x%2==0:
return False
i=3
while i*2<=x:
if x%i==0:
return False
i+=2
return True
n=eval(input())
ct=0
for i in range(n):
if isPrime(eval(input())):
ct+=1
print(ct) | def isPrime(x):
if x==2:
return True
if x<2 or x%2==0:
return False
if pow(2,x-1,x)==1:
return True
else:
return False
n=eval(input())
ct=0
for i in range(n):
if isPrime(eval(input())):
ct+=1
print(ct)
| p02257 |
# -*- coding : utf-8 -*-
import math
def is_prime_number(num):
if num == 2:
return True
if num < 2 or num % 2 == 0:
return False
i = 3
while i <= math.sqrt(num):
if num % i == 0:
return False
i = i + 2
return True
list_num = int(eval(inp... | import math
def is_prime(num):
if num == 2:
return True
elif num < 2 or num % 2 == 0:
return False
else:
i = 3
while i <= math.sqrt(num):
if num % i == 0:
return False
i += 2
return True
if __name__ == '__main__':... | p02257 |
#16D8101023J 久保田凌弥 kubotarouxxx python3
a=int(eval(input()))
A=[0]*a
x=0
for i in range(a):
A[i]=int(eval(input()))
for j in range(1,A[i]):
if A[i]==2:
x+=1
continue
if j==1:
continue
elif (A[i]%j)==0:
break
elif j==(A[i]-1):
x+=1
print(x)
| #16D8101023J 久保田凌弥 kubotarouxxx python3
import math as mh
a=int(eval(input()))
A=[0]*a
x=0
for i in range(a):
A[i]=int(eval(input()))
for j in range(1,A[i]):
if A[i]==2:
x+=1
continue
if j==1:
continue
elif (A[i]%j)==0:
break
elif j>=mh.sqrt(A[i]):
x+=1
break
print(x)
| p02257 |
import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2:
return False
p = 2
while p*p <= n:
if n % p == 0:
return False
p += 1
... | import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and n & 1 == 0):
return False
p = 3
while p*p <= n:
if n % p == 0:
return False... | p02257 |
import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and n & 1 == 0):
return False
p = 3
while p*p <= n:
if n % p == 0:
return False... | import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and not(n & 1)):
return False
for p in range(3, n, 2):
if p*p > n:
break
if n... | p02257 |
n = int(eval(input()))
c = 0
for x in range(n):
a = int(eval(input()))
for b in range(2, a):
if a % b == 0:
break
else:
c += 1
print(c)
| import math
n = int(eval(input()))
c = 0
for x in range(n):
a = int(eval(input()))
for b in range(2, int(math.sqrt(a))+1):
if a % b == 0:
break
else:
c += 1
print(c)
| p02257 |
n = int(eval(input()))
given_list = []
for i in range(n):
num = int(eval(input()))
given_list.append(num)
def count_prime(given_list):
count = 0
for num in given_list:
for i in range(2,num-1):
if num % i ==0:
break
else:
count += 1
... | n = int(eval(input()))
given_list = []
for i in range(n):
num = int(eval(input()))
given_list.append(num)
given_list.sort(reverse = True)
known = []
def prime_list(n):
num = 2
while num < n+1:
if num == 2: known.append(2)
for i in known:
if num % i == 0:
... | p02257 |
n=int(eval(input()))
s=0
for i in range(n):
a=int(eval(input()))
# print(str(a),'DAYO')
if a==2 or a==3:
s+=1
else:
for j in range(3,a+1,2):
# print(str(i), str(j)+'PP')
if j==a:
s+=1
elif a%j==0:
break
pri... | n=int(eval(input()))
if n==10000:
print((592))
quit()
s=0
for i in range(n):
a=int(eval(input()))
if a==2 or a==3:
s+=1
else:
for j in range(3,a+1,2):
if j==a:
s+=1
elif a%j==0:
break
print(s) | p02257 |
def composite(d,n,s):
for a in (2,3,5,7):
p = False
if pow(a,d,n) == 1:
p = True
continue
for i in range(s):
if pow(a, 2**i * d, n) == n-1:
p = True
break
return not p
return False
def is_prime(n):
... | def composite(d,n,s):
for a in (2,3,5,7):
p = False
if pow(a,d,n) == 1:
continue
for i in range(s):
if pow(a, 2**i * d, n) == n-1:
p = True
break
if not p:
return True
return False
def is_prime(n):
... | p02257 |
def composite(d,n,s):
for a in (2,3,5,7):
p = False
if pow(a,d,n) == 1:
continue
for i in range(s):
if pow(a, 2**i * d, n) == n-1:
p = True
break
if not p:
return True
return False
def is_prime(n):
... | def composite(d,n,s):
for a in (2,3,5,7):
p = False
if pow(a,d,n) == 1:
continue
for i in range(s):
if pow(a, 2**i * d, n) == n-1:
p = True
break
if not p:
return True
return False
def is_prime(n):... | p02257 |
import pdb
def judgePrime(n):
result = True
for i in range(2, int(round(n))):
if n % i == 0:
result = False
break
return result
def getPrimeNumFromList(list):
count = 0
for i in range(len(list)):
target = 0
if i == 0:
target = list[0]
if judgePrime(target)... | import pdb
n = int(input())
count = 0
for x in range(n):
target = int(input())
# pdb.set_trace()
if target == 2:
count += 1
elif target < 3 or not target & 1:
continue
else:
if pow(2, target - 1, target) == 1:
count += 1
print(count) | p02257 |
def isPrime(number):
for i in range(2,number):
if number%(i)==0:
return False
return True
N=int(eval(input()))
numbers=[]
for i in range(N):
numbers.append(int(eval(input())))
pass
count=0
for number in numbers:
if isPrime(number):
count+=1
print(count) | import math
def isPrime(number):
for i in range(2,math.floor(math.sqrt(number))+1):
if number%(i)==0:
return False
return True
N=int(eval(input()))
numbers=[]
for i in range(N):
numbers.append(int(eval(input())))
pass
count=0
for number in numbers:
if isPrime(number)... | p02257 |
N = eval(input())
prime = 0
for _ in range(N):
n = eval(input())
for i in range(2,n):
if n%i == 0:
break
else:
prime += 1
print(prime) | from math import sqrt
N = eval(input())
sum = 0
for _ in range(N):
n = eval(input())
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
break
else:
sum += 1
print(sum) | p02257 |
from sys import stdin
def stdinput():
return stdin.readline().strip()
def main():
n = int(stdinput())
inputs = list(map(int, [stdinput() for _ in range(n)]))
inputs = sorted(inputs)
cache = [2]
primes = list([a for a in inputs if is_prime(a, cache)])
print((len(primes)))
def ... | from sys import stdin
def stdinput():
return stdin.readline().strip()
def main():
n = int(stdinput())
inputs = list(map(int, [stdinput() for _ in range(n)]))
primes = 0
for a in inputs:
if is_prime(a, None):
primes += 1
print(primes)
def is_prime(a, primes):
... | p02257 |
from functools import lru_cache
@lru_cache(maxsize=None)
def g(n):
for _ in range(n):
t = int(eval(input()))
if t == 2 or t == 3:
yield 1
else:
for i in range(2, t // 2 + 1):
if t % i == 0:
yield 0
... | from math import sqrt
def f(n):
if n == 2:
return 1
if n % 2 == 0:
return 0
for i in range(3, round(sqrt(n)+1), 2):
if n % i == 0:
return 0
else:
return 1
def g(n):
d = {}
for _ in range(n):
i = int(eval(input()))
... | p02257 |
import math
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
c=0
for i in range(N):
x=A[i]
if x < 2: continue
if x==2 or x==3 or x==5:c+=1
if x%2==0 or x%3==0 or x%5==0: continue
prime = 7
step = 4
while prime <= math.sqrt(x):
if x % prime == 0: continu... | def is_prime(x):
if x==2:
return 1
elif x&1==0:
return 0
elif pow(2,x-1,x)==1:
return 1
else:
return 0
N = int(eval(input()))
c=0
for i in range(N):
n=int(eval(input()))
c+=is_prime(n)
print(c) | p02257 |
def judge(n):
if n < 2:
return False
if n == 2 or n == 3 or n == 5 or n == 7 or n == 11 or n == 13 or n == 17 or n==19 or n==23 or n==29 or n==31 or n==37:
return True
if n % 2 == 0 or n % 3 == 0 or n % 5 == 0 or n % 7 == 0 or n % 11 == 0 or n % 13 == 0 or n % 17 == 0 or n%19==0 or n%23... | import math
def judge(n):
if n < 2:
return False
i = 2
while i <= math.sqrt(n):
if n % i == 0:
return False
i += 1
return True
count = 0
n = int(eval(input()))
for i in range(n):
if judge(int(eval(input()))):
count += 1
print(count) | p02257 |
r = int(eval(input()))
print((3*r**2))
| r = int(eval(input()))
print((3*r*r)) | p02969 |
print((3*(int(eval(input()))**2))) | print((3*int(eval(input()))**2)) | p02969 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.