s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s082251166 | p03476 | u176582473 | 1591974288 | Python | Python (3.4.3) | py | Runtime Error | 624 | 7652 | 964 | def calc_prime(n):
primes = set(list(range(3, n, 2)))
primes.add(2)
for a in range(3, n, 2):
for i in range(a, n):
x = a * i
if x >= n:
break
if x in primes:
primes.remove(x)
return primes
def collect_likes(ps):
likes = s... |
s668591601 | p03476 | u941047297 | 1591891539 | Python | Python (3.4.3) | py | Runtime Error | 1145 | 9740 | 843 | def main():
import math
def generate_primes(num):
if num == 1: return []
primes = list(range(2, num + 1))
i, p = 0, 1
while p <= math.sqrt(num):
if primes[i] != 0:
p = primes[i]
primes = [prime if (prime % p != 0 or prime == p) else 0 f... |
s465904906 | p03476 | u638033979 | 1591672069 | Python | Python (3.4.3) | py | Runtime Error | 738 | 5528 | 838 | import sys
import math
input = sys.stdin.readline
MAX = 10**5
N = [0]*((MAX+1)//2)
time = 0
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(p... |
s920152682 | p03476 | u638033979 | 1591671687 | Python | Python (3.4.3) | py | Runtime Error | 737 | 5528 | 847 | import sys
import math
input = sys.stdin.readline
MAX = 10**5
N = [0]*((MAX+1)//2)
def eratosthenes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(prime)
... |
s102778815 | p03476 | u823885866 | 1591570203 | Python | Python (3.4.3) | py | Runtime Error | 458 | 44548 | 1138 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: l... |
s910162606 | p03476 | u860002137 | 1591555797 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 14696 | 682 | import bisect
from collections import defaultdict
q = int(input())
n = 10**5 + 1
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes = list(primes)
def is_prime(i):
p = bisect.bisect_left(primes, i)
if primes[p] == i:
return True
... |
s642507272 | p03476 | u860002137 | 1591555220 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2114 | 120292 | 517 | import bisect
q = int(input())
n = 100000
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes = list(primes)
def is_prime(i):
p = bisect.bisect_left(primes, i)
if primes[p] == i:
return True
else:
return False
ans = [... |
s070875941 | p03476 | u860002137 | 1591555194 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 14440 | 517 | import bisect
q = int(input())
n = 100000
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes = list(primes)
def is_prime(i):
p = bisect.bisect_left(primes, i)
if primes[p] == i:
return True
else:
return False
ans = [... |
s560977198 | p03476 | u102305348 | 1591329491 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38512 | 631 | import math
Q = int(input())
sosu = set(2)
for L in range(3, 10**5, 2): # 2 以外の素数は奇数なので
for L2 in sosu:
if L % L2 == 0:
break # 素数でないことがわかったらそれ以上ループする必要はない
else: # break で抜けることがなかったら L は素数（Python 特有の制御構文）
sosu.add(L)
li = []
for i in range(Q):
l, r = map(int, input().split())... |
s081833964 | p03476 | u401452016 | 1591318163 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 927 | #ABC084D
def main():
import sys
Q = int(sys.stdin.readline())
LR = [tuple(map(int, sys.stdin.readline().split())) for _ in range(Q)]
#print(LR)
def calc(N):
import math
for i in range(3, int(math.sqrt(N))+1):
while N % i==0:
N =N//i
re... |
s211695269 | p03476 | u993435350 | 1591238848 | Python | Python (3.4.3) | py | Runtime Error | 1313 | 4356 | 661 | import bisect
def primetable(n):
list = [True for _ in range(n + 1)]
i = 2
while i * i <= n:
if list[i]:
j = i + i
while j <= n:
list[j] = False
j += i
i += 1
table = [i for i in range(n + 1) if list[i] and i >= 1]
return table
prime = primetable(10 ** 5)
accume = [0] * (... |
s957567929 | p03476 | u617037231 | 1591092249 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 360 | import sympy
def mips():
return map(int,input().split())
def ii():
return int(input())
Q = ii()
S = [0 for i in range(10 ** 5 + 1)]
N = 0
for i in [j for j in range(1,10 ** 5 + 1)]:
if sympy.isprime(i) and sympy.isprime((i+1)//2):
N += 1
S[i] = N
else:
S[i] = N
for i in range(Q):... |
s441311119 | p03476 | u961674365 | 1591083850 | Python | Python (3.4.3) | py | Runtime Error | 1187 | 9432 | 749 | 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)):
if is_p... |
s255595730 | p03476 | u994064513 | 1590946843 | Python | Python (3.4.3) | py | Runtime Error | 365 | 29236 | 825 |
import bisect
n = 10**5
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
is_simular_2017 = is_prime.copy()
for i in range(n + 1):
if is_prime[i] and (... |
s871521978 | p03476 | u994064513 | 1590946628 | Python | Python (3.4.3) | py | Runtime Error | 515 | 29940 | 869 | import bisect
n = 10**5
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
is_simular_2017 = is_prime.copy()
for i in range(n + 1):
if is_prime[i] and (i... |
s097380776 | p03476 | u994064513 | 1590946571 | Python | Python (3.4.3) | py | Runtime Error | 365 | 28980 | 870 |
import bisect
n = 10**5
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
is_simular_2017 = is_prime.copy()
for i in range(n + 1):
if is_prime[i] and (... |
s153037508 | p03476 | u464205401 | 1590857383 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3188 | 498 | q=int(input())
r_max=10**3
t=[0]*r_max
u=[0]*r_max
pn=[2]
t[2]=1
u[2]=1
for L in range(3,r_max):
chk=True
for L2 in pn:
if L%L2 == 0:
chk=False
t[L]=t[L-1]
u[L]=u[L-1]
if chk==True:
pn.append(L)
t[L]=t[L-1]+1
if (L+1)//2 in pn:
u[L]=u[L-1]+1
... |
s191926050 | p03476 | u496687522 | 1590849671 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 356 | import sympy
Q = int(input())
l_r = [list(map(int, input().split())) for _ in range(Q)]
def like(x):
if sympy.isprime(x) and sympy.isprime((x+1)//2):
return True
return False
x_list = [0] * (10 ** 5)
for i in range(1, 10**5, 2):
if like(i):
x_list[i] = 1
for i in range(Q):
print(... |
s617556458 | p03476 | u197457087 | 1590808550 | Python | Python (3.4.3) | py | Runtime Error | 52 | 4084 | 598 | N = int(input())
MAX=11000
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 = [0 for _ in range(MAX)]
... |
s406386040 | p03476 | u057415180 | 1590438511 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 542 | q = int(input())
l, r = [0]*q, [0]*q
for i in range(q):
l[i], r[i] = map(int, input().split())
MAX = 101010
is_prime = [1]*MAX
is_prime[0] = 0
is_prime[1] = 0
for i in range(2,MAX):
if not is_prime[i]:
continue
for j in range(i*2, MAX, i):
is_prime[j] = 0
a = [0]*MAX
for i in range(MAX,,2... |
s860815423 | p03476 | u330169562 | 1590423569 | Python | Python (3.4.3) | py | Runtime Error | 44 | 6012 | 1140 | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y)... |
s220615448 | p03476 | u612223903 | 1590117360 | Python | PyPy3 (2.4.0) | py | Runtime Error | 578 | 52056 | 526 | q = int(input())
kueri =[]
for _ in range(q):
l,r =map(int,input().split())
kueri.append((l,r))
n = 10**5
d=[]
import numpy as np
def judge(p):
if p == 1:
return 0
for i in range(2,int(np.sqrt(p))+1):
if p %i == 0:
return 0
m = (p+1)//2
for i in range(2,int(np.sqrt(... |
s504719811 | p03476 | u489124637 | 1589938320 | Python | Python (3.4.3) | py | Runtime Error | 1956 | 3632 | 689 | import itertools
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 = [i for i in range(1, n+1) if is_prime[i-1]]
... |
s176098075 | p03476 | u489124637 | 1589938152 | Python | PyPy3 (2.4.0) | py | Runtime Error | 289 | 41840 | 689 | import itertools
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 = [i for i in range(1, n+1) if is_prime[i-1]]
... |
s857754749 | p03476 | u078349616 | 1589121534 | Python | Python (3.4.3) | py | Runtime Error | 380 | 27504 | 497 | Q = int(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]*10001
sum_a = [0]*10001
for n in range(1, 10000+1):
... |
s330621077 | p03476 | u078349616 | 1589121335 | Python | Python (3.4.3) | py | Runtime Error | 356 | 27508 | 476 | Q = int(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]*10001
sum_a = [0]*10001
for n in range(3, 10000):
i... |
s487172814 | p03476 | u034128150 | 1589059125 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3572 | 4764 | numbers_like_2017 = [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... |
s642348275 | p03476 | u700805562 | 1588959405 | Python | Python (3.4.3) | py | Runtime Error | 1158 | 7816 | 678 | def eratosthenes(limit):
import math
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit): break
P.append(prime)
i = 0
while i < len(A):
if A[i] % prime == 0:
A.pop(i)
... |
s431310979 | p03476 | u789282627 | 1588644173 | Python | PyPy3 (2.4.0) | py | Runtime Error | 690 | 56776 | 1338 | import math
Q = int(input())
l = [0 for i in range(Q)]
r = [0 for i in range(Q)]
i = 0
while True:
try:
lr=list(map(int,input().split()))
l[i] = lr[0]
r[i] = lr[1]
i+=1
except:
break
def is_prime(num):
#if(type(num) != type(0)):
# print('error at '+str(num)+' type = '+str(type(num)))
# ... |
s374982199 | p03476 | u992910889 | 1588631510 | Python | PyPy3 (2.4.0) | py | Runtime Error | 588 | 63080 | 769 | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
Q=int(input())
# n以下の素数のリストprimes
n = 10**5
primes = set(range(2, n + 1))
# 合成数 x は p<=x**0.5を満たす素因子 p をもつという性質を利用
for i in range(2, int(n ** 0.5 + 1)):
primes.difference_upda... |
s380212618 | p03476 | u437351386 | 1588453828 | Python | Python (3.4.3) | py | Runtime Error | 572 | 13380 | 534 | import math
from itertools import accumulate
def is_prime(n):
if n==2:
return True
for i in range(2,int(math.sqrt(n)+1)):
if n%i==0:
return False
return True
q=int(input())
l=[0]*q
r=[0]*q
for i in range(q):
l[i],r[i]=map(int,input().split())
min_l=min(l)
max_r=max(r)
a=[]
for i in range(min_l,max... |
s340007997 | p03476 | u437351386 | 1588453492 | Python | Python (3.4.3) | py | Runtime Error | 21 | 4596 | 536 | import math
from itertools import accumulate
def is_prime(n):
if n==2:
return True
for i in range(2,int(math.sqrt(n)+1)):
if n%i==0:
return False
return True
q=int(input())
l=[0]*q
r=[0]*q
for i in range(q):
l[i],r[i]=map(int,input().split(""))
min_l=min(l)
max_r=max(r)
a=[]
for i in range(min_l,m... |
s472566521 | p03476 | u478888932 | 1588435825 | Python | Python (3.4.3) | py | Runtime Error | 1402 | 28980 | 836 | import bisect
import math
import sys
from bisect import bisect_left
from math import ceil, sqrt
q = int(sys.stdin.readline().rstrip())
lr = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(q)]
def era_prime(N):
temp = [True]*(N+1)
temp[0] = temp[1] = False
for i in range(2, ceil(sqrt... |
s897932212 | p03476 | u478888932 | 1588433969 | Python | Python (3.4.3) | py | Runtime Error | 1313 | 29084 | 847 | import math
import sys
from bisect import bisect_left
from math import ceil, sqrt
q = int(sys.stdin.readline().rstrip())
lr = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(q)]
def era_prime(N):
temp = [True]*(N+1)
temp[0] = temp[1] = False
for i in range(2, ceil(sqrt(N+1))):
... |
s722609418 | p03476 | u219197917 | 1588344692 | Python | Python (3.4.3) | py | Runtime Error | 54 | 5552 | 684 | import sys
from itertools import accumulate
def read():
return sys.stdin.readline().rstrip()
def main():
n = 10**5
p = [i % 2 != 0 and i % 3 != 0 and i % 5 != 0 and i % 7 != 0 for i in range(n + 1)]
p[1] = False
p[2] = p[3] = p[5] = p[7] = True
for pi in range(3, int(n ** 0.5) + 1, 2):
... |
s280762120 | p03476 | u151785909 | 1588213675 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 384 | import math
num = 100000
s = set([i for i in range(2,num+1)])
p = set()
mi = 0
while mi<=math.sqrt(num):
mi = min(s)
t = set([i*mi for i in range(1,num//mi+1)])
p.add(mi)
s-=t
p = p|s
p2 = set([i for i in p if (i+1)//2 in p])
q = int(input())
for i in range(q):
l , r = map(int, input().split())
... |
s842252780 | p03476 | u709304134 | 1588186235 | Python | Python (3.4.3) | py | Runtime Error | 316 | 18804 | 479 | import bisect
N = 10**6
dp = [1] * (N+1)
dp[0] = dp[1] = 0
prime = []
for i in range(2,N+1):
if dp[i]:
for j in range(i*i, N+1, i):
dp[j] = 0
like2017 = [0] * (N+1)
for n in range(N+1):
if dp[n]==0:
continue
query = (p+1)//2
if dp[query]==1:
like2017[n] = 1
for n ... |
s208990418 | p03476 | u709304134 | 1588186164 | Python | Python (3.4.3) | py | Runtime Error | 313 | 18676 | 479 | import bisect
N = 10**6
dp = [1] * (N+1)
dp[0] = dp[1] = 0
prime = []
for i in range(2,N+1):
if dp[i]:
for j in range(i*i, N+1, i):
dp[j] = 0
like2017 = [0] * (N+1)
for n in range(N+1):
if dp[n]==0:
continue
query = (p+1)//2
if dp[query]==1:
like2017[n] = 1
for n ... |
s717020594 | p03476 | u459419927 | 1588175431 | Python | Python (3.4.3) | py | Runtime Error | 209 | 3188 | 859 | 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(1,10001) if is_prime(i)]
oppai=[0]*10005
for i in range(2, 10001):
if i in prime_list and (i+1)//2 in prime_li... |
s574865059 | p03476 | u459419927 | 1588175284 | Python | Python (3.4.3) | py | Runtime Error | 206 | 3316 | 867 | 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(1,10001) if is_prime(i)]
oppai=[0]*10005
for i in range(3, 10001):
if i in prime_list and (i+1)//2 in prime_li... |
s370140353 | p03476 | u459419927 | 1588174897 | Python | Python (3.4.3) | py | Runtime Error | 295 | 3188 | 806 | 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(1,10001) if is_prime(i)]
oppai=[0]*10000
for i in range(3, 10001):
if i in prime_list and (i+1)/2 in prime_lis... |
s000259316 | p03476 | u459419927 | 1588174844 | Python | Python (3.4.3) | py | Runtime Error | 290 | 3316 | 806 | 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(1,10001) if is_prime(i)]
oppai=[0]*10000
for i in range(3, 10000):
if i in prime_list and (i+1)/2 in prime_lis... |
s484947398 | p03476 | u459419927 | 1588174724 | Python | Python (3.4.3) | py | Runtime Error | 295 | 3188 | 705 | 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(1,10001) if is_prime(i)]
oppai=[0]*10000
for i in range(3, 10000):
if i in prime_list and (i+1)/2 in prime_lis... |
s654889635 | p03476 | u516566941 | 1587860629 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 945 | import math
Q = int(input())#numの数の個数
Query = []
maxn=0
for _ in range(Q):
l,r = map(int,input().split())
Query.append((l,r))
maxn = max(maxn,r)
N = maxn
num = [0]*(N+2)#部分和を計算したい数列
def souwa(left,right,ruisekiwa):#0based,numの[left,right)間の総和を計算
return ruisekiwa[right]-ruisekiwa[left]
def using_sqrt(N):#... |
s014184856 | p03476 | u298633786 | 1587656975 | Python | Python (3.4.3) | py | Runtime Error | 43 | 4200 | 871 | import sys
import math # noqa
import bisect # noqa
import queue # noqa
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 input():
return sys.stdin.readline().rstrip()
def main():
# [0 ... |
s061388444 | p03476 | u298633786 | 1587656939 | Python | PyPy3 (2.4.0) | py | Runtime Error | 202 | 40940 | 871 | import sys
import math # noqa
import bisect # noqa
import queue # noqa
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 input():
return sys.stdin.readline().rstrip()
def main():
# [0 ... |
s179715950 | p03476 | u440129511 | 1587585325 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 39280 | 325 | q=int(input())
pn=[2]
qn=[0]*10**5+1
c=0
for i in range(1, 10**5+1,2):
for i2 in pn:
if i % i2 == 0:
break
else:
pn.append(i)
for i in range(10**5+1):
if (pn[i]+1)/2 in pn:
c+=1
qn[i]=c
for _ in range(q):
l,r = map(int, input().split())
print(qn[r]-qn[... |
s407889681 | p03476 | u440129511 | 1587582664 | Python | Python (3.4.3) | py | Runtime Error | 465 | 28392 | 311 | q=int(input())
lr=[list(map(int,input().split())) for _ in range(q)]
pn=[2]
for L in range(3, 10**5, 2):
for L2 in pn:
if L % L2 == 0:
break
else:
if (L+1)/2 in pn:
pn.append(L)
pn.pop(0)
for i in range(q):
print(len([i for i in pn if lr[i][0]<=i<=lr[i][1]])) |
s473779295 | p03476 | u619144316 | 1587005998 | Python | Python (3.4.3) | py | Runtime Error | 327 | 21188 | 757 | import math
from itertools import accumulate
Q = int(input())
LR = []
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
# print(int(math.sqrt(n)))
for i in range(2,int(math.sqrt(n))+1):
for j in range(i*2, n+1 ,i):
is_prime[j] = False
retur... |
s434976114 | p03476 | u619144316 | 1587001435 | Python | Python (3.4.3) | py | Runtime Error | 366 | 23924 | 720 | import fractions
Q = int(input())
LR = []
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
# print(int(math.sqrt(n)))
for i in range(2,int(fractions.sqrt(n))+1):
for j in range(i*2, n+1 ,i):
is_prime[j] = False
return is_prime
def like201... |
s477947660 | p03476 | u726615467 | 1586952487 | Python | Python (3.4.3) | py | Runtime Error | 411 | 28768 | 716 | Q = int(input())
lr = [list(map(int, input().split())) for _ in range(Q)]
MAGIC_NUMBER = 100000
isprime = [True] * (MAGIC_NUMBER + 1)
for p in range(2, MAGIC_NUMBER + 1):
if not isprime[p]: continue
i_p = 2
while p * i_p <= MAGIC_NUMBER:
isprime[p * i_p] = False
i_p += 1
primes = []
for p ... |
s405360002 | p03476 | u024340351 | 1586829290 | Python | PyPy3 (2.4.0) | py | Runtime Error | 715 | 101720 | 81268 | Q = int(input())
P = [list(map(int,input().split())) for i in range(Q)]
List1 = [0, 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, ... |
s341055435 | p03476 | u024340351 | 1586829144 | Python | Python (3.4.3) | py | Runtime Error | 352 | 29096 | 81268 | Q = int(input())
P = [list(map(int,input().split())) for i in range(Q)]
List1 = [0, 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, ... |
s302467592 | p03476 | u130900604 | 1586828776 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38256 | 392 | import numpy as np
def isprime(x):
if x==1:
return False
if x==2:
return True
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
def like2017(x):
return (isprime(x) and isprime((x+1)//2))
a=[like2017(i) for i in range(10**5+1)]
a_cum=np.cumsum(a)
q=int(input())
for i i... |
s268760107 | p03476 | u130900604 | 1586828760 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38640 | 392 | import numpy as np
def isprime(x):
if x==1:
return False
if x==2:
return True
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
def like2017(x):
return (isprime(x) and isprime((x+1)//2))
a=[like2017(i) for i in range(10**5+1)]
a_cum=np.cumsum(a)
q=int(input())
for i i... |
s208426695 | p03476 | u814986259 | 1586828641 | Python | PyPy3 (2.4.0) | py | Runtime Error | 686 | 67544 | 577 | Q = int(input())
lr = [tuple(map(int, input().split())) for i in range(Q)]
def primes(n):
ret = []
A = [i for i in range(2, n+1)]
k = 0
s = n**0.5
while(k < s):
ret.append(A[0])
k = A[0]
A = [x for x in A if x % k]
ret += A
return ret
prime = primes(10**5)
table ... |
s871149461 | p03476 | u930705402 | 1586827741 | Python | Python (3.4.3) | py | Runtime Error | 118 | 7472 | 611 | import bisect
def prime(n):
max_=int(n**0.5)
li=[i for i in range(2,n+1)]
primes=[]
while li[0]<=max_:
primes.append(li[0])
tmp=li[0]
li=[i for i in li if i%tmp!=0]
primes.extend(li)
return primes
Q=int(input())
arr=prime(100000)
likenum=[]
n=len(arr)
for i in range(n):
... |
s607945579 | p03476 | u219015402 | 1585608659 | Python | Python (3.4.3) | py | Runtime Error | 350 | 18596 | 480 | import numpy as np
Q = int(input())
def prime(n):
flag = True
for i in range(2,int(np.sqrt(n)+1)):
if (n%i)==0:
flag = False
break
return flag
cnt = 0
cnts = [cnt,cnt,cnt]
b = [False,False,True]
for i in range(3,10003,2):
flag = prime(i)
b.extend([flag,False])
... |
s331351244 | p03476 | u219015402 | 1585608552 | Python | Python (3.4.3) | py | Runtime Error | 193 | 12748 | 481 | import numpy as np
Q = int(input())
def prime(n):
flag = True
for i in range(2,int(np.sqrt(n)+1)):
if (n%i)==0:
flag = False
break
return flag
cnt = 0
cnts = [cnt,cnt,cnt]
b = [False,False,True]
for i in range(3,10001,2):
flag = prime(i)
b.extend([flag,False])
... |
s457255277 | p03476 | u704284486 | 1585533448 | Python | Python (3.4.3) | py | Runtime Error | 111 | 5324 | 791 | 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
from bisect ... |
s281714914 | p03476 | u704284486 | 1585533358 | Python | Python (3.4.3) | py | Runtime Error | 106 | 5324 | 750 | 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
from bisect ... |
s907156569 | p03476 | u509739538 | 1585480809 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 714 | Q = int(input())
judge_arr = []
data = []
max_number = 0
for i in range(Q):
x = input().split()
data.append([int(x[0]),int(x[1])])
if max_number<data[i][1]:
max_number = data[i][1]
prime_arr = [2]
for i in range(3,max_number,2):
c = 0
for j in prime_arr:
if j>i**0.5 or i%j!=0:
break
elif i%j==0:
c =... |
s378743463 | p03476 | u526094365 | 1584875048 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 586 | import numpy as np
N = int(input())
queue = [list(map(int, input().split())) for _ in range(N)]
max_N = 100100
prime = np.ones(max_N, dtype=int)
a = np.zeros(max_N, dtype=int)
b = np.zeros(max_N+1, dtype=int)
prime[0], prime[1] = 0, 0
for i in range(2, max_N):
if i == 0:
continue
for j in range(i*2, ... |
s987277727 | p03476 | u944643608 | 1584761666 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3828 | 443 | def sosu(x):
for i in range(2,x**(1/2) + 1):
if x % i == 0:
return False
return True
N = pow(10, 5)
lis = [0] * N
lis[1] = 1
for i in range(3,N+1):
if i % 2 == 0:
continue
elif sosu(i) and lis[(N+1)//2-1] == 1:
lis[i-1] = 1
ruiseki = [0]
total = 0
for i in range(N):
total += lis[i]
ruisek... |
s553274177 | p03476 | u578501242 | 1584641620 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 27 | 4
13 13
7 11
7 11
2017 2017 |
s892723255 | p03476 | u841623074 | 1584518108 | Python | Python (3.4.3) | py | Runtime Error | 305 | 14452 | 600 | q=int(input())
import math
import numpy as np
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 is_is_prime(n):
an=0
if is_prime((n+1)//2)==True:
if is_prime(n)==True:
an=1
return an
ko=[]
... |
s746611582 | p03476 | u841623074 | 1584517873 | Python | Python (3.4.3) | py | Runtime Error | 151 | 12504 | 504 | q=int(input())
import math
import numpy as np
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 is_is_prime(n):
an=0
if is_prime((n+1)//2)==True:
if is_prime(n)==True:
an=1
return an
ko=[]
... |
s768607536 | p03476 | u047102107 | 1584212762 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38256 | 511 | # Q = int(input())
Qmax = 100_001
is_prime = [True] * Qmax
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(Qmax ** 0.5) + 1):
if is_prime[i]:
for j in range(i * i, Qmax, i):
is_prime[j] = False
# 1 ~ 10^5を先に計算する
cnt = 0
res = [0]*(10**5)
for i in range(10**5):
if is_prime[i]... |
s315743277 | p03476 | u047102107 | 1584212066 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 719 | # Q = int(input())
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
return is_prime
prime_fla... |
s653260546 | p03476 | u891518152 | 1583693279 | Python | Python (3.4.3) | py | Runtime Error | 404 | 33580 | 899 | #ABC084D 累積和
from itertools import accumulate
#エラトステネスの篩
def sieve(n: int) -> set: #返り値はset
num = [True]*n
num[0] = num[1] = False
for i in range(3,int(n**0.5)+1,2):
if num[i]:
num[i * i:: 2 * i] = [False] * ((n - i ** 2 - 1) // (2 * i) + 1)
return {2}|{i for i in range(3,n,2) if num... |
s417716360 | p03476 | u891518152 | 1583692977 | Python | Python (3.4.3) | py | Runtime Error | 395 | 33592 | 939 | #ABC084D 累積和
from itertools import accumulate
#エラトステネスの篩
def sieve(n: int) -> set: #返り値はset
if n < 2:
return set()
num = [True]*n
num[0] = num[1] = False
for i in range(3,int(n**0.5)+1,2):
if num[i]:
num[i * i:: 2 * i] = [False] * ((n - i ** 2 - 1) // (2 * i) + 1)
re... |
s748678095 | p03476 | u891518152 | 1583692924 | Python | PyPy3 (2.4.0) | py | Runtime Error | 647 | 70488 | 939 | #ABC084D 累積和
from itertools import accumulate
#エラトステネスの篩
def sieve(n: int) -> set: #返り値はset
if n < 2:
return set()
num = [True]*n
num[0] = num[1] = False
for i in range(3,int(n**0.5)+1,2):
if num[i]:
num[i * i:: 2 * i] = [False] * ((n - i ** 2 - 1) // (2 * i) + 1)
re... |
s516820509 | p03476 | u560867850 | 1583533100 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3572 | 836 | from collections import deque
import sys
input = sys.stdin.readline
import bisect as bi
from operator import mul
from functools import reduce
import math
from itertools import accumulate
def readlines(n):
for _ in range(n):
a, b = map(int, input().split())
yield a, b
def prime(n):
is_prime = [... |
s883662550 | p03476 | u877415670 | 1582938611 | Python | Python (3.4.3) | py | Runtime Error | 262 | 3828 | 675 | import math
import bisect
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
prime=set([2])
for i in range(3,100001):
if i%2!=0 and is_prime(i):
prime.add(i)
sim_prime=[]
for p in prime:
if (p+1)/... |
s128666898 | p03476 | u743229067 | 1581652756 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 39536 | 865 | def primes(n):
primes = []
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)):
if i... |
s749772530 | p03476 | u094191970 | 1580697415 | Python | Python (3.4.3) | py | Runtime Error | 38 | 4188 | 607 | 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(input())
'''
b=[0]
for i in range(1,lim+1):
if is_p[i-1] and is_p[i//2]:
b.... |
s810177693 | p03476 | u094191970 | 1580696904 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 459 | 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(input())
lim=10**2+1
is_p=eratosthenes(lim)
#print(is_p)
b=[0]
for i in range(1,lim+1):
if is_p[i-1]==1 and is_... |
s171993111 | p03476 | u648212584 | 1580433894 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 811 | import sys
input = sys.stdin.buffer.readline
import sympy
def main():
N = int(input())
M = 100000
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:
... |
s810322680 | p03476 | u588794534 | 1579753393 | Python | PyPy3 (2.4.0) | py | Runtime Error | 292 | 49628 | 1378 | import math
#----エラトステネスの篩--------
def get_primenumber(number):
prime_list = []
#2からnumberまでの数字をsearch_listに入れる
prime_2007=[]
j=0
lr=[0]
cnt=0
search_list = list(range(2,number+1))
while True:
#search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(number):
#pr... |
s333479658 | p03476 | u588794534 | 1579751872 | Python | Python (3.4.3) | py | Runtime Error | 100 | 7472 | 1338 | import math
#----エラトステネスの篩--------
def get_primenumber(number):
prime_list = []
#2からnumberまでの数字をsearch_listに入れる
prime_2007=[]
j=0
lr=[0]
cnt=0
search_list = list(range(2,number+1))
while True:
#search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(number):
#pr... |
s428666281 | p03476 | u588794534 | 1579751810 | Python | Python (3.4.3) | py | Runtime Error | 100 | 7448 | 1283 | import math
#----エラトステネスの篩--------
def get_primenumber(number):
prime_list = []
#2からnumberまでの数字をsearch_listに入れる
prime_2007=[]
j=0
lr=[0]
cnt=0
search_list = list(range(2,number+1))
while True:
#search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(number):
#pr... |
s977242227 | p03476 | u489175813 | 1579716266 | Python | PyPy3 (2.4.0) | py | Runtime Error | 197 | 40304 | 812 | q=int(input())
like2017={}
# 自然数m以下の素数を返す
def prime_numbers(m):
# 素数を保持するset
primes = set()
# 2以上m以下の素数を数え上げる
n = 2
while n <= m:
# 自身より小さい全ての素数で割り切れなければ、素数とみなせる
if all(n % i != 0 for i in primes):
primes.add(n)
n += 1
result=set()
result.add(2)
for... |
s258804539 | p03476 | u934868410 | 1579715444 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 546 | q = int(input())
l = []
r = []
for i in range(q):
x,y = map(int,input().split())
l += [x]
r += [y]
def is_2017(x):
if x % 2 == 0:
return False
return is_p[x] && is_p[(x+1)//2]
def is_prime(x):
if x == 1:
return False
i = 2
while i * i <= x:
if x % i == 0:
return False
return True
... |
s180143672 | p03476 | u580697892 | 1578609210 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1308 | 58052 | 1145 | # 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 range(N+1)]
... |
s071210781 | p03476 | u150603590 | 1578447206 | Python | PyPy3 (2.4.0) | py | Runtime Error | 325 | 56668 | 632 | import sys
input=sys.stdin.readline
def is_prime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
def make(n):
ans=[]
for i in range(2,n+1):
if is_prime(i):
ans.append(i)
return ans
if __name__ == '__main__':
Q=int(input())
Q... |
s755350392 | p03476 | u984276646 | 1578073092 | Python | Python (3.4.3) | py | Runtime Error | 280 | 3064 | 470 | prime = [3, 5]
for i in range(13, 100001, 12):
r = int(i**(1/2))
p = 0
for j in range(2, r+1):
if i % j == 0:
p = 1
break
a = (i+1)//2
r = int(a**(1/2))
for j in range(2, r+1):
if a % j == 0:
p = 1
break
if p == 0:
prime.append(i)
Q = int(input())
for i in range(Q):
... |
s336659008 | p03476 | u489124637 | 1577826171 | Python | Python (3.4.3) | py | Runtime Error | 424 | 19920 | 925 | # n以下の整数の素数列挙（エラトステネスの篩）
#-------------------------------------------------------------------------
import numpy as np
def eratosthenes(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[... |
s887247236 | p03476 | u489124637 | 1577826040 | Python | Python (3.4.3) | py | Runtime Error | 150 | 14720 | 906 | # n以下の整数の素数列挙（エラトステネスの篩）
#-------------------------------------------------------------------------
import numpy as np
def eratosthenes(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[... |
s817929224 | p03476 | u585704797 | 1576994531 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 44912 | 520 |
M=pow(10,5)
prime_sieve=[-1 for i in range(M+1)]
prime_sieve[0]=1
prime_sieve[1]=1
primes=[]
for i in range(M+1):
if prime_sieve[i]==-1:
primes.append(i)
for j in range(2,(M+1)//i+1):
prime_sieve[i*j]=1
#print(prime_sieve)
rangesum=[0,0,0]
sum=0
for i in range(3,M+1):
if prime_sieve[i]==-1:
if ... |
s901482591 | p03476 | u585704797 | 1576994458 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38640 | 530 |
M=pow(10,2)
prime_sieve=[-1 for i in range(M+1)]
prime_sieve[0]=1
prime_sieve[1]=1
primes=[]
for i in range(M+1):
if prime_sieve[i]==-1:
primes.append(i)
for j in range(2,(M+1)//i+1):
prime_sieve[i*j]=1
#print(prime_sieve)
rangesum=[0,0,0]
sum=0
for i in range(3,M+1):
if prime_sieve[i]==-1:
if ... |
s683500564 | p03476 | u688375653 | 1575171523 | Python | PyPy3 (2.4.0) | py | Runtime Error | 238 | 59248 | 56529 | import bisect
import sys
input = sys.stdin.readline
Q=one_int()
sosuu_list=[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... |
s046055367 | p03476 | u754022296 | 1573600410 | Python | Python (3.4.3) | py | Runtime Error | 19 | 4596 | 332 | q = int(input())
p = [False]*(10**5)
c = [0]*(10**5)
temp = [True]*(N+1)
temp[0] = False
temp[1] = False
for i in range(2, 10**5):
c[i] = c[i-1]
if temp[i]:
temp[2*i::i] = [False]*(len(temp[i+i::i]))
if temp[(i+1)//2] and i%2:
c[i] += 1
for _ in range(q):
l, r = map(int, input().split())
print(c[... |
s512715921 | p03476 | u539517139 | 1573271392 | Python | Python (3.4.3) | py | Runtime Error | 82 | 6756 | 333 | n=100000
p=[0]*2+[1]*(n-1)
for i in range(2,n+1):
if p[i]:
for j in range(i*2,n+1,i):
p[j]=0
for i in range(1,n+1)[::-1]:
if p[i]:
if p[(i+1)//2]:
continue
p[i]=0
p[2]=0
c=[0]*n
for i in range(1,n+1):
c[i]=c[i-1]+p[i]
q=int(input())
for i in range(q):
l,r=map(int,input().split())
print... |
s631128235 | p03476 | u755363325 | 1572983114 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1423 | 59352 | 654 | from bisect import bisect_left, bisect_right
q = int(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
... |
s024509307 | p03476 | u755363325 | 1572982553 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1452 | 58328 | 571 | from bisect import bisect_left, bisect_right
q = int(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
... |
s934027516 | p03476 | u755363325 | 1572982421 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1514 | 60248 | 526 | q = int(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
if chk:
pn.append(L)
for ... |
s064588900 | p03476 | u923659712 | 1572972529 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 300 | q=int(input())
for i in range(q):
a,b=map(int,input().split())
h=0
for j in range(a,b+1):
for v in range(2,j):
if j%v==0:
for k in range(2,(j+1)/2):
if j%k==0:
h+=1
else:
pass
else:
pass
print(h)
|
s367991188 | p03476 | u476435125 | 1572739396 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38256 | 587 | import sys
input=sys.stdin.readline
from bisect import bisect_left, bisect_right
Q=int(input())
llr=[]
maxr=1
for i in range(Q):
l,r=map(int,input().split())
if r>maxr:
maxr=r
llr.append([l,r])
def isprime(n):
if n==1:
return 0
m=int(n**(1/2))
for i in range(2,m+1):
if n... |
s475007654 | p03476 | u476435125 | 1572738819 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38256 | 557 | import sys
input=sys.stdin.readline
from bisect import bisect_left, bisect_right
Q=int(input())
llr=[]
maxr=1
for i in range(Q):
l,r=map(int,input().split())
if r>maxr:
maxr=r
llr.append([l,r])
def isprime(n):
m=int(n**(1/2))
for i in range(2,m+1):
if n%i==0:
return 0
... |
s968198322 | p03476 | u187516587 | 1572213596 | Python | Python (3.4.3) | py | Runtime Error | 28 | 4468 | 4722 | l=[0,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, 45... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.