input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from itertools import accumulate
N = 100000
prime = [True for _ in range(N+1)]
prime[0] = False
prime[1] = False
i = 2
for i in range(N+1):
if prime[i]:
for j in range(2*i, N+1, i):
prime[j] = False
prime2 = [0 for _ in range(N+1)]
for i in range(N+1):
if prime[i] and prime[(i+1)... | from itertools import accumulate
N = 100000
prime = [True for _ in range(N+1)]
prime[0] = False
prime[1] = False
i = 2
for i in range(N+1):
if prime[i]:
for j in range(2*i, N+1, i):
prime[j] = False
prime2 = [1 if prime[i] and prime[(i+1)//2] else 0 for i in range(N+1)]
acc = list(a... | p03476 |
prime=[]
n=10**5
is_prime=True
for i in range(2,n+1):
is_prime=True
for p in prime:
if i%p==0:
is_prime=False
break
if is_prime:
prime.append(i)
q=int(eval(input()))
query=[[int(i) for i in input().split()] for j in range(q)]
for qu in query:
cnt=0
... | def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
... | p03476 |
from math import sqrt
q = int(eval(input()))
primes = {i for i in range(2,10**5 + 1)}
for i in range(2,int(sqrt(10**5+1)) + 1):
if i in primes:
mul = 2
while i*mul <= 10**5:
primes.discard(i*mul)
mul += 1
ret = [0]*(1 + 10**5)
for i in range(3,1 + 10**5):
i... | def main():
from itertools import accumulate
def Eratosthenes(x: int) -> set:
from math import sqrt
sup = int(x)
primes = {i for i in range(2, sup+1)}
for i in range(2, int(sqrt(sup+1))+1):
if i in primes:
mul = 2
while i*mul... | p03476 |
def main():
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup+1)]
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if sup < i*i:
break
if primes[i]:
mul = 2
... | def main():
import sys
input = sys.stdin.buffer.readline
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup+1)]
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if sup < i*i:
bre... | p03476 |
primes = set([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, ... | from itertools import accumulate
primes = {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... | p03476 |
from itertools import accumulate
primes = {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... | from itertools import accumulate
sim = {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, ... | p03476 |
def main():
q=int(eval(input()))
aa=0
bb=0
a=[]
b=[]
ac=[]
bc=[]
for _ in range(q):
aa,bb=list(map(int,input().split()))
a.append(aa)
b.append(bb)
# ac.append(aa)
# bc.append(bb)
# sorted(a)
# sorted(b)
bm=max(b)
... | def main():
q=int(eval(input()))
aa=0
bb=0
a=[]
b=[]
ac=[]
bc=[]
for _ in range(q):
aa,bb=list(map(int,input().split()))
a.append(aa)
b.append(bb)
# ac.append(aa)
# bc.append(bb)
# sorted(a)
# sorted(b)
bm=max(b)
... | p03476 |
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... | from itertools import accumulate
# エラトステネスの篩（素数）
def sieve(n):
is_prime = [True for _ in range(n)]
is_prime[0] = False
for i in range(2, n+1):
if is_prime[i-1]:
j = 2 * i
while j <= n:
is_prime[j-1] = False
j += i
table = [... | 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()))
ans = [0] * (10**5+1)
prime = [0] * (10**5+1)
for i in range(1,10**5+1):
if is_prime(i):
prime[i] = 1
... | def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return is_prime
Q = int(eval(input()))
ans = [0]... | p03476 |
import sys
def solve(l, r, primeset):
res = 0
for i in range(l, r + 1, 2):
if i in primeset and (i + 1) // 2 in primeset:
res += 1
return res
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
primelist = [2]
A = 10 ** 5 + 10
for L i... | MAX = 10 ** 5 + 1
f = [True] * (MAX)
c = [0] * (MAX + 1)
for i in range(2, MAX):
if f[i]:
for j in range(i + i, MAX, i):
f[j] = False
for i in range(3, MAX, 2):
if f[i] and f[(i + 1) // 2]:
c[i] += 1
for i in range(3, MAX):
c[i] += c[i - 1]
Q = int(eval(input()))
f... | p03476 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | p03476 |
max_lr = 10 ** 5
sieve = [True] * (max_lr + 1)
sieve[0] = False
sieve[1] = False
for i in range(2, max_lr + 1):
if not sieve[i]:
continue
for j in range(i * i, max_lr + 1, i):
sieve[j] = False
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if sieve[i] and sieve[(i +... | from math import sqrt
max_lr = 10 ** 5
sieve = [True] * (max_lr + 1)
sieve[0] = False
sieve[1] = False
for i in range(2, int(sqrt(max_lr)) + 1):
if not sieve[i]:
continue
for j in range(i * i, max_lr + 1, i):
sieve[j] = False
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1,... | p03476 |
# エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = [0] * (N + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, N + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, N + 1, i):
if sieve[j] == 0:
sieve[j] = i
re... | # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = list(range(N + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(N ** 0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, N + 1, i):
if sieve[j] == j:
sieve[j] = i
return ... | p03476 |
# エラトステネスの篩, 累積和
def make_prime_table(n):
sieve = list(range(n + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(n ** 0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, n + 1, i):
if sieve[j] == j:
sieve[j] = i
return ... | # エラトステネスの篩, 累積和
def make_prime_table(n):
sieve = list(range(n + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(4, n + 1, 2):
sieve[i] = 2
for i in range(3, int(n ** 0.5) + 1, 2):
if sieve[i] != i:
continue
for j in range(i * i, n + 1, i * 2):
... | p03476 |
def sb(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | import math
q=int(eval(input()))
num=[0]*(10**5+5)
ans=[0]*(10**5+5)
num[2]=1
for i in range(3,10**5+2,2):
yn=0
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
yn=1
break
if yn==0:
num[i]=1
if num[(i+1)//2]==1:
ans[i]=1
for i in ra... | p03476 |
import math
import bisect
def get_prime(number):
prime_list = []
search_list = list(range(2,number + 1))
while search_list[0] <= math.sqrt(number):
head_num = search_list.pop(0)
prime_list.append(head_num)
search_list = [num for num in search_list if num % head_num != 0]
... | def prime_factor_table(n):
table = [0] * (n + 1)
for i in range(2, n + 1):
if table[i] == 0:
for j in range(i + i, n + 1, i):
table[j] = i
return table
l = prime_factor_table(100000)
l[0] = 1
l[1] = 1
l2 = [0]*100000
for i in range(1,100000,2):
x =... | p03476 |
import math
Q = int(eval(input()))
li = [0]
cnt = 0
for i in range(3, 10**5+1, 2):
flag = True
for j in range(2, int(math.sqrt(i))+1):
if i % j == 0:
flag = False
for j in range(2, int(math.sqrt((i+1)//2)+1)):
if ((i+1)//2) % j == 0:
flag = False
if flag:
cnt += 1
li.ap... | import math
Q = int(eval(input()))
li = [0]
cnt = 0
for i in range(3, 10**5+1, 2):
flag = True
for j in range(2, int(math.sqrt(i))+1):
if i % j == 0:
flag = False
if flag:
for j in range(2, int(math.sqrt((i+1)//2)+1)):
if ((i+1)//2) % j == 0:
flag = False
if flag:
... | p03476 |
n = int(eval(input()))
"""素因数分解"""
def factrize(n):
b = 2
while b*b <= n:
if n % b == 0:
return False
b = b+1
return True
f = [2]
for i in range(3,10**5+2,2):
if factrize(i):
f.append(i)
c = []
for j in f:
if (j + 1)//2 in f:
c.appe... | import sys
import bisect
readline = sys.stdin.buffer.readline
"""素数判定はこっち"""
def factrize(n):
b = 2
while b*b <= n:
if n % b == 0:
return False
b = b+1
return True
f = []
for i in range(3,10**5+2,2):
if factrize(i):
if factrize((i+1)//2):
... | p03476 |
#!/usr/bin/env python3
from itertools import accumulate
def erat(m):
p = [1] * m
p[0] = p[1] = 0
for x in range(2, int((~-m)**.5) + 1):
if p[x]:
for y in range(x*x, m, x):
p[y] = 0
return p
INF = 10**5 + 1
p = erat(INF)
q = [0] * INF
for n in range(INF)... | def erat(M):
p = [1] * M
p[0] = p[1] = 0
for x in range(2, int((M - 1)**.5) + 1):
if p[x]:
for y in range(x*x, M, x):
p[y] = 0
return p
INF = 10**5 + 1
p = erat(INF)
q = [0] * INF
from itertools import*
for i in range(INF):
q[i] = i%2 * p[i] * p[-~i//... | p03476 |
def prime(i):
if i == 2:
return True
else:
if i % 2 == 0:
return False
for j in range(3, int(i**0.5)+1, 2):
if i % j == 0:
return False
return True
Q = int(eval(input()))
l_r = [[int(_) for _ in input().split()] for _ in range(... | Q = int(eval(input()))
l_r = [[int(_) for _ in input().split()] for _ in range(Q)]
prime = [False]*(10**5+1)
Csum = [0]*(10**5+1)
for i in range(2, 10**5+1):
if not prime[i]:
for j in range(i*2, 10**5+1, i):
prime[j] = True
cnt = 0
for i in range(3, 10**5+1, 2):
if (not prime[i... | p03476 |
import bisect
def Get_Sieve_of_Eratosthenes(N):
prime_list = [2]
limit = int(N ** 0.5)
numeric_data = [i for i in range(3, N, 2)]
while True:
prime = numeric_data[0]
if prime >= limit:
return prime_list + numeric_data
prime_list.append(prime)
numer... | N = 10**5
prime_list = [True] * (N+1) # True が素数
count_list = [0] * (N+1)
for i in range(2, N+1, 1):
if prime_list[i]:
for j in range(i+i, N+1, i):
prime_list[j] = False
for i in range(3, N+1, 2):
if prime_list[i] and prime_list[(i+1)//2]:
count_list[i] += 1
for ... | p03476 |
def is_prime(num):
if num == 1:
return False
limit = int(num ** 0.5) + 1
for i in range(2, limit):
if num % i == 0:
return False
return True
cumsum = [0] * (10**5 + 2)
count = 0
for num in range(1, 10**5, 2):
if is_prime(num):
if is_prime((num+1)... | primes = set(range(3, 10**5, 2))
primes.add(2)
cumsum = [0] * (10**5 + 2)
for i in range(3, 10**5):
if i in primes:
for not_prime in range(i+i, 10**5, i):
primes.discard(not_prime)
count = 0
for num in range(1, 10**5, 2):
if num in primes:
if (num+1)//2 in primes:
... | p03476 |
#!/usr/bin/env python3
def main():
is_prime = sieve(10 ** 5 + 1)
is_like2017 = [(is_prime[i] and is_prime[(i + 1) // 2]) for i in range(10 ** 5 + 1)]
counter = [0]
for i in range(1, 10 ** 5 + 1):
counter.append(counter[-1] + (1 if is_like2017[i] else 0))
q = int(eval(input()))
... | #!/usr/bin/env python3
import sys
def main():
is_prime = sieve(10 ** 5 + 1)
is_like2017 = [(is_prime[i] and is_prime[(i + 1) // 2]) for i in range(10 ** 5 + 1)]
counter = [0]
for i in range(1, 10 ** 5 + 1):
counter.append(counter[-1] + (1 if is_like2017[i] else 0))
q = int(eval... | p03476 |
import math
Q = int(eval(input()))
ps = []
maxfac = math.sqrt(10**5)
nums = [i+1 for i in range(1, 10**5)]
while True:
p = nums[0]
if maxfac <= p:
break
ps.append(p)
nums = [num for num in nums if num % p != 0]
ps = set(ps + nums)
c = [0] * 10**5
for i in range(3, 10**5+1, 2)... | Q = int(eval(input()))
maxn = 10**5
is_prime = [True if i%2 == 1 else False for i in range(0, maxn+1) ]
is_prime[0] = False
is_prime[1] = False
is_prime[2] = True
for i in range(3, int(maxn**0.5) + 1, 2):
if not is_prime[i]:
continue
for j in range(i*2, maxn+1, i):
is_prime[j] = False
... | p03476 |
def isPrime(n):
for p in primes:
if n%p == 0:
return False
elif n < p*p:
return True
primes = [2,3,5,7]
for i in range(11,10**5,2):
if isPrime(i):
primes.append(i)
n2017s = [0]
for p in primes[1:]:
if (p+1)//2 in primes:
n2017s.append(p)... | def isPrime(n):
for p in primes:
if n%p == 0:
return False
elif n < p*p:
return True
primes = [2,3,5,7]
for i in range(11,10**5,2):
if isPrime(i):
primes.append(i)
n2017s = [0]
for p in primes[1:]:
if (p+1)//2 in primes:
n2017s.append(p)... | p03476 |
Q = int(eval(input()))
LR = [list(map(int,input().split())) for _ in [0]*Q]
N = max(r for l,r in LR)
p = set()
for i in range(3,N+1,2):
for j in p:
if i%j==0:break
else:
p.add(i)
p.add(2)
c = [0]*(N+1)
for i in p:
if (i+1)//2 in p:c[i] = 1
#累積和
class cumulative_sum:
... | Q = int(eval(input()))
LR = [list(map(int,input().split())) for _ in [0]*Q]
N = max(r for l,r in LR)
p = []
for i in range(3,N+1,2):
for j in p:
if i%j==0: break
if j*j>i:
p.append(i)
break
else:
p.append(i)
p.append(2)
p = set(p)
c = [0]*(N+1)... | p03476 |
Q = int(eval(input()))
N = 10**5 + 1000
def getPrimes():
isPrime = [True] * N
isPrime[1] = False
for i in range(2, N):
if not isPrime[i]:
continue
for p in range(i + i, N, i):
isPrime[p] = False
return isPrime
isPrime = getPrimes()
A = [0] * (N... | Q = int(eval(input()))
R = 10**5 + 100
def getPrimes():
isPrime = [True] * R
isPrime[0] = False
isPrime[1] = False
for i in range(R):
if not isPrime[i]:
continue
for p in range(i * 2, R, i):
isPrime[p] = False
return isPrime
isPrime = getPrimes... | p03476 |
def isprime(n):
'''check if integer n is a prime'''
# make sure n is a positive integer
n = abs(int(n))
# 0 and 1 are not primes
if n < 2:
return False
# 2 is the only even prime number
if n == 2:
return True
# all other even numbers are not primes
... | def sieve(n):
is_prime = [1] * (n + 1)
is_prime[0], is_prime[1] = 0, 0
for i in range(2, n+1):
if not is_prime[i]:
continue
j = i*2
while j <= n:
is_prime[j] = 0
j += i
return is_prime
def resolve():
q = int(eval(input()))
qs = [list(map(int, input().split())) for _ in range(q)]
ps... | p03476 |
Q = int(eval(input()))
numberlist = [0 for i in range(100001)]
prime = [2]
for i in range(3, 100001, 2):
flag = 1
for j in prime:
if i % j == 0:
flag = 0
break
if flag == 1:
prime.append(i)
for i in prime:
if (i+1)//2 in prime:
numberlist[... | import sys
input = sys.stdin.readline
Q = int(eval(input()))
numberlist = [0 for i in range(100001)]
prime = [2]
for i in range(3, 100001, 2):
flag = 1
for j in prime:
if i % j == 0:
flag = 0
break
if flag == 1:
prime.append(i)
for i in prime:
if... | p03476 |
q = int(eval(input()))
lr = []
for i in range(q):
lr.append(list(map(int, input().split())))
def binarySearch(alist, item):
first = 0
last = len(alist) - 1
found = False
while first <= last and not found:
midpoint = (first + last) // 2
if alist[midpoint] == item:
... | q = int(eval(input()))
lr = []
for i in range(q):
lr.append(list(map(int, input().split())))
def binarySearch(alist, item):
first = 0
last = len(alist) - 1
found = False
while first <= last and not found:
midpoint = (first + last) // 2
if alist[midpoint] == item:
... | p03476 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
from time import time
def is_prime(n):
if n == 1:
return 0
i = 2
while i**2 <= n:
if n % i == 0:
return 0
i += 1
return 1
def main():
q = int(i... | import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
from time import time
def is_prime(n):
if n == 1:
return 0
i = 2
while i**2 <= n:
if n % i == 0:
return 0
i += 1
return 1
def main():
q = int(i... | p03476 |
Q=int(eval(input()))
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//i)
return divisors
l=[]
r=[]
for i in range(Q):
a,b=list(map(int,input().split()))
... | 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=list(map(int,input().split(... | p03476 |
#素数判定
import math
from itertools import accumulate
def sosuu(n):
if n==1:
return False
else:
for i in range(2,int(math.sqrt(n)+1)):
if n%i==0:
return False
return True
#入力
q=int(eval(input()))
l=[0]*q
r=[0]*q
for i in range(q):
l[i],r[i]=list(map(int,input().split()))... | import math
from itertools import accumulate
q=int(eval(input()))
l=[]
r=[]
for i in range(q):
a,b=list(map(int,input().split()))
l.append(a)
r.append(b)
def is_prime(n):
if n==1:
return False
elif n==2:
return True
else:
for i in range(2,int(math.sqrt(n)+1)):
if n%i==0... | p03476 |
import math
Q = int(eval(input()))
# 素数表
n = 100000
P = [False] * n
P[2] = True
for i in range(3, n, 2):
k = True
for j in range(3, int(math.sqrt(i)) + 1, 2):
if i % j == 0:
k = False
break
if k:
P[i] = True
# Nと(N+1)÷2が素数か否か
a = [0] * n
for i in... | import sys
from itertools import accumulate
input = sys.stdin.readline
N = int(eval(input()))
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):
... | p03476 |
from sys import stdin
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
prime_list=[i for i in range(2,100000) if is_prime(i)]
oppai=[0]*100000
oppai[1]=0
before=1
for num in prime_list:
if (num+1)//... | from sys import stdin
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
prime_list=[i for i in range(2,100000) if is_prime(i)]
oppai=[0]*100000
oppai[1]=0
before=1
for num in prime_list:
if (num+1)//... | p03476 |
import math
q = int(eval(input()))
cnt = [0] * (5 * 10 ** 4)
cnt[1] = 1
cnt[2] = 2
def is_prime(n):
visit = []
if n % 2 == 0:
return 0
for i in range(3, 1 + math.ceil(n ** (0.5))):
if i not in visit:
if n % i == 0:
return 0
else:
... | import math
q = int(eval(input()))
cnt = [0] * (5 * 10 ** 4)
cnt[1] = 1
cnt[2] = 2
def is_prime(n):
visit = []
if n % 2 == 0:
return 0
for i in range(3, 1 + math.ceil(n ** (0.5))):
if i not in visit:
if n % i == 0:
return 0
else:
... | p03476 |
Q = int(eval(input()))
l, r = [], []
for i in range(Q):
_l, _r = list(map(int, input().split()))
l.append(_l)
r.append(_r)
max_r = max(r)
sosu = set()
for i in range(2, max_r+1):
for s in sosu:
if i%s == 0:
break
else:
sosu.add(i)
sums = [0] * (max_r + 1)
... | Q = int(eval(input()))
l, r = [], []
for i in range(Q):
_l, _r = list(map(int, input().split()))
l.append(_l)
r.append(_r)
max_r = max(r)
is_sosu = [1] * (max_r + 1)
is_sosu[0] = is_sosu[1] = 0
for i in range(2, max_r+1):
if is_sosu[i]:
for j in range(i*i, max_r+1, i):
... | p03476 |
def get_sieve_of_eratosthenes_new(n):
import math
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]
... | def get_sieve_of_eratosthenes_new(n):
import math
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 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def is_prime(n):
if n == 1:
return False
for k in range(2, int(pow(n, 0.5)) + 1):
if n % k == 0:
return False
return True
def resolve():
q = int(eval(input()))
LR = [li... | # https://atcoder.jp/contests/abc084/tasks/abc084_d
# D - 2017-like Number
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
# 素数判定
def is_prime(n):
if n == 1:
return False
for k in range(2, int(pow(n, 0.5)) + 1):
if n % k == 0:
return... | p03476 |
# https://atcoder.jp/contests/abc084/tasks/abc084_d
# D - 2017-like Number
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
# 素数判定
def is_prime(n):
if n == 1:
return False
for k in range(2, int(pow(n, 0.5)) + 1):
if n % k == 0:
return... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
def is_prime(n):
if n == 1:
return False
for k in range(2, int(pow(n, 0.5)) + 1):
if n % k == 0:
return False
return True
q = int(ev... | p03476 |
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)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
... | def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
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]]
... | p03476 |
import math
Q = int(eval(input()))
l_r = [list(map(int, input().split())) for _ in range(Q)]
def isprime(n):
if n <= 1:
return False
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return False
return True
def like(x):
if isprime(x) and isprime((x+1)//2)... | import math
import sys
sys.setrecursionlimit(10000000)
Q = int(eval(input()))
l_r = [list(map(int, input().split())) for _ in range(Q)]
prime = []
def isprime(n):
if n in prime:
return True
if n <= 1:
return False
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:... | p03476 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p03476 |
import math
isPrime = [True for i in range(10**5+1)]
for i in range(3, 10**5+1):
for j in range(2, math.floor(math.sqrt(i))+1):
if i % j == 0:
isPrime[i] = False
cntPrime = [0 for i in range(10**5+1)]
for i in range(2,10**5+1):
if i % 2 == 1 and isPrime[i] and isPrime[(i+1)//2]:
... | import math
prime = [i for i in range(2, 10**5+1)]
for i in range(2, math.floor(math.sqrt(10**5))+1):
prime = [p for p in prime if (p == i or p % i != 0)]
isPrime = [False for i in range(10**5+1)]
for p in prime:
isPrime[p] = True
cntPrime = [0 for i in range(10**5+1)]
for i in range(2, 10**5+1):
i... | p03476 |
import math
q = int(eval(input()))
l = []
r = []
for i in range(q):
li, ri = list(map(int, input().split()))
l.append(li)
r.append(ri)
r_max = max(r) + 10
is_prime = [True] * (r_max+1)
is_prime[0] = is_prime[1] = False
for i in range(2, r_max):
if is_prime[i]:
for j in range(2, r_... | import sys
import math
input = sys.stdin.readline
def eratosthenes(n):
is_prime = [True] * (n + 1)
is_prime[0] = is_prime[1] = False
for i in range(2, n // 2 + 1):
if is_prime[i]:
for j in range(2, n // i + 1):
is_prime[i * j] = False
return is_prime
... | p03476 |
Q = int(eval(input()))
left = []
right = []
for a in range(Q):
l,r = list(map(int,input().split()))
left.append(l)
right.append(r)
ls = [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, 1... | #D問題
import math
def isprime(n):
nroot=int(math.sqrt(n))
flag=0
for i in range(2,nroot+1):
if n%i == 0:
flag=1
break
return flag
Q=int(eval(input()))
L=[]
R=[]
for i in range(Q):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
Rmax=... | p03476 |
Q = int(eval(input()))
lr = []
maxr = 0
for i in range(Q):
l,r = list(map(int,input().split()))
maxr = max(maxr,r)
lr.append([l,r])
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
... | Q = int(eval(input()))
lr = []
maxr = 0
for i in range(Q):
l,r = list(map(int,input().split()))
maxr = max(maxr,r)
lr.append([l,r])
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
... | p03476 |
q=int(eval(input()))
M=100000
import math
def erato(n):
prime=[]
cnt=[0]*n
limit=math.sqrt(n)
data=[i+1 for i in range(1,n)]
while True:
p=data[0]
if limit<=p:
return prime+data
prime.append(p)
data=[e for e in data if e%p!=0]
prime=erato... | INF = 10 ** 10
q=int(eval(input()))
M=100000
def erato(n):
primes = [0] * 2 + [1] * (n - 1)
for i in range(4,n + 1,2):
primes[i] = 0
for i in range(3,n + 1,2):
if i * i > n:
break
if primes[i]:
for j in range(i * i,n + 1,i):
prime... | p03476 |
import math
Q=int(eval(input()))
l=[0 for i in range(Q)]
r=[0 for i in range(Q)]
M=0
for i in range(Q):
l[i],r[i]=list(map(int,input().split()))
if M<r[i]:
M=r[i]
P=[True for i in range(M+1)]
P[0]=False
P[1]=False
S=[False for i in range(M+1)]
for i in range(2,int(math.sqrt(M))+1):
if ... | import math
Q=int(eval(input()))
l=[0 for i in range(Q)]
r=[0 for i in range(Q)]
M=0
for i in range(Q):
l[i],r[i]=list(map(int,input().split()))
if M<r[i]:
M=r[i]
P=[True for i in range(M+1)]
P[0]=False
P[1]=False
S=[False for i in range(M+1)]
for i in range(2,int(math.sqrt(M))+1):
if ... | p03476 |
def prime_table(m):
t = [True] * (m + 1)
i = 2
while i * i <= m:
if t[i]:
j = i + i
while j <= m:
t[j] = False
j += i
i += 1
return t
# t[i] = i が素数ならTrue
Q = int(eval(input()))
pt = prime_table(10 ** 5)
sn = [... | class Sieve:
"""区間[2,n]の値を素因数分解する"""
def __init__(self, n=1):
primes = []
f = [0] * (n + 1)
f[0] = f[1] = -1
for i in range(2, n + 1): # 素数を探す
if f[i]: continue
primes.append(i)
f[i] = i # 素数には自身を代入
for j in range(i * ... | p03476 |
def get_prime_list(n):
l = [0 for _ in range(n)]
i = 1
while (i < n):
for j in range(2, int((i + 1)**0.5) + 1):
if not (i + 1) % j:
break
else:
l[i] = 1
i += 1
return l
n_max = 10**5
is_prime = get_prime_list(n_max)
is_20... | def erat(n):
l = [0, 0] + [1 for _ in range(n - 1)]
i = 2
while (i < n + 1):
if l[i] == 1:
for j in range(i**2, n + 1, i):
l[j] = 0
i += 1
return l
n_max = 10**5
is_prime = erat(n_max)
is_2017 = [0 for _ in range(n_max + 1)]
for i in range(2,... | p03476 |
#!/mnt/c/Users/moiki/bash/env/bin/python
# N,M = map(int, input().split())
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
d... | #!/mnt/c/Users/moiki/bash/env/bin/python
# N,M = map(int, input().split())
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
d... | p03476 |
# coding: utf-8
from bisect import bisect_left, bisect_right
def check(x):
flag = True
for i in range(2, int(x**0.5) + 1):
if x % i == 0:
flag = False
break
return flag
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] ... | # coding: utf-8
from bisect import bisect_left, bisect_right
def eratosthenes(N):
# 素数判定
flag = True
for i in range(2, int(N**0.5) + 1):
if N % i == 0:
flag = False
break
return flag
def make_prime_nums(N):
# Nまでの素数のリストを作成
prime_tf = [True for _ in r... | p03476 |
from math import sqrt
# エラトステネスのふるい
def sieve(n):
if n <2:
return [False]*(n)
is_prime = [True]*(n)
is_prime[0], is_prime[1] = False, False
for i in range(2, int(sqrt(MAX))):
if is_prime[i]:
for j in range(i*2, n, i):
is_prime[j] = False
return is_prime
# 2017-like 数かどう... |
def resolve():
# エラトステネスのふるい
def make_primes_table(n):
if n < 2:
return [False]*n
is_prime = [True]*n
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)):
if is_prime[i]:
for j in range(i**2, n, i):
... | p03476 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03476 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p03476 |
from math import sqrt
def is_prime(n):
if n < 2:
return False
i = 2
while i <= sqrt(n):
if n % i == 0:
return False
else:
i += 1
return True
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
co... | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
Q = int(eval(input()))
L = []
R = []
for i in range(Q):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
... | p03476 |
# -*- coding: utf-8 -*-
from math import sqrt
# 素数判定用関数
def is_prime2(num):
if num < 2:
return False
if num == 2 or num == 3 or num == 5:
return True
if num % 2 == 0 or num % 3 == 0 or num % 5 == 0:
return False
# 疑似素数(2でも3でも割り切れない数字)で次々に割っていく
prime = 7
st... | # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | p03476 |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | p03476 |
Q = int(eval(input()))
memo = [0]*(10**5+1)
def eratos2():
primes = []
for i in range(2, 10**4):
flag = True
for p in primes:
if i%p == 0:
flag = False
if flag:
primes.append(i)
return primes
D = eratos2()
for i in range(1, 10**5... | Q = int(eval(input()))
memo = [0]*(10**5+1)
def is_prime(N):
prime = [True for _ in range(N)]
prime[1] = False
for i in range(2, N):
if not prime[i]:
continue
j = i+i
while j<N:
prime[j] = False
j += i
return prime
prime = is_p... | p03476 |
N=10**5
prime=[0]*(N+1)
for n in range(2,N+1):
if all([n%i for i in range(2,int(n**.5)+1)]):
prime[n]=1
check=[0]*(N+1)
for n in range(N+1):
if n%2==1 and prime[n] and prime[(n+1)//2]:
check[n]=1
accumulate=[0]*(N+1)
for n in range(1,N+1):
accumulate[n]=accumulate[n-1]+check[n]
... | N=10**5
prime=[1]*(N+1)
prime[0]=prime[1]=0
for i in range(2,int(N**.5)+1):
if not prime[i]:
continue
for j in range(i*2,N+1,i):
prime[j]=0
check=[0]*(N+1)
for n in range(N+1):
if n%2==1 and prime[n] and prime[(n+1)//2]:
check[n]=1
accumulate=[0]*(N+1)
for n in range... | p03476 |
import math
from itertools import accumulate
def eratosthenes(n):
prime_list = []
num_list=[i for i in range(2, n+1)]
limit = math.sqrt(n)
while True:
if limit <= num_list[0]:
return prime_list + num_list
prime_list.append(num_list[0])
num_list = [e for e ... | import math
from itertools import accumulate
def eratosthenes(n):
prime_list = []
num_list=[i for i in range(2, n+1)]
limit = math.sqrt(n)
while True:
if limit <= num_list[0]:
return prime_list + num_list
prime_list.append(num_list[0])
num_list = [e for e ... | p03476 |
import math
from itertools import accumulate
def eratosthenes(n):
prime_list = []
num_list=[i for i in range(2, n+1)]
limit = math.sqrt(n)
while True:
if limit <= num_list[0]:
return prime_list + num_list
prime_list.append(num_list[0])
num_list = [e for e ... | 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 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... | from itertools import accumulate
# エラトステネスの篩
# is_prime := 1~nが素数か否か
# table := 2~nのうち素数
def sieve(n):
is_prime = [True for _ in range(n)]
is_prime[0] = False
for i in range(2, n+1):
if is_prime[i-1]:
j = 2 * i
while j <= n:
is_prime[j-1] = Fa... | p03476 |
import math
from itertools import accumulate
def 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)
data = [i + 1 for i in range(2, n, 2)]
while True:
p ... | import math
from itertools import accumulate
def eratosthenes(n):
is_prime = [True for _ in range(n)]
is_prime[0] = False
for i in range(2, n+1):
if is_prime[i-1]:
j = 2 * i
while j <= n:
is_prime[j-1] = False
j += i
table = ... | p03476 |
from functools import lru_cache
@lru_cache(maxsize=None)
def is_prime(n):
"""
nが素数かどうか判定する
"""
if n < 2:
return False
elif n == 2:
return True
elif n % 2 == 0:
return False
else:
i = 3
while i ** 2 <= n:
if n % i == 0:
... | size = 10 ** 5 + 1
is_primes = [True] * size
is_primes[0] = False
is_primes[1] = False
for n in range(2, size):
if not is_primes[n]:
continue
m = n * 2
while m < size:
is_primes[m] = False
m += n
dp = [0] * size
for i in range(1, size):
dp[i] = dp[i - 1]
if ... | p03476 |
import math
Primes = {2}
Sim = [0 for i in range(100002)]
for i in range(3, 100001):
if i % 2 == 0:
Sim[i] = Sim[i-1]
else:
for p in Primes:
if i % p == 0:
Sim[i] = Sim[i-1]
break
else:
Primes |= {i}
if (i... | Num = [int(i) for i in range(2, 100001)]
Primes = [True for i in range(100001)]
Sim = [0 for i in range(100001)]
for i in range(2, 100001):
if Primes[i] == True:
j = i * 2
while j < 100001:
Primes[j] = False
j += i
for i in range(3, 100001):
if Primes[i] and... | p03476 |
Num = [int(i) for i in range(2, 100001)]
Primes = [True for i in range(100001)]
Sim = [0 for i in range(100001)]
for i in range(2, 100001):
if Primes[i] == True:
j = i * 2
while j < 100001:
Primes[j] = False
j += i
for i in range(3, 100001):
if Primes[i] and... | import sys
def solve():
input = sys.stdin.readline
isPrime = [True] * (1 + 10**5)
isPrime[0] = isPrime[1] = False
Like = [0] * (1 + 10 ** 5)
for i in range(2, 1 + 10 ** 5):
if isPrime[i]:
k = 2 * i
while k <= 10 ** 5:
isPrime[k] = False
... | p03476 |
import math
Q=int(eval(input()))
lr=[list(map(int,input().split())) for _ in range(Q)]
MAX=10**5
limit=int(math.sqrt(MAX))
primes=[2]
table=[i+1 for i in range(2,MAX,2)]
while limit>table[0]:
primes.append(table[0])
table=[j for j in table if j%table[0] != 0]
table=primes+table
similars=[]
for i i... | import math
from itertools import accumulate
Q=int(eval(input()))
lr=[list(map(int,input().split())) for _ in range(Q)]
MAX=10**5
limit=int(math.sqrt(MAX))
primes=[2]
table=[i+1 for i in range(2,MAX,2)]
while limit>table[0]:
primes.append(table[0])
table=[j for j in table if j%table[0] != 0]
primes=s... | p03476 |
import sys
def f(d):
num = 3
p = [2]
c = 0
while num <= 10**5:
m = int(num**0.5)
while m > 1 and num % m != 0:
m -= 1
if m == 1:
p.append(num)
if (num+1)//2 in p:
c += 1
d[num] = c
num += 2
r... | 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 |
MAX = 10**5+1
is_prime = [True] * (MAX+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2,MAX+1):
if is_prime[i]:
for j in range(i*2, MAX+1, i):
is_prime[j] = False
likes = [0] * (MAX+1)
for i in range(0, MAX+1):
if i % 2 == 0: continue
if is_prime[i] and is_p... | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def... | p03476 |
import bisect
N = 10**5
Q = int(eval(input()))
lst1 = [2]
for L in range(3, N, 2):
if all(L % L2 != 0 for L2 in lst1):
lst1.append(L)
lst1 = set(lst1)
lst2 = [i for i in lst1 if (i+1)//2 in lst1]
lst2.sort()
for _ in range(Q):
l, r = list(map(int, input().split()))
a = bisect.bisect... | import bisect, math
N = 10**5
Q = int(eval(input()))
lst1 = [2]
for L in range(3, N, 2):
f = 0
for d in range(3, math.floor(math.sqrt(L))+1, 2):
if L % d == 0:
f = 1
break
if f == 0:
lst1.append(L)
lst1 = set(lst1)
lst2 = [i for i in lst1 if (i+1)//2 in lst1]
lst2.sort()
... | p03476 |
def prime_list(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)))
return list(primes)
q = int(eval(input()))
primes = prime_list(10**5)
for i in range(q):
l, r = list(map(int, input().split()))
cnt = 0
for j in range(l, r+... | # O(nloglogn) https://mathtrain.jp/eratosthenes
def sieve(n):
s = [True] * n
s[0] = s[1] = False
for x in range(2, int(n ** 0.5) + 1):
if s[x]:
for i in range(2 * x, n, x):
s[i] = False
return s
is_prime = sieve(10 ** 5 + 1)
is_like2017 = [False] * (10 ** 5 + 1)
for i in range(10**5 + 1):
if... | p03476 |
import math as m
def judge_prime(num):
isPrime = [True]*(num+1)
isPrime[0] = False
isPrime[1] = False
border = m.sqrt(num)
i = 2
while i <= border:
if isPrime[i]:
j = i*2
while j <= num:
isPrime[j] = False
j += i
... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.rea... | p03476 |
import sys
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
from decimal import Decimal
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.read... | import sys, os, math, bisect, itertools, collections, heapq, queue
from decimal import Decimal
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buf... | p03476 |
import math
Q = int(eval(input()))
lr = [list(map(int, input().split())) for i in range(Q)]
max_l = max(lr, key=lambda x:x[1])[1]
a = list(range(2,int(math.ceil(max_l**0.5)+1)))
m = 1
while True:
b = [x for x in a[m:] if x%a[m-1] != 0]
a = a[:m]
a.extend(b)
m += 1
if m > len(a):
... | import math
Q = int(eval(input()))
lr = [list(map(int, input().split())) for i in range(Q)]
max_l = max(lr, key=lambda x:x[1])[1]
prime = list(range(2,int(math.ceil(max_l**0.5)+1)))
m = 1
while True:
b = [x for x in prime[m:] if x%prime[m-1] != 0]
prime = prime[:m]
prime.extend(b)
m += 1... | 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
def near2017(n):
if is_prime(n):
return is_prime((n+1)//2)
else:
return False
#######################################... | def JOI14_B():
N = I()
A = [I()for _ in range(N)]
A.extend(A)
dp = [[0]*(N*2+1) for _ in range(N*2+1)]
for j in range(N):
for i in range(N*2-j):
if (N-j)%2==1:
dp[i][i+j] = max(dp[i+1][i+j]+A[i],dp[i][i+j-1]+A[i+j])
else:
if... | p03476 |
INFTY = 10**5+1
P = [1 for _ in range(INFTY)]
P[0]=P[1]=0
for i in range(2,int(INFTY**0.5)+1):
for j in range(i*i,INFTY,i):
P[j] = 0
R = [0 for _ in range(INFTY)]
for i in range(INFTY):
if i%2==1:
if P[i]==1 and P[(i+1)//2]==1:
R[i] = 1
A = [0 for _ in range(INFTY+1)]
for... | P = [1 for _ in range(10**5)]
P[0]=0
P[1]=0
for i in range(2,int((10**5)**0.5)+1):
for j in range(i*i,10**5,i):
P[j]=0
Q = []
for i in range(3,10**5,2):
if P[i]==1 and P[(i+1)//2]==1:
Q.append(i)
A = [0 for _ in range(10**5+1)]
for q in Q:
A[q] = 1
for i in range(1,10**5+1):
... | p03476 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p03476 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def ... | p03476 |
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def S(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def ... | import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def S(): return eval(input())
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def ... | p03476 |
from bisect import bisect_left
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for ... | from bisect import bisect_left
def eratosthenes(n):
is_prime = [True] * (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):
is_prime[j] = False
return is_prime
q = int... | p03476 |
from bisect import bisect_left
def eratosthenes(n):
is_prime = [True] * (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):
is_prime[j] = False
return is_prime
q = int... | def eratosthenes(n):
is_prime = [True] * (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):
is_prime[j] = False
return is_prime
q = int(eval(input()))
p = eratosthenes(... | p03476 |
N = int(eval(input()))
l, r = [], []
for i in range(N):
L,R=list(map(int,input().split()))
l+= [L]
r+= [R]
prime = [0,0]+[1]*10**5#素数テーブル
for i in range(10**3):#エラトステネスのふるいにかける
if prime[i]==0: continue
for j in range(i+1,10**5+1):
if j%i==0: prime[j]=0
ans = []
for i in range(10**5+1):... | N = int(eval(input()))
prime = [0,0]+[1]*10**5#素数テーブル
for i in range(10**3):#エラトステネスのふるいにかける
if prime[i]==0: continue
for j in range(2*i, 10**5+1, i):
prime[j]=0
cumul = []
for i in range(10**5+1):
if prime[i]:
if prime[(i+1)//2]: cumul+=[1]
else: cumul+=[0]
else: cumul+=[0]
... | p03476 |
def isprime(x):
for i in range(2 , int(x**0.5)+1):
if x%i == 0:
return False
return True
N = 10**5
lst = []
for x in range(2,N):
if isprime(x):
lst.append(x)
q = int(eval(input()))
ans = []
for i in range(q):
cnt = 0
l,r = list(map(int,input().split()))
... |
import math
def eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i+1 for i in range(1,n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e%p != 0]
_primes = eratosthenes(10**5)
prim... | p03476 |
q = int(eval(input()))
ll = []
rr = []
for i in range(q):
l,r = list(map(int,input().split()))
ll.append(l)
rr.append(r)
m = min(ll)
M = max(rr)
cnt = [0]*(M+2)
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n%i == 0:
retur... | q = int(eval(input()))
ll = []
rr = []
for i in range(q):
l,r = list(map(int,input().split()))
ll.append(l)
rr.append(r)
def f(n):
flag = [True]*(n+1)
flag[0] = flag[1] = False
for i in range(2,int(n**0.5)+1):
if flag[i]:
x = 2*i
while x <= n:
... | p03476 |
import math
def sieve(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n+1):
if is_prime[i]:
j = 2 * i
while j <= n:
is_prime[j] = False
j += i
return is_prime
Q = int(eval(input(... | import math
def sieve(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n+1):
if is_prime[i]:
j = 2 * i
while j <= n:
is_prime[j] = False
j += i
return is_prime
Q = int(eval(input(... | p03476 |
dp = [1]*(10**5+1) #エラトステネスの篩
dp[0],dp[1] = 0, 0
for i in range(2, 10**5+1):
if dp[i] == 0:
continue
j = i
while j + i <= 10**5:
j += i
if dp[j] == 1:
dp[j] = 0
ni = [0]*(10**5+1) #2012_like check
for i in range(2, 10**5+1):
if dp[i] == 1 and dp[(i+1)//2... | def f():
dp = [1]*(10**5+1) #エラトステネスの篩
dp[0],dp[1] = 0, 0
for i in range(2, 10**5+1):
if dp[i] == 0:
continue
j = i
while j + i <= 10**5:
j += i
if dp[j] == 1:
dp[j] = 0
ni = [0]*(10**5+1) #2012_like check
... | p03476 |
primes = {2}
for i in range(1, 50000):
i = 2 * i + 1
for j in primes:
if i % j == 0:
break
else:
primes.add(i)
ret = set()
for i in primes:
if (i + 1) // 2 in primes:
ret.add(i)
ret = sorted(ret)
def binary(i):
low = 0
high = len(ret) - 1
... | work = [True] * 100001
work[0] = False
work[1] = False
primes = []
for i in range(100001):
if work[i]:
for j in range(2* i, 100001, i):
work[j] = False
csum = [0] * 100001
index = 0
for i in range(1, 100001):
if work[i] and work[(i+1)//2]:
csum[i] = csum[i - 1] + 1
... | p03476 |
def sieve(N):#エラトステネスの篩
prime = [0]*(N+1)
isprime = [True]*(N+1)
isprime[0]=isprime[1] = False
num = 0
for p in range(2,N+1):
if isprime[p]:
prime[num] = p
num += 1
for j in range(2*p,N+1,p):
isprime[j] = False
return prime
... | def sieve(N):#エラトステネスの篩
prime = [0]*(N+1)
isprime = [True]*(N+1)
isprime[0]=isprime[1] = False
num = 0
for p in range(2,N+1):
if isprime[p]:
prime[num] = p
num += 1
for j in range(2*p,N+1,p):
isprime[j] = False
return prime
... | p03476 |
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//i)
# divisors.sort()
return divisors
def islike2017(i):
if i%2==0:
return False
if len(make_div... | 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(input()))
lr=[list(map(int,input().split())) for _ in range(q)]
all=[lri[0] for lri in lr]
all[q:q]=[lri[1] for lri in lr]
... | p03476 |
def is_prime(n):
for i in range(2, int(n**(1/2))+1, 1):
if n%i == 0:
return False
return n != 1
def lnum(n): # Like number
if is_prime(n) and is_prime((n+1)//2):
return True
else:
return False
MAX = 101010
a = [0]*MAX
for i in range(MAX):
if lnum... | def is_prime(n):
for i in range(2, int(n**(1/2))+1, 1):
if n%i == 0:
return False
return n != 1
def lnum(n): # Like number
if is_prime(n) and is_prime((n+1)//2):
return True
else:
return False
MAX = 10**5+10
a = [0]*MAX
for i in range(MAX):
if ln... | p03476 |
import math
primes = [True]*(10**5+1)
primes[0],primes[1] = False,False
cumsum = [0]*(10**5+1)
for i in range(2, int(math.sqrt(10**5)+1)):
if primes[i]:
j = 2
while i*j <= 10**5:
primes[i*j] = False
j += 1
for i in range(2, 10**5+1):
if primes[i] and primes[(i+1)//2]:
cumsum[... | MAX_INT = 10**5+1
primes = [True] * (10**5+1)
primes[0], primes[1] = False, False
for i in range(2, int(MAX_INT**0.5)+1):
if primes[i]:
for j in range(i*2, MAX_INT, i):
primes[j] = False
cumsum = [0] * (10**5+1)
for i in range(1, 10**5+1, 2):
if primes[i] and primes[(i+1)//2]:
cumsum[i] ... | p03476 |
q = int(eval(input()))
num = [i for i in range(2,10**5+1)]
so = []
while len(num):
i = num[0]
so.append(i)
num = [j for j in num if j%i!=0]
import bisect
like2017 = []
for sos in so:
l_idx = bisect.bisect_left(so, (sos+1)//2)
if l_idx>=len(so) or sos%2==0:continue
if so[l_idx]==(sos+1)//2:... | q = int(eval(input()))
n = 10**5+1
p = [0]*n
p[2] = 1
for i in range(3,10**5+1):
prime = 1
for j in range(2, int(i**0.5)+1):
if i%j==0:
prime = 0
break
if prime:
p[i] = 1
like2017 = [1 if p[i] and p[(i+1)//2] else 0 for i in range(n)]
cnter = [0]*n
for i in range(1,n):
cnter... | p03476 |
from bisect import bisect_left, bisect_right
import random
def is_prime(q,k=50):
q = abs(q)
#計算するまでもなく判定できるものははじく
if q == 2: return True
if q < 2 or q&1 == 0: return False
#n-1=2^s*dとし（但しaは整数、dは奇数)、dを求める
d = (q-1)>>1
while d&1 == 0:
d >>= 1
#判定をk回繰り返す
for... | from bisect import bisect_left, bisect_right
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
retu... | p03476 |
import bisect
def eratosthenes(n):
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table[j] = 1
return prime_list
primes = eratost... | import bisect
pp = [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... | p03476 |
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 _ 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 _ in range(N)]
def dp2(ini, i, j): ret... | p03476 |
import bisect
a = [True] * 100001
a[0] = False
a[1] = False
p = []
for i in range(2, 100001):
if a[i]:
for j in range(i * 2, 100001, i):
if a[j]:
a[j] = False
if i % 2 != 0 and a[(i + 1) // 2]:
p.append(i)
q = int(eval(input()))
for i in range(q):... | def slove():
import sys
input = sys.stdin.readline
pl = {}
p = [True] * (10 ** 5 + 1)
p[0] = False
p[1] = False
cnt = 0
pll = [0] * (10 ** 5 + 1)
for i in range(2, len(p)):
if p[i]:
pl[i] = 1
for j in range(i, len(p), i):
p... | p03476 |
def slove():
import sys
input = sys.stdin.readline
pl = {}
p = [True] * (10 ** 5 + 1)
p[0] = False
p[1] = False
cnt = 0
pll = [0] * (10 ** 5 + 1)
for i in range(2, len(p)):
if p[i]:
pl[i] = 1
for j in range(i, len(p), i):
p... | def slove():
import sys
input = sys.stdin.readline
pb = [True] * (10 ** 5 + 1)
pb[0] = False
pb[1] = False
pl = [0] * (10 ** 5 + 1)
pc = 0
for i in range(2, len(pb)):
if pb[i]:
for j in range(i + i, len(pb), i):
if pb[j]:
... | p03476 |
import bisect
q = int(eval(input()))
l = []
r = []
for _ in range(q):
line = list(map(int, input().split()))
l.append(line[0])
r.append(line[1])
like2017 = []
pn = [2]
for L in range(3, 10**5):
chk = True
for L2 in pn:
if L%L2 == 0:
chk = False
break
... | import bisect
q = int(eval(input()))
l = []
r = []
for _ in range(q):
line = list(map(int, input().split()))
l.append(line[0])
r.append(line[1])
like2017 = []
pn = [2]
for L in range(3, 10**5):
chk = True
for L2 in pn:
if L%L2 == 0:
chk = False
break
... | p03476 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.