input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
ax = list(map(int,input().split()))
boxin = []
for cnt in range(N, 0, -1):
a = ax[cnt-1]
i = 2
memo_cnt = 0
while 1:
test_val = i * cnt
if test_val > N:
break
if test_val in boxin:
memo_cnt += 1
i += 1... | N = int(eval(input()))
ax = list(map(int,input().split()))
boxin = []
bx = [0 for _ in range(N+1)]
for cnt in range(N, 0, -1):
a = ax[cnt-1]
i = 2
memo_cnt = 0
while 1:
test_val = i * cnt
if test_val > N:
break
if bx[test_val]:
memo_cnt +... | p02972 |
N = int(eval(input()))
A = [0]
A.extend(list(map(int, input().split())))
boxes = [0 for i in range(N+1)] # 後に最初の要素を取り除く
for i in range(N, 0, -1):
# print("iiii = ", i)
wa = 0
for j in range(i, N+1, i):
# print("j = ", j)
wa += boxes[j]
if wa % 2 != A[i]:
boxes[i] ... | N = int(eval(input()))
A = [0]
A.extend(list(map(int, input().split())))
boxes = [0] * (N+1)
for i in range(N, 0, -1):
# print(i)
wa = 0
for j in range(i, N+1, i):
# print(j)
wa += boxes[j]
if wa % 2 != A[i]:
boxes[i] = 1
# print("hogeeeeeeeeee")
ans = []
for ... | p02972 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): ret... | p02972 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
a_list = list(map(int, input().split()))
M = 0
box_dict = {}
for i in reversed(list(range(N))):
idx = i + 1
multi_sum = 0
for key, value in list(box_dict.items()):
if key % (idx * 2) == 0:
multi_sum += value
if a_list[i] - m... | # -*- coding: utf-8 -*-
N = int(eval(input()))
a_list = list(map(int, input().split()))
M = 0
box_dict = {}
for i in reversed(list(range(N))):
idx = i + 1
multi_sum = 0
if N // idx < 2:
if a_list[i] == 0:
box_dict[idx] = 0
else:
box_dict[idx] = 1
... | p02972 |
import sys
import math
def add_ball(idx):
add_list = []
for j in range(1, int(math.sqrt(idx))+1):
if idx%j == 0:
add_list.append(j)
if j != idx//j:
add_list.append(idx//j)
for k in add_list:
b_list[k] += 1
if __name__ == "__main__":
... | import sys
import math
def add_ball(idx):
add_list = []
for j in range(1, int(math.sqrt(idx))+1):
if idx%j == 0:
add_list.append(j)
if j != idx//j:
add_list.append(idx//j)
for k in add_list:
b_list[k] += 1
if __name__ == "__main__":
... | p02972 |
import collections
import heapq
n = int(input())
ais = [0] + list(map(int, input().split()))
#print ais
res = [0 for __ in range(n +1)]
for u in range(n, 0, -1):
c = u*2
cumul = 0
while(c <= n):
cumul += res[c]
c += u
if ais[u] != (cumul % 2):
res[u] = 1
s = sum(res)
print(s)
if s:
print('... | n = int(input())
ais,res = [0] + list(map(int, input().split())) ,[0 for _ in range(n +1)]
for u in range(n, 0, -1):
c,cumul = u,0
while(c <= n):
cumul += res[c]
c += u
if ais[u] != (cumul % 2): res[u] = 1
s = sum(res)
print(s)
if s: print(' '.join([str(i) for i in range(len(res)) if res[i] == 1])) | p02972 |
import sys
input=sys.stdin.readline
n=int(input())
l=tuple(map(int,input().split()))
ret=[]
ll=[0]*n
ans=0
for i in range(n,0,-1):
s=l[i-1]
for j in range(2,n//i+1):
s-=ll[j*i-1]
s%=2
ll[i-1]=s
ans+=s
if s:ret.append(i)
print(ans)
if ans:print(*ret,sep=" ")
|
n=int(input())
l=tuple(map(int,input().split()))
ret=[]
ll=[0]*n
ans=0
for i in range(n,0,-1):
s=l[i-1]
for j in range(2,n//i+1):
s-=ll[j*i-1]
s%=2
ll[i-1]=s
ans+=s
if s:ret.append(i)
print(ans)
if ans:print(*ret,sep=" ")
| p02972 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=[0] * N
ans = []
for i in reversed(list(range(1, N+1))):
a = A[i-1]
for j in range(1, N+1):
tmp = i * j
if tmp > N:
break
a += B[tmp-1]
if a % 2 == 1:
ans.append(i)
B[i-1] = a % 2
print((len... | N=int(eval(input()))
A=list(map(int,input().split()))
ans = []
for i in reversed(list(range(1, N+1))):
a = A[i-1]
for j in range(2, N+1):
tmp = i * j
if tmp > N:
break
a += A[tmp-1]
if a % 2 == 1:
ans.append(i)
A[i-1] = a % 2
print((len(ans)))
fo... | p02972 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=[0] * N
ans = []
for i in reversed(list(range(1, N+1))):
a = 0
for j in range(1, N+1):
tmp = i * j
if tmp > N:
break
a = (B[tmp-1] + a) % 2
if (A[i-1] + a) % 2 == 1:
ans.append(i)
B[i-1] = (A... | N=int(eval(input()))
A=list(map(int,input().split()))
ans = []
for i in reversed(list(range(1, N+1))):
a = A[i-1]
for j in range(2, N+1):
tmp = i * j
if tmp > N:
break
a += A[tmp-1]
if a % 2 == 1:
ans.append(i)
A[i-1] = a % 2
print((len(ans)))
fo... | p02972 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
B = []
for i in range(1, N+1)[::-1]:
a = A[i-1]
v = len(list([x for x in B if x % i == 0]))
if v % 2 != a:
B.append(i)
for i in range(1, N+1)[::-1]:
a = A[i-1]
v = len(list([x for x in B if x % i == 0]))
if v % 2... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
X = [0 for _ in range(N)]
ans = []
for i in range(N)[::-1]:
v = 0
for j in range(i, N, i+1):
v += X[j]
if v % 2 != A[i]:
X[i] = 1
ans.append(i+1)
print((len(ans)))
for i in ans:
print(i)
| p02972 |
#!/usr/bin/env python3
import sys
INF = float("inf")
MOD = 2 # type: int
import math
import collections
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n... | #!/usr/bin/env python3
import sys
INF = float("inf")
MOD = 2 # type: int
import math
import collections
def solve(N: int, a: "List[int]"):
b = [0]*N
for i in range(N-1, -1, -1):
tmp = 0
for j in range(2, N//(i+1)+1):
tmp += b[j*(i+1)-1]
if tmp % MOD == ... | p02972 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = list(map(int, read().split()))
B = [False] * (N + 1)
for i, a in reversed(list(enumerate(A, 1))):
tmp ... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = list(map(int, read().split()))
B = [False] * (N + 1)
for i, a in reversed(list(enumerate(A, 1))):
tmp ... | p02972 |
def main():
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
for i in range(N//2, 0, -1):
sum_m = sum([A[j] for j in range(i*2, N+1) if j%i==0])
if A[i] == 0:
if sum_m % 2 == 1:
A[i] = 1
else:
if sum_m % 2 == 1:
... | def main():
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
for i in range(N//2, 0, -1):
sum_m = sum([A[i*j] for j in range(2, N//i+1)])
if A[i] == 0:
if sum_m % 2 == 1:
A[i] = 1
else:
if sum_m % 2 == 1:
... | p02972 |
from sys import stdin
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
point = 0
lin = []
for i in range(n,0,-1):
score = 0
for j in range(i+1,n+1):
if j % i == 0:
score += li[j-1]
if li[i-1] != score%2:
point += 1
... | from sys import stdin
n = int(stdin.readline().rstrip())
li = [0] + list(map(int,stdin.readline().rstrip().split()))
lin = [0]*(n+1)
point = 0
lis = []
for i in range(n,0,-1):
su = sum(lin[i::i])%2
if li[i] != su:
lin[i] = 1
point += 1
lis.append(i)
print(point)
li... | p02972 |
n = 50001
is_prime = [True for i in range(n)]
is_prime[0] = is_prime[1] = False
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = False
j += i
i += 1
cnt_pair = [0 for i in range(n)]
for i in range(3, n//2, 2):
if is_prime[i]:
for j in range(i, n - i, 2):
... | n = 50001
is_prime = [i for i in range(n)]
is_prime[0] = is_prime[1] = 0
i = 2
while i**2 <= n:
j = i*2
while j < n:
is_prime[j] = 0
j += i
i += 1
prime_set = set(is_prime)
prime_set.remove(0)
prime_list = sorted(list(prime_set))
while True:
cnt = 0
n = int(eval(i... | p00056 |
def get_input():
while True:
try:
yield ''.join(eval(input()))
except EOFError:
break
MAX = 50000
primes = list()
for i in range(MAX):
primes.append(True)
primes[0] = False
primes[1] = False
for i in range(2, MAX):
j = i + i
while j < MAX:
... | def get_input():
while True:
try:
yield ''.join(eval(input()))
except EOFError:
break
MAX = 50000
primes = list()
for i in range(MAX):
primes.append(True)
primes[0] = False
primes[1] = False
for i in range(2, MAX):
j = i + i
while j < MAX:
... | p00056 |
n=50000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
#p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(eval(input()))
if n==0:break
c=0
for i in range(2,n//2+1):
if(p[i],p[n-i])==(1,1):c+=1
... | p=[1]*50001
for i in range(2,int(50000**0.5)+1):
if p[i]:
for j in range(i*i,50000,i):p[j]=0
while 1:
n=int(eval(input()))
if n==0:break
print((sum(1 for i in range(2,n//2+1) if p[i] and p[n-i]))) | p00056 |
import bisect,sys
from itertools import *
n=list(range(50001));a=list(n);a[1]=0
for i in range(2,224):a[i*2::i]=[0]*len(a[i*2::i])
p=list(compress(n,a))
for x in sys.stdin:
x=int(x)
if x:print((sum(1 for d in p[:bisect.bisect(p,x//2)]if a[x-d])))
| import bisect,sys
from itertools import *
n=list(range(50001));a=list(n);a[1]=0
for i in range(2,224):a[i*2::i]=[0]*len(a[i*2::i])
p=list(compress(n,a))
for x in map(int,sys.stdin):
if x:print((len([1 for d in p[:bisect.bisect(p,x//2)]if a[x-d]])))
| p00056 |
from bisect import bisect_left
ub = 50000
primes = {2} | set(range(3, ub, 2))
du = primes.difference_update
for n in range(3, ub, 2):
if n in primes:
du(list(range(n*3, ub, n*2)))
primes = list(primes)
while True:
n = int(eval(input()))
if n == 0:
break
l, r = 0, bisect_l... | import sys
from bisect import bisect_right
from itertools import chain, compress
ub = 50000
is_prime = [0, 0, 1, 1] + [0]*(ub-3)
is_prime[5::6] = is_prime[7::6] = [1]*int(ub/6)
primes = [2, 3]
append = primes.append
for n in chain(list(range(5, ub, 6)), list(range(7, ub, 6))):
if is_prime[n]:
... | p00056 |
from itertools import *
def sieve(n):
a = list(range(n))
a[:2] = None, None
for i in range(2, n):
if i ** 2 >= n: break
if not a[i]: continue
for i in range(i ** 2, n, i):
a[i] = None
return [v for v in a if v]
def isPrime(p):
if p < 2:
ret... | from itertools import *
def sieve(n):
a = list(range(n))
a[:2] = None, None
for i in range(2, n):
if i ** 2 >= n: break
if not a[i]: continue
for i in range(i ** 2, n, i):
a[i] = None
return a
b = sieve(50000)
a = [v for v in b if v]
while True:
n... | p00056 |
MAX = 50001
is_prime = [True for _ in range(MAX)]
is_prime[0] = is_prime[1] = False
for i in range(2, int(MAX ** (1 / 2)) + 1):
if is_prime[i]:
for j in range(i ** 2, MAX, i):
is_prime[j] = False
primes = [i for i in range(MAX) if is_prime[i]]
def main():
while True:
n = int(eval(input... | MAX = 50001
is_prime = [True for _ in range(MAX)]
is_prime[0] = is_prime[1] = False
for i in range(2, int(MAX ** (1 / 2)) + 1):
if is_prime[i]:
for j in range(i ** 2, MAX, i):
is_prime[j] = False
primes = [i for i in range(MAX) if is_prime[i]]
def main():
while True:
n = int(eval(input... | p00056 |
N = 50000
t = [1]*(N)
p = [2]
d = {2:1}
for i in range(3, N, 2):
if t[i]:
p.append(i)
d[i] = 1
for j in range(3*i, N, 2*i): t[j] = 0
while True:
n = int(eval(input()))
if n == 0: break
count = 0
if n % 2:
if n - 2 in p: count += 1
else:
... | import sys
N = 50000
t = [1]*(N)
p = [2]
d = {2:1}
for i in range(3, N, 2):
if t[i]:
p.append(i)
d[i] = 1
for j in range(3*i, N, 2*i): t[j] = 0
while True:
n = int(sys.stdin.readline())
if n == 0: break
count = 0
if n % 2:
if n - 2 in p: count += ... | p00056 |
# -*- coding: utf-8 -*-
import sys
import os
N = 50001
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(4, N // 2 + 1, 2):
lst[i] = False
for i in range(3, int(N ** 0.5) + 1, 2):
if lst[i]:
for j in range(2, N // i + 1):
index = i * j
if index < N:
... | # -*- coding: utf-8 -*-
import sys
import os
N = 50001
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(2, int(N ** 0.5) + 1):
if lst[i]:
for j in range(2 * i, N, i):
lst[j] = False
for s in sys.stdin:
n = int(s)
if n == 0:
break
elif n % 2 =... | p00056 |
# -*- coding: utf-8 -*-
import sys
import os
N = 50001
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(2, int(N ** 0.5) + 1):
if lst[i]:
for j in range(i * i, N, i):
lst[j] = False
primes = [i for i in range(1, N) if lst[i]]
for s in sys.stdin:
n = int(s)
... | import sys
N = 50001
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(2, int(N ** 0.5) + 1):
if lst[i]:
for j in range(i * i, N, i):
lst[j] = False
primes = [i for i in range(1, N) if lst[i]]
for s in sys.stdin:
n = int(s)
if n == 0:
break
eli... | p00056 |
def sieve(n):
primes = [True] * n
primes[0] = primes[1] = False
for i in range(2, int(n ** 0.5) + 1):
if primes[i]:
for j in range(i * i, n, i):
primes[j] = False
return [i for i in range(n) if primes[i]]
primes = sieve(50000)
ret = [0] * 50001
for i in ra... | def sieve(n):
primes = [True] * n
primes[0] = primes[1] = False
for i in range(2, int(n ** 0.5) + 1):
if primes[i]:
for j in range(i * i, n, i):
primes[j] = False
return [i for i in range(n) if primes[i]]
primes = sieve(50000)
ret = [0] * 50001
for i in ra... | p00056 |
from itertools import *
import sys
maxnum = 50000
primes = [True]*maxnum
primes[0] = primes[1] = False
for i in range(maxnum):
if i >= maxnum**0.5 : break
if not primes[i]: continue
for j in range(i*2,maxnum,i): primes[j] = False
p = [ i for i in range(maxnum) if primes[i]]
for s in sys.stdin:... | import sys
maxnum = 50000
primes = [True]*maxnum
primes[0] = primes[1] = False
for i in range(maxnum):
if i >= maxnum**0.5 : break
if not primes[i]: continue
for j in range(i*2,maxnum,i): primes[j] = False
for s in sys.stdin:
d = int(s)
if d == 0: break
cnt = 0
for i in range... | p00056 |
import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 225):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(eval(input()))
if n == 0:
break
I = bisect.bisect(values, n//2)
p... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 225):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(eval(input()))
if n == 0:
break
I = bisect.bisect(values, n//2)
p... | p00056 |
import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(eval(input()))
if n == 0:
break
I = bisect.bisect(values, n//2)
p... | import bisect
primes = [0, 0] + [1] * 49999
for i in range(2, 224):
if primes[i]:
for j in range(i*i, 50001, i):
primes[j] = 0
values = [i for i, k in enumerate(primes) if k]
while True:
n = int(eval(input()))
if n == 0:
break
I = bisect.bisect(values, n//2)
p... | p00056 |
import sys
f = sys.stdin
def create_prime(n):
prime = [1] * (n + 1)
prime[:2] = [0, 0]
for i in range(len(prime)):
if prime[i]:
for j in range(2 * i, len(prime), i):
prime[j] = 0
return prime
sieve = create_prime(50000)
prime = []
for i in range(2500... | import sys
f = sys.stdin
def create_prime(n):
prime = [1] * (n + 1)
prime[:2] = [0, 0]
for i in range(len(prime)):
if prime[i]:
for j in range(2 * i, len(prime), i):
prime[j] = 0
return prime
sieve = create_prime(50000)
prime = []
for i in range(2500... | p00056 |
import math
r = 50001
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
prime = []
for i in range(len(p)):
if p[i] == 1:
prime.append(i+1)
while True:
n = int(input())
if n == 0:
break... | import math
r = 50001
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
prime = []
for i in range(len(p)):
if p[i] == 1:
prime.append(i+1)
while True:
n = int(input())
if n == 0:
break... | p00056 |
def primes(n):
l = [1 for i in range(n+1)]
l[0] = l[1] = 0
for i in range(2,int((n)**(1/2))+1):
if l[i] == 1:
for j in range(2,(n)//i+1):
l[i*j] = 0
l2 = [n for n in range(len(l)) if l[n]]
return l2
l = primes(50000)
while True:
n = int(eval(input()))
if n == 0:
break
... | def primes(n):
l = [1 for i in range(n+1)]
l[0] = l[1] = 0
for i in range(2,int((n)**(1/2))+1):
if l[i] == 1:
for j in range(2,(n)//i+1):
l[i*j] = 0
return l
l = primes(50000)
while True:
n = int(eval(input()))
if n == 0:
break
count = 0
for i in range(2,n//2+1):
... | p00056 |
from math import sqrt, floor
from bisect import bisect_left
def search(x):
global p, lp
i = bisect_left(p, x)
return i != lp and p[i] == x
p = [2]
for i in range(3, 50000, 2):
for j in range(3, floor(sqrt(i)) + 1, 2):
if not i % j:
break
else:
p.append... | from math import sqrt, floor
p = [2]
for i in range(3, 50000, 2):
for j in range(3, floor(sqrt(i)) + 1, 2):
if not i % j:
break
else:
p.append(i)
sp = set(p)
while True:
n = int(eval(input()))
if not n:
break
if n & 1:
print((int(n - 2 in... | p00056 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0056
"""
from math import sqrt, ceil, pow
import bisect
# https://github.com/mccricardo/sieve_of_atkin/blob/master/sieve_of_atkin.py
class SieveOfAtkin:
def __init__(self, limit):
self.limit = limit
se... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0056
"""
from math import sqrt, ceil, pow
import bisect
# https://github.com/mccricardo/sieve_of_atkin/blob/master/sieve_of_atkin.py
class SieveOfAtkin:
def __init__(self, limit):
self.limit = limit
se... | p00056 |
def sieve(n):
is_prime = [True] * (n + 1)
for i in range(2,n + 1):
if is_prime [i] == False:
continue
for j in range(i * 2,n + 1,i):
is_prime [j] = False
return {i for i in range(2,n + 1) if is_prime [i]}
prime = sieve(100000)
while True:
N = int(eva... | def sieve(n):
is_prime = [True] * (n + 1)
for i in range(2,n + 1):
if is_prime [i] == False:
continue
for j in range(i * 2,n + 1,i):
is_prime [j] = False
return {i for i in range(2,n + 1) if is_prime [i]}
prime = sieve(100000)
dic = {}
while True:
N... | p00056 |
# D
from math import sqrt
def sieve(n:int)->list:
"""エラトステネスの篩"""
if n<2: return [False]*(n+1)
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n))+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
is_prime[... | # D
from math import sqrt
def sieve(n:int)->list:
"""エラトステネスの篩"""
if n<2: return [False]*(n+1)
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n))+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
is_prime[... | p03476 |
Q = int(eval(input()))
is_prime = {i:True for i in range(10**5+1)}
is_prime[0], is_prime[1] = False, False
for i in range(2, 10**5+1):
if is_prime[i]:
for j in range(i*2, 10**5+1, i):
is_prime[j] = False
s = [0] * (10**5+1)
for i in range(1, 10**5):
s[i+1] = s[i] + int(is_prime[i] a... | Q = int(eval(input()))
is_prime = [True for i in range(10**5+1)]
is_prime[0], is_prime[1] = False, False
for i in range(2, 10**5+1):
if is_prime[i]:
for j in range(i*2, 10**5+1, i):
is_prime[j] = False
s = [0] * (10**5+1)
for i in range(1, 10**5):
s[i+1] = s[i] + int(is_prime[i] and... | p03476 |
import itertools
n=int(eval(input()))
d=[list(map(int,input().split())) for i in range(n)]
sosuu=[1 for i in range(10**5+1)]
#sosuuのindexの値が1の時素数とする。
sosuu[0]=0
sosuu[1]=0
for i in range(2,10**5+1):
if sosuu[i]==0:continue
elif sosuu[i]==1:
for j in range(2*i,10**5+1,i):
sosuu[j]=0
like_n=[]... | import itertools
n=int(eval(input()))
d=[list(map(int,input().split())) for i in range(n)]
sosuu=[1 for i in range(10**5+1)]
#sosuuのindexの値が1の時素数とする。
sosuu[0]=0
sosuu[1]=0
for i in range(2,int((10**5+1)**0.5)+1):
if sosuu[i]==0:continue
elif sosuu[i]==1:
for j in range(2*i,10**5+1,i):
sosuu[j... | p03476 |
def prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for j in range(4, n+1, 2):
is_prime[j] = False
for i in range(3, int(n**0.5) + 1, 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] ... | def prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for j in range(4, n+1, 2):
is_prime[j] = False
for i in range(3, int(n**0.5) + 1, 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] ... | p03476 |
import math
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if ... | import math
import bisect
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]... | p03476 |
d = [0]
ans = 0
def prime(n):
if n == 1:
return False
i = 2
while i * i <= n:
if n % i == 0:
return False
else:
i += 1
return True
for i in range(10 ** 5 // 2):
if prime(2 * i + 1) and prime(i + 1):
ans += 1
d.append(... | #!/usr/bin/env python3
Q = int(eval(input()))
my_max = 10 ** 5
nums = [i for i in range(2, my_max + 1)]
p = 2
idx = 0
while p * p <= my_max and idx < len(nums):
nums = [n for n in nums if n % p != 0 or n == p]
idx += 1
p = nums[idx]
primes = set(nums)
ruiseki = [0]
total = 0
for i in rang... | p03476 |
from itertools import accumulate
Q = int(eval(input()))
def prime(n):
# 素数列挙
# nまでの素数をリストで返す(nを含む)
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes=list(primes)
return primes
prime_set = set(prime(10**5)... | from itertools import accumulate
Q = int(eval(input()))
m = 0
ls = []
for i in range(Q):
l, r = list(map(int, input().split()))
m = max(m, max(l, r))
ls.append((l, r))
def sieve_eratosthenes(n):
primes = [0, 1] * (n // 2 + 1)
if n % 2 == 0:
primes.pop()
primes[1] = 0
p... | p03476 |
prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,... | likeprime = [3,5,13,37,61,73,157,193,277,313,397,421,457,541,613,661,673,733,757,877,997,1093,1153,1201,1213,1237,1321,1381,1453,1621,1657,1753,1873,1933,1993,2017,2137,2341,2473,2557,2593,2797,2857,2917,3061,3217,3253,3313,3517,3733,4021,4057,4177,4261,4273,4357,4441,4561,4621,4933,5077,5101,5113,5233,5413,5437,5581,5... | p03476 |
from itertools import accumulate
Q = int(eval(input()))
def sieve(n):
if n == 0:
return [False]
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(2 * i, n + 1, i):
is_prime[j] = False
... | Q = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(Q)]
n = 10 ** 5 + 2
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if not is_prime[i]:
continue
for j in range(2 * i, n + 1, i):
is_prime[j] = False
like =... | p03476 |
def l(): return list(map(int, input().split()))
def m(): return list(map(int, input().split()))
def sieve(n): # エラトステネスの篩ですよ
num = [True]*n
num[0] = num[1] = False
for i in range(2,int(n**0.5)+1):
if num[i]:
for j in range(i**2, n, i):
num[j] = False
return [i for i in range(2,n) if... | def l(): return list(map(int, input().split()))
def m(): return list(map(int, input().split()))
def sieve(n): # エラトステネスの篩ですよ
num = [True]*n
num[0] = num[1] = False
for i in range(2,int(n**0.5)+1):
if num[i]:
for j in range(i**2, n, i):
num[j] = False
return [i for i in range(2,n) if... | p03476 |
a=[0 for i in range(10**5+5)]
for i in range(3,10**5+3,2):
for j in range(3,int(i**0.5)+1,2):
if i%j==0 and j!=i:
break
else:
a[i]=1
a[3],a[2]=1,1
b=[0 for i in range(10**5+5)]
for i in range(3,10**5+3,2):
b[i]=a[i] and a[(i+1)//2]
c=[0]
for i in range(len(b)):
c... | a=[0 for i in range(10**5+3)]
b=[1 for i in range(10**5+3)]
for i in range(2,10**5+3):
if b[i]==1:
for j in range(2*i,10**5+3,i):
b[j]=0
b[0]=0
b[1]=0
for i in range(1,10**5+3,2):
a[i]=b[i] and b[(i+1)//2]
e=[a[0]]
for i in range(1,10**5+3):
e.append(a[i]+e[i-1])
#print(e)
... | p03476 |
Q = int(eval(input()))
lr = []
for i in range(Q):
lr.append(list(map(int, input().split())))
N = 100000
like_number = [3]
prime_number = [2]
for i in range(3, N, 2):
flag = 0
# for j in range(3, int(i**0.5)+1, 2):
for j in prime_number:
if j > int(i**0.5)+1:
break
elif i%j... | def main():
Q = int(eval(input()))
L = [0 for _ in range(Q)]
R = [0 for _ in range(Q)]
for i in range(Q):
L[i], R[i] = list(map(int, input().split()))
N = 100000
sosu = [1 for _ in range(N)]
sosu[0] = 0
for i in range(1,int(N**0.5)):
k = i+1
if sosu[i... | p03476 |
n = 10**5
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes={i for i in primes if (i+1)//2 in primes}
q=int(eval(input()))
for i in range(q):
a,b=list(map(int, input().split()))
print((len(set(range(a,b+1))&primes))) | import bisect
n = 10**5
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes=[i for i in primes if (i+1)//2 in primes]
q=int(eval(input()))
for i in range(q):
a,b=list(map(int, input().split()))
print((bisect.bisect_right(primes, b)... | p03476 |
m = 100010
def primes(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]]
a = primes(m * 2+ 100)
n = int(eval(input()))
... | m = 100010
def primes(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]]
a = primes(m * 2 + 100)
n = int(eval(input())... | p03476 |
import bisect
# ある自然数未満までのエラトステネスの篩をつくる
def mark(s, x):
for i in range(x + x, len(s), x):
s[i] = False
def eratosthenes(n):
s = [True] * n
for x in range(2, int(n ** 0.5) + 1):
if s[x]: mark(s, x)
return [i for i in range(0, n) if s[i] and i > 1]
primes = eratosthenes... | # ある自然数未満までのエラトステネスの篩をつくる
def mark(s, x):
for i in range(x + x, len(s), x):
s[i] = False
def eratosthenes(n):
s = [True] * n
for x in range(2, int(n ** 0.5) + 1):
if s[x]: mark(s, x)
return s
Q = int(eval(input()))
LR = [list(map(int, input().split())) for i in range(Q)]
... | p03476 |
def is_prime(q):
if q == 2: return True
if q < 2 or q&1 == 0: return False
return pow(5, q-1, q)*pow(7, q-1, q) == 1
s = [561, 11041, 29341, 38081, 46657, 50737, 75361, 79381, 88831]
b = [5,7]
for i in range(2,10**5):
if i in s:
continue
if is_prime(i):
b.append(i)
a = set([2*... | def is_prime(q):
if q == 2: return True
if q < 2 or q&1 == 0: return False
return pow(5, q-1, q)*pow(7, q-1, q) == 1
def main():
s = set([561, 11041, 29341, 38081, 46657, 50737, 75361, 79381, 88831])
b = [5,7]
for i in range(2,10**5):
if i in s:
continue
if is_prime(i):
... | p03476 |
Q = int(eval(input()))
query = [list(map(int, input().split())) for _ in range(Q)]
def is_prime(n):
if n <= 1:
return False
if n == 2:
return True
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
prime = []
ans = [0]*100001
sum_a = [0]*100001
for... | Q = int(eval(input()))
query = [list(map(int, input().split())) for _ in range(Q)]
def is_prime(n):
if n <= 1:
return False
if n == 2:
return True
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
prime = [0]*100001
sum_a = [0]*100001
for n in rang... | p03476 |
#!/usr/bin/env python3
import sys
from bisect import bisect_right
def cal_prime(N):
prime_list = set()
ans_list = set()
for i in range(2, N):
flag = True
for j in range(2, int(i**0.5)+1):
if i % j == 0:
flag = False
break
if... | def cal_primes(N):
candidate = [*list(range(2, N+1))]
primes = []
while candidate[0]**2 <= N:
primes.append(candidate[0])
candidate = [*[x for x in candidate if x % candidate[0] != 0]]
primes.extend(candidate)
return primes
Q = int(eval(input()))
primes = set(cal_p... | p03476 |
import sys
sys.setrecursionlimit(100000)
def isPrime(i):
if i == 2 or i == 3:
return True
elif i % 2 == 0:
return False
p = 3
tmp = i ** 0.5
while i != 1:
if i % p == 0:
return False
elif p > tmp:
return True
else:
... | import sys
sys.setrecursionlimit(100000)
def isPrime(i):
if i < 2:
return False
elif i == 2:
return True
elif i % 2 == 0:
return False
for j in range(3, int(i**0.5)+1, 2):
if i % j == 0:
return False
return True
class RSQ_segment_tree:
... | p03476 |
import sys
sys.setrecursionlimit(100000)
def isPrime(i):
if i < 2:
return False
elif i == 2:
return True
elif i % 2 == 0:
return False
for j in range(3, int(i**0.5)+1, 2):
if i % j == 0:
return False
return True
class RSQ_segment_tree:
... | def isPrime(i):
if i < 2:
return False
elif i == 2:
return True
elif i % 2 == 0:
return False
for j in range(3, int(i**0.5)+1, 2):
if i % j == 0:
return False
return True
def inpl(): return list(map(int, input().split()))
Q = int(eval(input... | p03476 |
def factorization(n):
p=2
fcr=[]
while p*p<=n:
while n%p==0:
fcr.append(p)
n//=p
p+=1
if n>1:
fcr.append(n)
return fcr
q=int(eval(input()))
cnt=1
p_list=[1]
q_list=[0]
for i in range(3,10**5+1,2):
a=factorization(i)
b=factorization((i+1)//2)
if len(a)==len(b)==1:
cnt+=1
... | def eratosthenes(n):
is_p=[1]*n
p_list=[]
is_p[0]=0
is_p[1]=0
for i in range(2,n):
if is_p[i]:
p_list.append(i)
for j in range(i*i,n,i):
is_p[j] = 0
# return p_list
return is_p
q=int(eval(input()))
lim=10**5+1
is_p=eratosthenes(lim)
#print(is_p)
b=[0]
for i in range(1,li... | p03476 |
def eratosthenes(n):
is_p=[1]*n
p_list=[]
is_p[0]=0
is_p[1]=0
for i in range(2,n):
if is_p[i]:
p_list.append(i)
for j in range(i*i,n,i):
is_p[j] = 0
# return p_list
return is_p
q=int(eval(input()))
lim=10**5+1
is_p=eratosthenes(lim)
#print(is_p)
b=[0]
for i in range(1,li... | def eratosthenes(n):
is_p=[1]*n
p_list=[]
is_p[0]=0
is_p[1]=0
for i in range(2,n):
if is_p[i]:
p_list.append(i)
for j in range(i*i,n,i):
is_p[j] = 0
return is_p, p_list
lim=10**5+1
is_p, p_list=eratosthenes(lim)
q=int(eval(input()))
b=[0]
for i in range(1,lim+1):
if is_p[i... | p03476 |
def eratosthenes(n):
is_p=[1]*n
p_list=[]
is_p[0]=0
is_p[1]=0
for i in range(2,n):
if is_p[i]:
p_list.append(i)
for j in range(i*i,n,i):
is_p[j] = 0
return is_p, p_list
lim=10**5+1
is_p, p_list=eratosthenes(lim)
q=int(eval(input()))
'''
b=[0]
for i in range(1,lim+1):
if i... | def eratosthenes(n):
is_p=[1]*n
# p_list=[]
is_p[0]=0
is_p[1]=0
for i in range(2,n):
if is_p[i]:
# p_list.append(i)
for j in range(i*i,n,i):
is_p[j] = 0
return is_p#, p_list
lim=10**5+1
#is_p, p_list=eratosthenes(lim)
is_p=eratosthenes(lim)
q=int(eval(input()))
'''
b=[0]
for... | p03476 |
import sys
import bisect
from functools import lru_cache
input = sys.stdin.readline
@lru_cache(maxsize=None)
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
def main():
Q = int(eval(... | import sys
import bisect
input = sys.stdin.readline
def get_primes(n):
sieve = [1] * n
for i in range(3, int(n ** 0.5) + 1, 2):
if sieve[i]:
sieve[i * i:: 2 * i] = [0] * ((n - i * i - 1) // (2 * i) + 1)
return [2] + [i for i in range(3, n, 2) if sieve[i]]
def main():
... | p03476 |
def primes(a):
if a==2 or a%2 != 0:
return True
return False
P=[0]*100001
for i in range(2,100001):
if P[i]==0 and primes(i):
for j in range(i+i,100001,i):
P[j] = 1
C=[0]*100002
for i in range(3,100000,2):
if P[i]==0 and P[int((i+1)/2)]==0:
C[i]+=1... | def primes(a):
if a==2 or a%2 != 0:
return True
return False
P=[0]*100000
for i in range(2,100000):
if P[i]==0 and primes(i):
for j in range(i+i,100000,i):
P[j] = 1
C=[0]*100000
for i in range(3,100000,2):
if P[i]==0 and P[int((i+1)/2)]==0:
C[i]+=1... | p03476 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
n = 10**5
#primes = set(range(3, n+1, 2))|set([2])
primes = set(range(3, n+1, 2)) #偶数は除く
for i in range(3, int(n**0.5+1)):
primes.difference_update(list(range(i*3, n+1, i*2)))
primes = list(primes)
Likes = [0] * (n+1)
cnt = 0
for i in primes:
if (i+1)//2... | #!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
input=sys.stdin.readline
n = 10**5
#primes = set(range(3, n+1, 2))|set([2])
primes = set(range(3, n+1, 2)) #偶数は除く
for i in range(3, int(n**0.5+1)):
primes.difference_update(list(range(i*3, n+1, i*2)))
primes.add(2)
Likes = [0] * (n+1)
cnt = 0
for i... | p03476 |
prime = [True]*((10**5)+1)
prime[0]=False
prime[1]=False
for i in range(2,10**3):
if i*i>10**5:
break
if prime[i]:
for j in range(i,10**5):
if i*j>10**5:
break
prime[i*j]=False
prime2017 = [x for x in prime]
prime2017[2] = False
for i in range(3,(10**5)+1):
if prime[i]:... | import sys
import heapq
import bisect
mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))
def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def S(): return(sys.stdin.readline()[:-1])
def IR(n): return([I() for _ in range(n)])
def GCD(a,b):
while b... | p03476 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
Q = I()
lr = [LI() for i in range(Q)]
import math
def sieve_of_eratosthenes(n):
prime_list = [] # n以下の素数のリスト
A = [1]*(n+1) # A[i] = iが素数なら1,その他は0
A[... | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | p03476 |
from collections import deque
from collections import defaultdict
from collections import Counter
from itertools import permutations
def main():
Q = int(eval(input()))
LR = tuple(tuple(map(int, input().split())) for _ in [0] * Q)
for l, r in LR:
cnt = 0
for i in range(l, r + 1, ... | import bisect
def main():
Q = int(eval(input()))
LR = tuple(tuple(map(int, input().split())) for _ in [0] * Q)
l = min(LR)[0]
r = max(LR, key=lambda x: x[1])[1]
num = []
apnd = num.append
for i in range(l, r + 1, 2):
x = (i + 1) // 2
if is_prime(i) and is_prime(... | p03476 |
M = 10**6
p = [1]*M
p[0] = p[1] = 0
for i in range(2, 4*10**4):
if p[i]:
for j in range(i*i, M, i):
p[j] = 0
C = [0]*M
for i in range(2, M):
if p[i] and p[(i+1)//2]:
C[i] = C[i-1] + 1
else:
C[i] = C[i-1]
q = int(eval(input()))
for i in range(q):
l, r = ... | M = 10**5+1
p = [1]*M
p[0] = p[1] = 0
for i in range(2, 10**3):
if p[i]:
for j in range(i*i, M, i):
p[j] = 0
C = [0]*M
for i in range(2, M):
if p[i] and p[(i+1)//2]:
C[i] = C[i-1] + 1
else:
C[i] = C[i-1]
q = int(eval(input()))
for i in range(q):
l, r = ... | p03476 |
from functools import lru_cache
@lru_cache(maxsize=None)
def is_prime(x):
if x==1:
return False
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
# @lru_cache(maxsize=None)
def like2017(x):
return is_prime(i) and is_prime((i+1)//2)
table... | #from functools import lru_cache
#@lru_cache(maxsize=None)
def is_prime(x):
if x==1:
return False
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
# @lru_cache(maxsize=None)
def like2017(x):
return is_prime(i) and is_prime((i+1)//2)
tab... | p03476 |
import sys
import bisect
input = sys.stdin.readline
n = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
t = prime[c]
prime = [v for v in prime if v == t or v % t != 0]
c = c + 1
if c >= le... | import sys
import bisect
import math
input = sys.stdin.readline
n = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(n)]
mc = 0
for v in l:
mc = max(mc, v[1])
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
bre... | p03476 |
def prime(n):
prime_lst = []
num_lst = []
for i in range(2,n+1):
if i not in num_lst:
prime_lst.append(i)
for j in range(i*i, n+1, i):
#add all the dividers
num_lst.append(j)
#print(prime_lst)
#print(num_lst)
ret... | import math
from itertools import accumulate
def is_prime(n):
if n == 1:
return 0
for k in range(2,int(math.sqrt(n))+1):
if n % k == 0:
return 0
return 1
Q = int(eval(input()))
L = [0]*Q
R = [0]*Q
for i in range(Q):
L[i], R[i] = list(map(int, input(... | p03476 |
import math
def is_prime_sqrt(q): #合成数xはp<=sqrt(x)を満たす素因子pを持つ
if q == 1: #1は素数ではない
return False
if q == 2: #2は素数
return True
elif q % 2 == 0: #2以外の偶数は合成数
return False
for divisor in range(3, math.floor(math.sqrt(q))+1, 2): #繰り返しの上限は平方根
if q % divisor == 0: #平方根... | import math
def is_prime_sqrt(q): #合成数xはp<=sqrt(x)を満たす素因子pを持つ
if q == 1: #1は素数ではない
return False
if q == 2: #2は素数
return True
elif q % 2 == 0: #2以外の偶数は合成数
return False
for divisor in range(3, math.floor(math.sqrt(q))+1, 2): #繰り返しの上限は平方根
if q % divisor == 0: #平方根... | p03476 |
import math
prime = [2]
max = 10 ** 5
limit = int(math.sqrt(max))
data = [i + 1 for i in range(2, max, 2)]
while limit > data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] != 0]
prime = prime + data
lista = [0] * max
for i in prime:
if (i + 1) / 2 in prime:
lista... | import math
prime = [2]
max = 10 ** 5
limit = int(math.sqrt(max))
data = [i + 1 for i in range(2, max, 2)]
# エラストテネスの篩
while limit > data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] != 0]
prime = prime + data
# if (i + 1) / 2 in primeのにぶたん
def binary_search_loop(data, targe... | p03476 |
from itertools import accumulate
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
q = int(eval(input()))
l, r = [],[]
for _ in range(q):
t, tt = list(map(int, input().split()))
l.append(t)
... | from itertools import accumulate
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
q = int(eval(input()))
l, r = [],[]
for _ in range(q):
t, tt = list(map(int, input().split()))
l.append(t)
... | p03476 |
q = int(eval(input()))
a = [list(map(int, input().split())) for i in range(q)]
s = [0]*(2*10**5+2)
s[3] = 1
for i in range(3, 10**5):
for j in range(2, int((2*i)**0.5)+2):
if (i > j and i % j == 0) or (2*i-1) % j == 0:
b = 0
break
else:
b = 1
s[2*i-... | import math
from itertools import accumulate
def is_prime(n):
if n == 1:
return 0
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return 0
return 1
Q = int(eval(input()))
L = [0]*Q
R = [0]*Q
for i in range(Q):
L[i], R[i] = list(map(int, inp... | p03476 |
import bisect
from operator import itemgetter
Q = int(eval(input()))
lr = [list(map(int, input().split())) for _ in range(Q)]
rmax = max(lr, key=itemgetter(1))[1]
primes = list(range(rmax+1))
primes [1] = 0
for i in range(2, int(rmax**0.5)+ 2):
for j in range(2 * i, rmax+1, i):
primes[j] = 0
... | import bisect
from operator import itemgetter
Q = int(eval(input()))
lr = [list(map(int, input().split())) for _ in range(Q)]
rmax = max(lr, key=itemgetter(1))[1]
primes = list(range(rmax+1))
primes [1] = 0
for i in range(2, int(rmax**0.5)+ 2):
for j in range(2 * i, rmax+1, i):
primes[j] = 0
... | p03476 |
q = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(q)]
def prime_table(n):
list = [True for _ in range(n+1)]
for i in range(2,int(n**0.5)+1):
if list[i]:
j = i*2
while j<=n:
list[j] = False
j += i
table = [i f... | q = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(q)]
def prime_table(n):
list = [True for _ in range(n+1)]
for i in range(2,int(n**0.5)+1):
if list[i]:
j = i*2
while j<=n:
list[j] = False
j += i
table = [i f... | p03476 |
from bisect import bisect, bisect_left
size = 10 ** 5 + 1
is_prime = [True] * size
is_prime[0] = is_prime[1] = False
# √size まで
for i in range(2, 317):
j = 2 * i
while j < size:
is_prime[j] = False
j += i
like_numbers = [
i
for i, x in enumerate(is_prime)
if x and (i + 1) % 2 =... | from bisect import bisect, bisect_left
size = 10 ** 5 + 1
is_prime = [True] * size
is_prime[0] = is_prime[1] = False
# √size まで
for i in range(2, 317):
j = 2 * i
while j < size:
is_prime[j] = False
j += i
# 先に like_numbers のテーブルを作っておく
like_numbers = [
i
for i, x in enumerate(... | p03476 |
from bisect import bisect, bisect_left
size = 10 ** 5 + 1
is_prime = [True] * size
is_prime[0] = is_prime[1] = False
# √size まで
for i in range(2, 317):
j = 2 * i
while j < size:
is_prime[j] = False
j += i
# 先に like_numbers のテーブルを作っておく
like_numbers = [
i
for i, x in enumerate(... | from itertools import count
N = 10 ** 5 + 10
is_prime = [True] * N
is_prime[0] = is_prime[1] = False
# ほぼO(N)
for i in range(N):
if is_prime[i]:
for j in count(2 * i, i):
if j >= N:
break
is_prime[j] = False
is_2017_like_number = [0] * N
# O(N)
for i in range(N):
... | p03476 |
import math
def Sieve_of_Eratosthenes(N):
prime={}
for i in range(2,N+1):
prime[i]=1
for i in range(2,math.ceil(N**0.5)+1):
tmp=set()
for j in prime:
if j>i and j%i==0: tmp.add(j)
for j in tmp:
prime.pop(j)
return prime
N=10**5
prime=Sieve_of_Eratosthenes(N)
a=[0]*(N)
for i in ran... | import math
def sieve(n):
if n < 2:
is_prime = [False for _ in range(n+1)]
return is_prime
is_prime = [True for _ in range(n+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
... | p03476 |
import math
def sieve(n):
if n < 2:
is_prime = [False for _ in range(n+1)]
return is_prime
is_prime = [True for _ in range(n+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
... | import sys
def sieve(n):
if n < 2:
is_prime = [False for _ in range(n+1)]
return is_prime
is_prime = [True for _ in range(n+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
... | p03476 |
N = int(eval(input()))
MAX=110000
S = [_+2 for _ in range(MAX)]
old = S
i = 0
while True:
new = set([])
t = old[i]
for j in range(len(old)):
if old[j] == t or old[j]%t != 0:
new.add(old[j])
if len(old) == len(new):
break
old = list(new)
old.sort()
i += 1
#print(old)
A = ... | def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = [2]
limit = int(n**0.5) #ルートn以上で割れることはない
data = [i + 1 for i in range(2, n, 2)] #最初から3スタートの奇数にしておく
while True:
p ... | p03476 |
import math
n = 100000
integer = [i for i in range(2,n+1)]
prime = []
while integer[0] <= math.sqrt(n):
p = integer[0]
prime.append(p)
integer = [i for i in integer if i % p != 0]
prime = prime + integer
like = []
likesum = [0]*(n+1)
for i in range(len(prime)):
if (prime[i]+1)//2 in prime:
... | import math
n = 100000
integer = [i for i in range(2,n+1)]
prime = set()
while integer[0] <= math.sqrt(n):
p = integer[0]
prime.add(p)
integer = [i for i in integer if i % p != 0]
prime = prime | set(integer)
like = set()
likesum = [0]*(n+1)
for i in prime:
if (i+1)//2 in prime:
li... | p03476 |
def get_prime(x):
if x <= 1:
return []
prime = [2]
limit = int(x**0.5)
data = [i + 1 for i in range(2, x, 2)]
while limit > data[0]:
prime.append(data[0])
data = [j for j in data if j%data[0] != 0]
return prime + data
q=int(eval(input()))
ta... | def get_prime(x):
l = [True] * (x + 1)
l[0] = False
l[1] = False
for i in range(2,int(x**0.5) + 1):
if not l[i]:
continue
for j in range(i * 2, x + 1, i):
l[j] = False
return l
q=int(eval(input()))
table = get_prime(100000)
s=[0]*(100001)
... | p03476 |
Q=int(eval(input()))
def isPrime(x):
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
else:
return True
plist=[False]*(10**5+3)
for i in range(3,10**5+3,2):
if isPrime(i) and isPrime((i+1)//2):
plist[i]=True
#print(plist[:10])
slist=[0]*(10**5+3)
for i in range(3,10**5... | Q=int(eval(input()))
def prime_sieve(n):
prime_list=[True]*n
prime_list[0]=False
prime_list[1]=False
for i in range(2,int(n**0.5)+1):
if not prime_list[i]:
continue
else:
for j in range(i**2,n,i):
prime_list[j]=False
return prime_list
#return [i for i in range(n... | p03476 |
'''
∧_,,∧ 究極奥義「WAがACになーれ！！」
（`・ω・)つ━☆・*。
⊂ ノ ・゜+.
し’´Ｊ *・
'''
import sys
input = sys.stdin.readline
def sieve(n):
is_prime = [True for _ in range(n+1)]
is_prime[0] = False
for i in range(2, n+1):
if is_prime[i-1]:
j = 2 * i
while j <= n:
... | import sys
input = sys.stdin.readline
from math import sqrt
def Eratosthenes(n):
"""n(>=6)未満の素数列挙 """
n, correction = n - n % 6 + 6, 2 - (n % 6 > 1)
sieve = [True] * (n // 3)
for i in range(1, int(sqrt(n)) // 3 + 1):
if sieve[i]:
k = 3 * i + 1 | 1
sieve[k * ... | p03476 |
import sys
input = sys.stdin.readline
from math import sqrt
def Eratosthenes(n):
"""n(>=6)未満の素数列挙 """
n, correction = n - n % 6 + 6, 2 - (n % 6 > 1)
sieve = [True] * (n // 3)
for i in range(1, int(sqrt(n)) // 3 + 1):
if sieve[i]:
k = 3 * i + 1 | 1
sieve[k * ... | import sys
input = sys.stdin.readline
from math import sqrt
def Eratosthenes(n):
"""n(>=6)未満の素数列挙 """
n, correction = n - n % 6 + 6, 2 - (n % 6 > 1)
sieve = [True] * (n // 3)
for i in range(1, int(sqrt(n)) // 3 + 1):
if sieve[i]:
k = 3 * i + 1 | 1
sieve[k * ... | p03476 |
import math
RMAX = 10**5
def get_primes(n):
ps = []
upper = math.sqrt(n)
data = [i+1 for i in range(1, n)]
while True:
p = data[0]
if p >= upper:
break
ps.append(p)
data = [e for e in data if e%p != 0]
return ps + data
primes = get_primes(... | NMAX = 10**5+1
is_prime = [True]*NMAX
for i in range(2, NMAX):
if is_prime[i]:
for j in range(2*i, NMAX, i):
is_prime[j] = False
sim_2017 = [0]*NMAX
for i in range(3, NMAX, 2):
if is_prime[i] and is_prime[(i+1)//2]:
sim_2017[i] += 1
for i in range(1, NMAX):
sim_201... | p03476 |
import math
# def primes(x):
# if x < 2: return []
# primes = [i for i in range(x)]
# primes[1] = 0 # 1は素数ではない
# x_sqrt = math.sqrt(x) # 記憶させていちいち計算しない
# # エラトステネスのふるい
# for prime in primes:
# if prime == 0:
# continue # 先に処理
# if prime > x_sqrt:
# ... | # -*- coding: utf-8 -*-
import math
Q = int(eval(input()))
ls = []
rs = []
for n in range(Q):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
num = 0
max_r = max(rs)
def eratos(n):
if n == 1:
return set()
primes = [1 for i in range(n+1)]
primes[0... | p03476 |
n=8**6;P=[0,0]+[1]*n;S=[0]*n
for i in range(2,n):
for j in range(2*i,n,i):P[j]=0
for i in range(1,n):S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | n=7**6;P=[0,0]+[1]*n;S=[0]*n
for i in range(2,n):
for j in range(2*i,n,i):P[j]=0
for i in range(1,n):S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | p03476 |
n=7**6;P=[0,0]+[1]*n;S=[0]*n;r=list(range(2,n))
for i in r:
for j in range(2*i,n,i):P[j]=0
for i in r:S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | n=7**6;P=[0,0]+[1]*n;S=[0]*n
for i in range(2,n):
for j in range(2*i,n,i):P[j]=0
S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | p03476 |
import sys
import math
def input(): return sys.stdin.readline().rstrip()
def isPrime(n):
if n <= 2:
return 0
m = (n + 1) // 2
n_sqrt = int(math.sqrt(n))
for i in range(2, n_sqrt + 1):
if n % i == 0 or m % i == 0:
return 0
else:
return 1
def main... | import sys
import math
def input(): return sys.stdin.readline().rstrip()
def isPrime(n):
m = (n + 1) // 2
n_sqrt = int(math.sqrt(n))
for i in range(2, n_sqrt + 1):
if n % i == 0 or m % i == 0:
return 0
else:
return 1
def main():
Q = int(eval(input()))
... | p03476 |
import sys
import math
def input(): return sys.stdin.readline().rstrip()
def isPrime(n):
m = (n + 1) // 2
n_sqrt = int(math.sqrt(n))
for i in range(2, n_sqrt + 1):
if n % i == 0 or m % i == 0:
return 0
else:
return 1
def main():
Q = int(eval(input()))
... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
MAX = 10 ** 5
Q = int(eval(input()))
ans = [0] * (MAX + 1)
sum = 0
prime = set()
memo = [False] * 2 + [True] * (MAX - 1)
for i in range(2, MAX + 1):
if memo[i]:
prime.add(i)
... | p03476 |
from sys import stdin
from itertools import accumulate
q = int(stdin.readline().rstrip())
l_r = [list(map(int,stdin.readline().rstrip().split())) for _ in range(q)]
max_n = 0
for s in l_r:
max_n = max(s[1], max_n)
# print(max_n)
# print(l_r)
a = [i for i in range(max_n+1)]
def isPrime(num):
if nu... | from sys import stdin
from itertools import accumulate
q = int(stdin.readline().rstrip())
l_r = [list(map(int,stdin.readline().rstrip().split())) for _ in range(q)]
max_n = 0
for s in l_r:
max_n = max(s[1], max_n)
# print(max_n)
# print(l_r)
a = [i for i in range(max_n+1)]
def isPrime(num):
if nu... | p03476 |
import bisect
q = int(eval(input()))
def pr(n):
is_prime = [True]*(n+2)
is_prime[0] = False
is_prime[1] = False
for i in range(2,int((n+1)**0.5)+1):
for j in range(2,i+1):
if is_prime[i] == False:
continue
for k in range(2*i,n+1,i):
... | q = int (eval(input()))
def pr(n):
L = [1]*(n+1)
L[0] = 0
L[1] = 0
for i in range(2,n+1):
for j in range(2*i,n,i):
L[j] = 0
return L
a = pr(100001)
li = [0]*(100001)
for i in range(1,100000,2):
if a[i] and a[(i+1)//2]:
li[i] = 1
from ... | p03476 |
import math
N = 10**5
Q = int(eval(input()))
def eratosthenes(n):
"""n以下の素数をエラトステネスの篩によって求める."""
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in ran... | import math
N = 10**5
Q = int(eval(input()))
def eratosthenes(n):
"""n以下の素数をエラトステネスの篩によって求める."""
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in ran... | p03476 |
# -*- coding: utf-8 -*-
import math
Q = int(eval(input()))
ls = []
rs = []
for n in range(Q):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
num = 0
max_r = max(rs)
def eratos(n):
if n == 1:
return set()
primes = [1 for i in range(n+1)]
primes[0... | # -*- coding: utf-8 -*-
import math
Q = int(eval(input()))
ls = []
rs = []
for n in range(Q):
l, r = list(map(int, input().split()))
ls.append(l)
rs.append(r)
num = 0
max_r = max(rs)
def eratos(n):
if n == 1:
return set()
primes = [1 for i in range(n+1)]
primes[0... | p03476 |
import math
import copy
# 0以上整数x「未満」の素数をリストに格納して返す
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0 # 1は素数ではない
# エラトステネスのふるい
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * ... | import math
import copy
# 0以上整数x「未満」の素数をリストに格納して返す
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0 # 1は素数ではない
# エラトステネスのふるい
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * ... | p03476 |
import sys
input = sys.stdin.readline
def primes(n):
""" Input n>=6, Returns a list of primes, 2 <= p < n """
n, correction = n-n%6+6, 2-(n%6>1)
sieve = [True] * (n//3)
for i in range(1,int(n**0.5)//3+1):
if sieve[i]:
k=3*i+1|1
sieve[ k*k//3 ::2*k] = [False] * ... | import itertools
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
pl = prime_boolean_table(10**5)
ql = ... | p03476 |
import itertools
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
pl = prime_boolean_table(10**5)
ql = ... | import itertools
import sys
input = sys.stdin.readline
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
... | p03476 |
# TLEするっぽいなー
Q = int(eval(input()))
LR = [tuple(map(int,input().split())) for _ in range(Q)]
N = 100010
# まずは素数列挙
P = []
A = [True]*N
for i in range(2,N):
if A[i]:
P.append(i)
j = 2
while i*j < N:
A[i*j] = False
j += 1
# 整数iまでの「2017数」を数える
Ans = [0]*... | # python 3.4.3
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
N = 100010
primes = []
is_prime = [True]*N
for i in range(2,N):
if is_prime[i]:
primes.append(i)
... | p03476 |
from math import ceil, sqrt
Q = int(eval(input()))
querys = [tuple(map(int, input().split())) for i in range(Q)]
N = max(list(map(max, querys)))
Primes = [False] * 2 + [True] * (N - 1)
for i in range(3, N + 1):
for j in range(2, ceil(sqrt(i)) + 1):
if i % j == 0:
Primes[i] = False
... | from math import ceil, sqrt
Q = int(eval(input()))
querys = [tuple(map(int, input().split())) for i in range(Q)]
N = max(list(map(max, querys)))
Primes = [False] * 2 + [True] * (N - 1)
for i in range(3, N + 1):
for j in range(2, ceil(sqrt(i)) + 1):
if i % j == 0:
Primes[i] = False
... | p03476 |
import math
import sys
prime_numbers = set()
input = lambda: sys.stdin.readline().strip()
def is_primenumber(x):
if x in prime_numbers:
return True
if x == 1:
return False
elif x == 2:
prime_numbers.add(2)
return True
else:
for i in range(2, int... | import math
import itertools
import sys
prime_numbers = set()
table = [0 for i in range(10 ** 5 + 1)]
input = lambda: sys.stdin.readline().strip()
def is_primenumber(x):
if x in prime_numbers:
return True
if x == 1:
return False
elif x == 2:
prime_numbers.add(2)
... | p03476 |
import math
def is_prime(n):
if n == 1:
return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
q = int(eval(input()))
scope = [tuple(map(int, input().split())) for _ in range(q)]
prime_cnt = [0] * (10 ** 5 + 1)
for i ... | import math
q = int(eval(input()))
scope = [tuple(map(int, input().split())) for _ in range(q)]
prime_flag = [True] * (10 ** 5 + 1)
prime_flag[0] = False
prime_flag[1] = False
prime_cnt = [0] * (10 ** 5 + 1)
for i in range(2, math.ceil(math.sqrt(10 ** 5))):
for j in range(i + i, 10 ** 5 + 1, i):
... | p03476 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.