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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s569961607 | p03476 | u187516587 | 1572213381 | Python | Python (3.4.3) | py | Runtime Error | 28 | 4468 | 4715 | 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... |
s422974800 | p03476 | u155687575 | 1571724697 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 40048 | 586 | # D submit
from math import sqrt
def sieve(n):
if n<2:
return [False]*(n+1)
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n))+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
is_prime[j] = False
return is_pr... |
s174681201 | p03476 | u780962115 | 1571453812 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3956 | 788 | q=int(input())
n =10**3
prime = {i for i in range(2,n)}
for i in range(2,n):
if i in prime:
for j in range(i*2,n,i):
if j in prime:
prime.remove(j)
lists=[]
for i in prime:
lists.append(i)
lists=sorted(lists)
checklist=[0]*(10**5+1)
checklist[0]=0
checklist[1]=0
for i in ... |
s114631655 | p03476 | u905203728 | 1569527645 | Python | Python (3.4.3) | py | Runtime Error | 1176 | 4192 | 579 | def prime(n):
is_prime=[True]*(n+1)
is_prime[0],is_prime[1]=False,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]]
prime_number=prime(10**5)
number=[i for i in prime_... |
s332246480 | p03476 | u895408600 | 1569385279 | Python | Python (3.4.3) | py | Runtime Error | 724 | 31988 | 560 | import math
from itertools import accumulate
Q = int(input())
q = [list(map(int,input().split())) for i in range(Q)]
def prime(n):
if n == 1:
return 0
if n == 2:
return 1
for i in range(2,int(math.sqrt(n))+1):
if n % i == 0:
return 0
break
else:
... |
s516680880 | p03476 | u895408600 | 1569385243 | Python | Python (3.4.3) | py | Runtime Error | 744 | 31988 | 751 | import math
from itertools import accumulate
# input
Q = int(input())
q = [list(map(int,input().split())) for i in range(Q)]
# 素数判定のdef（素数なら1、合成数なら0）
def prime(n):
if n == 1:
return 0
if n == 2:
return 1
for i in range(2,int(math.sqrt(n))+1):
if n % i == 0:
return 0
... |
s237699518 | p03476 | u895408600 | 1569385145 | Python | Python (3.4.3) | py | Runtime Error | 738 | 31988 | 751 | import math
from itertools import accumulate
# input
Q = int(input())
q = [list(map(int,input().split())) for i in range(Q)]
# 素数判定のdef（素数なら1、合成数なら0）
def prime(n):
if n == 1:
return 0
if n == 2:
return 1
for i in range(2,int(math.sqrt(n))+1):
if n % i == 0:
return 0
... |
s973487428 | p03476 | u158778550 | 1569273355 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 44784 | 599 | def sieve_of_eratosthenes(N):
prime_list = [True for _ in range(N + 1)]
prime_list[0] = False
prime_list[1] = False
for p in range(2, int(N ** 0.5) + 1):
if prime_list[p]:
for i in range(2 * p, N + 1, p):
prime_list[i] = False
return prime_list
Q = int(input())... |
s768491003 | p03476 | u158778550 | 1569273259 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 44784 | 637 | import math
def sieve_of_eratosthenes(N):
sqrt_N = math.sqrt(N)
prime_list = [True for _ in range(N + 1)]
prime_list[0] = False
prime_list[1] = False
for p in range(2, int(sqrt_N) + 1):
if prime_list[p]:
for i in range(2 * p, N + 1, p):
prime_list[i] = False
... |
s235426178 | p03476 | u412481017 | 1568692203 | Python | Python (3.4.3) | py | Runtime Error | 101 | 4212 | 486 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(1,int(math.sqrt(x))+1):
if x % (i+1) == 0:
return False
return True
table=[0]*50001
for i in range(1,50001):
if i%2==1 and sosuu((i+1)//2) and sosuu(i):
table[i]=table[i-1] + 1
else:
table... |
s927585786 | p03476 | u412481017 | 1568690616 | Python | Python (3.4.3) | py | Runtime Error | 101 | 4212 | 485 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(1,int(math.sqrt(x))):
if x % (i+1) == 0:
return False
return True
table=[0]*50001
for i in range(1,50001):
if i%2==1 and sosuu(int((i+1)/2)) and sosuu(i):
table[i]=table[i-1] + 1
else:
tab... |
s429491915 | p03476 | u412481017 | 1568690356 | Python | Python (3.4.3) | py | Runtime Error | 97 | 4212 | 481 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(1,int(math.sqrt(x))):
if x % (i+1) == 0:
return False
return True
table=[0]*50001
for i in range(1,50001):
if i%2==1 and sosuu((i+1)//2) and sosuu(i):
table[i]=table[i-1] + 1
else:
table[i... |
s225226103 | p03476 | u412481017 | 1568690252 | Python | Python (3.4.3) | py | Runtime Error | 96 | 4212 | 483 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(1,int(math.sqrt(x))):
if x % (i+1) == 0:
return False
return True
table=[0]*50001
for i in range(1,50001):
if i%2==1 and sosuu((i+1)//2) and sosuu(i):
table[i]=table[i-1] + 1
else:
table[i... |
s753256888 | p03476 | u196697332 | 1568660039 | Python | Python (3.4.3) | py | Runtime Error | 105 | 7448 | 790 | import math
import bisect
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
needed_prime = [2]
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
... |
s533907912 | p03476 | u223646582 | 1568492325 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38384 | 5191 | # import bisect
# import numpy as np
# def seachPrimeNum(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[0]
# seachList = [i for i in seachList if i % tmp != 0]
#... |
s098677981 | p03476 | u708255304 | 1568478305 | Python | Python (3.4.3) | py | Runtime Error | 309 | 16644 | 1192 | def eratosutenes(n):
primes = [1] * (n+1) # 0からnまでの素数リスト, 最初は全てが素数だと仮定する
primes[0] = 0
primes[1] = 0
for i in range(2, int(n**(1/2))+1):
if primes[i] == 0:
continue
if primes[i] == 1:
for j in range(i * 2, n+1, i):
primes[j] = 0
return primes... |
s254804179 | p03476 | u736729525 | 1568166641 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 596 | def main():
cache = set()
primes = {2}
def isprime(n):
if n in primes:
return True
for i in range(3, math.sqrt(n)+1, 2):
if n % i == 0:
return False
primes[n] = True
return True
Q = int(input())
for i in range(Q):
l, ... |
s026868486 | p03476 | u207464563 | 1567630562 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 409 | from sympy import isprime
Q = int(input())
lq = []
prime_numbers = [0,0,0]
for i in range(Q):
tmp = list(map(int,input().split()))
lq.append(tmp)
counter = 0
for j in range(3, 10 ** 5 + 1):
if isprime(j):
if j % 2 != 0 and isprime((j+1)//2):
counter += 1
prime_numbers.append(coun... |
s540372698 | p03476 | u067729694 | 1567285517 | Python | PyPy3 (2.4.0) | py | Runtime Error | 305 | 49500 | 1061 | import sys
input = sys.stdin.readline
Q = int(input())
LR = []
for _ in range(Q):
l,r = map(int, input().split())
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]:
... |
s855912910 | p03476 | u814986259 | 1567260630 | Python | Python (3.4.3) | py | Runtime Error | 272 | 3444 | 462 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(2,int(math.sqrt(x))):
if x % i == 0:
return False
return True
table=[0]*50000
for i in range(1,50001):
if sosuu(2*i - 1) and sosuu(i):
table[i]=table[i-1] + 1
else:
table[i]=table[i-1]
... |
s959064077 | p03476 | u814986259 | 1567260603 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3444 | 459 | import math
Q = int(input())
def sosuu(x):
if x == 1:
return False
else:
for i in range(2,int(math.sqrt)):
if x % i == 0:
return False
return True
table=[0]*50000
for i in range(1,50001):
if sosuu(2*i - 1) and sosuu(i):
table[i]=table[i-1] + 1
else:
table[i]=table[i-1]
a... |
s226496283 | p03476 | u347640436 | 1566543940 | Python | Python (3.4.3) | py | Runtime Error | 185 | 8420 | 572 | from sys import stdin
def main():
from math import sqrt
readline = stdin.readline
p = [True] * (10 ** 5 + 1)
p[0] = False
p[1] = False
n = int(sqrt(10 ** 5 + 1)) + 1
for j in range(4, n, 2):
p[j] = False
for i in range(3, n, 2):
if p[i]:
for j in range(i + i, n, i):
p[j] = False
... |
s025042539 | p03476 | u800258529 | 1566539458 | Python | Python (3.4.3) | py | Runtime Error | 253 | 13080 | 595 | import sys
input = sys.stdin.readline
n=10**5
sievebd=n//2-1
sieve=[True]*sievebd
limit=(int((n-1)**.5)-1)//2
for i in range(limit):
if sieve[i]:
for j in range(2*i**2+6*i+3,sievebd,2*i+3):
sieve[j]=False
for i in range((sievebd-1)//2-1,-1,-1):
if not sieve[i]:sieve[2*i+1]=False
for i in ra... |
s179715640 | p03476 | u227641731 | 1566021215 | Python | Python (3.4.3) | py | Runtime Error | 904 | 6996 | 695 | import math
Q = int(input())
def prime(p):
for i in range(2, int(math.sqrt(p))+1):
if p % i == 0:
return False
return True
# エラトステネスの篩
data = [1]*10**5
data[0], data[1] = 0, 0
for j in range(2, len(data)):
if prime(j) == True:
for k in range(j*2, len(data), j):
data... |
s859748078 | p03476 | u227641731 | 1566018592 | Python | Python (3.4.3) | py | Runtime Error | 893 | 6996 | 684 | import math
Q = int(input())
def prime(p):
for i in range(2, int(math.sqrt(p))+1):
if p % i == 0:
return False
return True
# エラトステネスの篩
data = [1]*(10**5+1)
data[0],data[1] = 0,0 #
for j in range(2, 10**5+1):
if prime(j) == True:
for k in range(j*2, 10**5+1, j):
data... |
s688703137 | p03476 | u227641731 | 1566018448 | Python | Python (3.4.3) | py | Runtime Error | 903 | 6996 | 676 | import math
Q = int(input())
def prime(p):
for i in range(2, int(math.sqrt(p))+1):
if p % i == 0:
return False
return True
# エラトステネスの篩
data = [1]*10**5
data[0],data[1] = 0,0 #
for j in range(2, 10**5):
if prime(j) == True:
for k in range(j*2, 10**5, j):
data[k] = 0
... |
s776333214 | p03476 | u227641731 | 1566004408 | Python | Python (3.4.3) | py | Runtime Error | 376 | 7508 | 737 | import math
def prime(n):
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return 0
return 1
#エラトステネスのふるい
MAX =100000
is_prime = [1]*(MAX+1)
is_prime[0],is_prime[1] == 0
for i in range(2,MAX+1):
if prime(i) == 1:
j = i*2
while j <= MAX:
is_prime[j] ... |
s227845854 | p03476 | u091051505 | 1565537858 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 448 | def prime(i):
if i == 1:
return False
if (i > 2) & (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(input())
for _ in range(q):
ans = 0
l, r = map(int, input().split())
while (i <= r):
... |
s864966539 | p03476 | u021548497 | 1565385110 | Python | Python (3.4.3) | py | Runtime Error | 290 | 10868 | 813 | def prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for j in range(4, n+1, 2):
is_prime[j] = False
for i in range(3, int(n**0.5) + 1, 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
... |
s840608786 | p03476 | u537905693 | 1564455954 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 954 | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
class Prime {
// n以下の素数を列挙する
public:
const int n;
vector<bool> is_prime;
vector<int> primes;
Prime(int size) : n(size), is_prime(n, true) {
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i <= n; ++i) {
i... |
s673983356 | p03476 | u769698512 | 1563897481 | Python | Python (3.4.3) | py | Runtime Error | 316 | 13208 | 502 | import numpy as np
q = int(input())
# 高速素数判定
is_prime = np.ones(100001, dtype=int)
is_prime[0]=0
is_prime[1]=0
for i in range(2,100001):
if is_prime[i]==1:
j=i+i
while j <= 100000:
is_prime[j] = 0
j += i
like2017 = [1 if is_prime[x] and is_prime[(x+1)//2] else 0 for i in ... |
s242859148 | p03476 | u769698512 | 1563897272 | Python | Python (3.4.3) | py | Runtime Error | 178 | 12896 | 432 | import numpy as np
n=10000
q = int(input())
is_prime = np.ones(n+1,dtype=int)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
if(is_prime[i]==1):
j=i+i
while j <= n:
is_prime[j] = 0
j += i
cnt = [is_prime[x]*is_prime[(x+1)//2] for x in range(0,n+1)]
for i in range(... |
s639807619 | p03476 | u769698512 | 1563896493 | Python | Python (3.4.3) | py | Runtime Error | 182 | 12840 | 501 | import numpy as np
q = int(input())
# 高速素数判定
is_prime = np.ones(10001, dtype=int)
is_prime[0]=0
is_prime[1]=0
for i in range(2,10001):
if is_prime[i]==1:
j=i+i
while j <= 10000:
is_prime[j] = 0
j += i
like2017 = [is_prime[x]*is_prime[(x+1)//2] for x in rang... |
s611676530 | p03476 | u769698512 | 1563896425 | Python | Python (3.4.3) | py | Runtime Error | 150 | 12536 | 497 | import numpy as np
q = int(input())
# 高速素数判定
is_prime = np.ones(10001, dtype=int)
is_prime[0]=0
is_prime[1]=0
for i in range(2,10001):
if is_prime[i]==1:
j=i+i
while j <= n:
is_prime[j] = 0
j += i
like2017 = [is_prime[x]*is_prime[(x+1)//2] for x in range(0,... |
s346813471 | p03476 | u769698512 | 1563896277 | Python | Python (3.4.3) | py | Runtime Error | 158 | 12536 | 491 | import numpy as np
q = int(input())
# 高速素数判定
is_prime = np.ones(10001, dtype=int)
is_prime[0]=0
is_prime[1]=0
for i in range(2,10001):
if is_prime[i]==1:
j=i+i
while j <= n:
is_prime[j] = 0
j += i
like2017 = [is_prime[x]*is_prime[(x+1)//2] for x in range(0,100... |
s613885385 | p03476 | u533039576 | 1562989339 | Python | Python (3.4.3) | py | Runtime Error | 315 | 11764 | 535 | q = int(input())
l = []
r = []
for i in range(q):
li, ri = map(int, input().split())
l.append(li)
r.append(ri)
r_max = max(r) + 10
is_prime = [True] * r_max
is_prime[0] = False
is_prime[1] = False
for i in range(2, r_max):
if is_prime[i]:
for j in range(2, r_max // i + 1):
is_prime[... |
s588534721 | p03476 | u533039576 | 1562989200 | Python | Python (3.4.3) | py | Runtime Error | 308 | 11764 | 529 | q = int(input())
l = []
r = []
for i in range(q):
li, ri = map(int, input().split())
l.append(li)
r.append(ri)
r_max = max(r) + 10
is_prime = [True] * r_max
is_prime[0] = is_prime[1] = False
for i in range(2, r_max):
if is_prime[i]:
for j in range(2, r_max // i + 1):
is_prime[i*j] =... |
s732184014 | p03476 | u203033720 | 1562426211 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 6039 | #include"bits/stdc++.h"
#define int long long
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define itr(i,x) for(auto i=(x).begin();i!=(x).end();++i)
#define All(x) (x).begin(),(x).en... |
s563170652 | p03476 | u037430802 | 1562015559 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 551 | max_num = 10**5+5
eratos_thenes_sieve = [0,0] + [1]*maxnum
n = 2 #素数
while n*n <= max_num:
if eratos_thenes_sieve[n]:#
for i in range(2*n, max_num, n):
eratos_thenes_sieve[i] = 0
n += 1
isLike2017 = [0] * max_num
cumulativeSums = [0]
for i in range(max_num):
if eratos_thenes_sieve[i] and eratos_thene... |
s715304347 | p03476 | u037430802 | 1562013318 | Python | Python (3.4.3) | py | Runtime Error | 313 | 12492 | 617 | finished = [False] * 10**5
isPN = [False] * 10**5
def isPrimeNumber(num):
if finished[num]:
return isPN[num]
if num == 1:
return False
pn = 2
while pn * pn <= num:
if num % pn == 0:
finished[num] = True
isPN[num] = False
return isPN[num]
pn += 1
finished[num] = True
... |
s139803396 | p03476 | u783219225 | 1560480714 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 448 | Q=int(input())
n=100
is_prime=[1]*(n+10)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+10)
for j in range(2,n+1):
if is_prime[j]%2==0:
continue
if is_prime[j] and is_prime[int((j+1)/2)]:
a[j]=1
s=[0]*(n+10)
for k in r... |
s436575008 | p03476 | u783219225 | 1560480448 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 448 | Q=int(input())
n=100
is_prime=[1]*(n+10)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+10)
for i in range(2,n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+10)
for i in r... |
s211390889 | p03476 | u783219225 | 1560480413 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3316 | 450 | Q=int(input())
n=10100
is_prime=[1]*(n+10)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+10)
for i in range(2,n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+10)
for i in... |
s228107915 | p03476 | u783219225 | 1560480117 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3316 | 417 | Q=int(input())
n=10100
is_prime=[1]*(n+10)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+10)
for i in range(2,n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+10)
for i in... |
s980911282 | p03476 | u783219225 | 1560479452 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3316 | 414 | Q=int(input())
n=10010
is_prime=[1]*(n+1)
is_prime[0]=0
is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+1)
for i in range(2,n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+1)
for i in ra... |
s464628807 | p03476 | u783219225 | 1560479377 | Python | PyPy3 (2.4.0) | py | Runtime Error | 188 | 40432 | 412 | Q=int(input())
n=10010
is_prime=[1]*(n+1)
is_prime[0]=is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+1)
for i in range(2,n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+1)
for i in rang... |
s140176185 | p03476 | u783219225 | 1560479242 | Python | PyPy3 (2.4.0) | py | Runtime Error | 197 | 40432 | 410 | Q=int(input())
n=10010
is_prime=[1]*(n+1)
is_prime[0]=is_prime[1]=0
for i in range(2,n+1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+1)
for i in range(n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+1)
for i in range(... |
s637973470 | p03476 | u783219225 | 1560479024 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 40176 | 420 | Q=int(input())
n=10010
is_prime=[1]*(n+1)
is_prime[0]=is_prime[1]=0
for i in range(2,int(n**0.5)*1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+1)
for i in range(n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+1)
for i... |
s944921609 | p03476 | u783219225 | 1560478985 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3444 | 420 | Q=int(input())
n=10010
is_prime=[1]*(n+1)
is_prime[0]=is_prime[1]=0
for i in range(2,int(n**0.5)*1):
for j in range(i*2,n+1,i):
if is_prime[j]==False:
continue
is_prime[j]=0
a=[0]*(n+1)
for i in range(n+1):
if is_prime[i]%2==0:
continue
if is_prime[i] and is_prime[int((i+1)/2)]:
a[i]=1
s=[0]*(n+1)
for i... |
s185030202 | p03476 | u151625340 | 1559845001 | Python | PyPy3 (2.4.0) | py | Runtime Error | 782 | 51020 | 639 | def sieve(n): # エラトステネスの篩
num = [1]*n
num[0]=num[1]= 0
for i in range(int(n**0.5)+1):
if num[i]:
for j in range(i**2,n,i):
num[j] = 0
return num # list ### 1なら素数0なら合成数
primes = sieve(10**5)
like_2017 = [0]
for i in range(1,len(primes)):
if i <= 2:
like_20... |
s837019435 | p03476 | u785989355 | 1559670821 | Python | Python (3.4.3) | py | Runtime Error | 170 | 7448 | 595 | def sieve_of_eratosthenes(n):
pl = [i for i in range(2, n + 1)]
i=0
p = pl[0]
while p**2<=n:
pl = [pl[j] for j in range(len(pl)) if pl[j]%p!=0 or j<=i]
i+=1
p=pl[i]
return pl
pl=sieve_of_eratosthenes(100000)
p_list = [0 for i in range(100001)]
for p in pl:
if 2*p-1<=10... |
s300594443 | p03476 | u785989355 | 1559670781 | Python | Python (3.4.3) | py | Runtime Error | 162 | 7448 | 569 | def sieve_of_eratosthenes(n):
pl = [i for i in range(2, n + 1)]
i=0
p = pl[0]
while p**2<=n:
pl = [pl[j] for j in range(len(pl)) if pl[j]%p!=0 or j<=i]
i+=1
p=pl[i]
return pl
pl=sieve_of_eratosthenes(100000)
p_list = [0 for i in range(100001)]
for p in pl:
p_list[2*p-1... |
s727885277 | p03476 | u191829404 | 1559235081 | Python | PyPy3 (2.4.0) | py | Runtime Error | 618 | 63576 | 1568 | import math
import copy
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from iterto... |
s062502677 | p03476 | u163320134 | 1558759114 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 428 | def prime(n):
if n==1:
return False
elif n==2 or n==3:
return True
else:
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
else:
return True
ans=[0]*(10**5+1)
for i in range(3,10**5+1,2):
if prime(i) and prime((i+1)//2):
ans[i]=1
for i in range(1,10**5+1)=:
ans[... |
s531353932 | p03476 | u129836004 | 1558462572 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1806 | 57668 | 1307 | import math
def primes(n):
a = list(range(2, n+1))
primes = [2]
for i in a:
flag = True
m = math.sqrt(i)
for j in primes:
if j > m:
break
else:
if i % j == 0:
flag = False
break
if... |
s523425743 | p03476 | u187205913 | 1557100102 | Python | Python (3.4.3) | py | Runtime Error | 364 | 29252 | 645 | q = int(input())
l = [list(map(int,input().split())) for _ in range(q)]
def prime_table(n):
list = [True for _ in range(n+1)]
for i in range(2,int(n**0.5)+1):
if list[i]:
j = i*2
while j<=n:
list[j] = False
j += i
table = [i for i in range(n+1... |
s180171092 | p03476 | u133886644 | 1556929385 | Python | Python (3.4.3) | py | Runtime Error | 1110 | 33064 | 994 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s942000301 | p03476 | u133886644 | 1556929132 | Python | Python (3.4.3) | py | Runtime Error | 1046 | 32276 | 1030 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s412952845 | p03476 | u133886644 | 1556928830 | Python | Python (3.4.3) | py | Runtime Error | 979 | 33032 | 999 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s438497977 | p03476 | u133886644 | 1556928704 | Python | Python (3.4.3) | py | Runtime Error | 950 | 32256 | 966 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s215893694 | p03476 | u133886644 | 1556928636 | Python | Python (3.4.3) | py | Runtime Error | 1044 | 33028 | 947 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s060605070 | p03476 | u133886644 | 1556928013 | Python | Python (3.4.3) | py | Runtime Error | 1031 | 32284 | 946 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s978303287 | p03476 | u133886644 | 1556927696 | Python | Python (3.4.3) | py | Runtime Error | 1037 | 32284 | 948 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s362394337 | p03476 | u133886644 | 1556926395 | Python | Python (3.4.3) | py | Runtime Error | 951 | 32256 | 883 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
if c >= len(prime):
break
t = prime[c]
prime = [v for v in prime ... |
s801966359 | p03476 | u133886644 | 1556926247 | Python | Python (3.4.3) | py | Runtime Error | 1053 | 33056 | 845 | import sys
import bisect
import math
input = sys.stdin.readline
n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
mc = max(l)[1]
mc_sqrt = math.sqrt(mc)
prime = [i for i in range(2, mc + 1)]
c = 0
while True:
t = prime[c]
prime = [v for v in prime if v == t or v % t != 0]
c = c + 1... |
s257650798 | p03476 | u518042385 | 1556499096 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 302 | q=int(input())
l=[0]
c=0
def prime(n):
if n==2:
return True
elif n==1:
return False
else:
return pow(2,n-1,n)==1
for i in range(1,100001):
if prime(n)==True and prime((n+1)//2)=True:
c+=1
l.append(c)
for i in range(q):
a,b=map(int,input().split())
print(l[b]-l[a-1])
|
s387177707 | p03476 | u312025627 | 1556465301 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3192 | 731 | def eratosthenes_2017like(x): #エラトステネスからちょっと変更
prime = []
if x < 3:
return prime
search = [i for i in range(2,x+1)]
while search[0] <= math.sqrt(x):
add = search.pop(0)
prime.append(add)
multiple = 1
while add*multiple <= x:
multiple += 1
i... |
s082022264 | p03476 | u312025627 | 1556465068 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 714 | def eratosthenes_2017like(x):
prime = []
if x < 3:
return prime
search = [i for i in range(2,x+1)]
while search[0] <= math.sqrt(x):
add = search.pop(0)
prime.append(add)
multiple = 1
while add*multiple <= x:
multiple += 1
try:
... |
s408235021 | p03476 | u343523393 | 1555115041 | Python | Python (3.4.3) | py | Runtime Error | 25 | 4596 | 434 | import math
# 0以上整数x「未満」の素数をリストに格納して返す
c=[1]*100005
c[0]=c[1]=0
for i in range(2,10005):
if(c[i]):
for j in range(i*i,10005,i):
c[j]=0
a=[0]*100005
for i in range(3,10005,2):
if(c[i] and c[(i+1)//2]):
a[i]=1
for i in range(1,10004):
a[i+1]+=a[i]
Q = int(input())
for i in rang... |
s736007001 | p03476 | u394721319 | 1554326113 | Python | Python (3.4.3) | py | Runtime Error | 651 | 11844 | 557 | 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(input())
L = [0]*Q
R = [0]*Q
for j in range(Q):
L[j],R[j] = [int(i) for i in input().split()]
li = []
for i in ran... |
s502792109 | p03476 | u813102292 | 1554163181 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 383 | q = int(input())
a = [list(int(i) for i in input().split()) for i in range(q)]
MAX = 10**5
is_prime = [1]*MAX
for i in range(2, MAX):
if not is_prime[i]:
continue
for j in range(i*2, MAX, i):
is_prime[j] = 0
s = [0]*MAX
for i in range(3,MAX):
s[i] = s[i-1] + 1 if is_prime[i] and is_prime[(i+... |
s512480757 | p03476 | u798129018 | 1554157926 | Python | Python (3.4.3) | py | Runtime Error | 363 | 27364 | 442 | Q = int(input())
l = [0]*Q
for i in range(Q):
l[i] = list(map(int,input().split()))
def is_prime(n):
for i in range(2,int(math.sqrt(n))+1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
for i in range(Q):
sum = 0
for j in range(l[i][0],l[i][1... |
s460156333 | p03476 | u837286475 | 1553825301 | Python | Python (3.4.3) | py | Runtime Error | 211 | 3484 | 1382 |
import math
import bisect
prime = [2,3,5,7,11,13,17,19]
for i in range(prime[-1]+2,100000,2):
x = int( math.sqrt(i) )
x += 1 if x%2 == 0 else 0
found = False
for p in prime:
if x < p:
break;
if i % p == 0:
found = True
break
... |
s181059829 | p03476 | u123756661 | 1553745951 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3360 | 705 | def prime_t(t):
i=2
while i**2<=t:
if t%i==0:
return 0
i+=1
return 1
d=[]
n=10**5+1
for i in range(2,n):
if prime_t(i):
d.append(i)
q=int(input())
for i in range(q):
ans=0
l,r=map(int,input().split())
for j in range(l,r+1,2):
if (j in d and (j+1)... |
s413364276 | p03476 | u627417051 | 1553109201 | Python | Python (3.4.3) | py | Runtime Error | 120 | 4016 | 501 | import bisect
Q = int(input())
L = [1 for i in range(100001)]
L[0] = 0
L[1] = 0
for i in range(100001):
if L[i] == 1:
c = 2
while True:
if i * c <= 100000:
L[i * c] = 0
c += 1
else:
break
p2017 = []
for i in range(3, 100001):
if i % 2 != 0:
if L[i] == 1 and L[int((i + 1) // 2)] == 1:
p201... |
s016495544 | p03476 | u585482323 | 1552612351 | Python | PyPy3 (2.4.0) | py | Runtime Error | 221 | 43484 | 1433 | #!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, sys.stdin.... |
s327604628 | p03476 | u001024152 | 1550968512 | Python | Python (3.4.3) | py | Runtime Error | 94 | 7628 | 494 | # D
N = 10**5
primes = set([])
is_prime = [True]*(N+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, N+1):
if is_prime[i]:
primes.add(i)
for j in range(2, N//i+1):
is_prime[j*i] = False
# like-2017
cnt = [0]*(N+2)
for i in range(1, N+2):
cnt[i] += cnt[i-1]
if is_... |
s458465773 | p03476 | u375616706 | 1548301996 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 15396 | 754 | n = (int)(input())
s = []
t = []
for _ in range(n):
a, b = (list)(map(int, input().split()))
s.append(a)
t.append(b)
mi = min(s)
ma = max(t)
def primeList(N):
max = int(N//2)+5
seachList = [i for i in range(2, N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList... |
s548739349 | p03476 | u375616706 | 1548301964 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2109 | 92376 | 754 | n = (int)(input())
s = []
t = []
for _ in range(n):
a, b = (list)(map(int, input().split()))
s.append(a)
t.append(b)
mi = min(s)
ma = max(t)
def primeList(N):
max = int(N//2)+5
seachList = [i for i in range(2, N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList... |
s564502255 | p03476 | u375616706 | 1548301715 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38256 | 777 | import numpy as np
n = (int)(input())
s = []
t = []
for _ in range(n):
a, b = (list)(map(int, input().split()))
s.append(a)
t.append(b)
mi = min(s)
ma = max(t)
def primeList(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2, N+1)]
primeNum = []
while seachList[0] <= max:
pr... |
s063677813 | p03476 | u375616706 | 1548301102 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 484 | from sympy import isprime
n = (int)(input())
s = []
t = []
for _ in range(n):
a, b = (list)(map(int, input().split()))
s.append(a)
t.append(b)
mi = min(s)
ma = max(t)
def isPrime(i):
return isprime(i)
def prime(s, t):
l = [0]*(t+1)
c = 0
s = 0
for i in range(s, t+1):
if isPri... |
s429016925 | p03476 | u177040005 | 1542838907 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 3336 | 889 | import bisect
def prime_num(num):
if num == 1:
return False
else:
i = 2
while i*i <= num:
if num%i == 0:
return False
i += 1
return True
def prime_list(max_num):
prime_list = [2]
for n in range(1,max_num+1,2):
if n == 1:
... |
s458497031 | p03476 | u201234972 | 1542077728 | Python | Python (3.4.3) | py | Runtime Error | 23 | 4596 | 465 | from itertools import accumulate
V = [1]*(10**5+1)
P = [0]*(10**5+1)
V[0] = 0
V[1] = 0
for i in range(10**5+1):
if V[i] == 0:
continue
P[i] = 1
for j in range(2,10**5+1, i):
V[i*j] = 0
W = [0]*(10**5+1)
for i in range(10**5+1):
if not V[i]:
continue
if V[(i+1)//2] == 1:
... |
s350560186 | p03476 | u940102677 | 1541772783 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4056 | 425 | p,q,r = [2],[],[]
k = 3
while k < 100000:
flag = True
for t in p:
if t*t > k:
break
if k%t == 0:
flag = False
if flag:
p.append(k)
k += 2
for t in p[1:]:
if (t+1)//2 in p:
q.append(t)
q.append(100000+3)
k = 0
for i in range(99999//2):
while q[k]<=2*i+1:
k += 1
r.append(k)
c... |
s565088329 | p03476 | u940102677 | 1541772633 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4952 | 415 | k = 3
p,q,r = [2],[],[]
while k < 100000:
flag = True
for t in p:
if t*t > k:
break
if k%t == 0:
flag = False
if flag:
p.append(k)
k += 2
for t in p[1:]:
if (t+1)//2 in p:
q.append(t)
q.append(100000+3)
k = 0
for i in range(99999//2):
while q[k]<=2*i+1:
k += 1
r.append(k)
f... |
s295056535 | p03476 | u226108478 | 1539990507 | Python | Python (3.4.3) | py | Runtime Error | 236 | 4236 | 2574 | # -*- coding: utf-8 -*-
'''Snippets for prime.
Available functions:
- is_included: Determine whether it is a prime number.
- generate: Generate a list of prime numbers using sieve of Eratosthenes.
'''
class Prime(object):
'''Represents a snippet for prime numbers.
'''
def __init__(self, number):
... |
s854728757 | p03476 | u827202523 | 1538201051 | Python | Python (3.4.3) | py | Runtime Error | 371 | 16780 | 945 | highest = 10004
def getN():
return int(input())
def getMN():
a = input().split()
b = [int(i) for i in a]
return b[0],b[1]
accum = [0 for i in range(highest)]
flag = [1 for i in range(highest)]
flag[0] = 0
flag[1] = 0
for i in range(2,highest//2):
flag[i*2] = 0
for i in range(3,highest//2):
... |
s211219545 | p03476 | u827202523 | 1538200830 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3188 | 840 | TOP = 10004
def getN():
return int(input())
def getMN():
a = input().split()
b = [int(i) for i in a]
return b[0],b[1]
accum = [0 for i in range(TOP)]
flag = [1 for i in range(TOP)]
flag[0] = 0
flag[1] = 0
for i in range(2,TOP//2):
flag[i*2] = 0
for i in range(3,TOP//2):
if flag[i] == 0:
... |
s636533461 | p03476 | u991083615 | 1537406224 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 1362 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(in... |
s508591882 | p03476 | u658993896 | 1537136406 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 23696 | 331 | import numpy as np
Q = int(input())
p = np.array([i for i in range(2*10**5+1)])
p[1]=0
for i in range(2,10**5):
p[2*i::i] = 0
p = p[p!=0]
dic = {i:1 for i in p}
for _ in range(Q):
l,r = list(map(int,input().split()))
tmp = p[l<=p]
tmp = tmp[tmp<=r]
print(len(tmp[[dic.get((x+1)//2,0)==1 for x in t... |
s616970526 | p03476 | u124592621 | 1535948607 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 652 | maxnum = 10100
# エラトステネスのふるい
is_prime = [x for x in range(maxnum)]
for prime in is_prime:
if prime == 0 or prime == 1:
is_prime[prime] = 0
continue
for non_prime in range(prime * 2, maxnum, prime):
is_prime[non_prime] = 0
is_like = [False] * maxnum
for i in range(maxnum):
if (is_pr... |
s759788560 | p03476 | u124592621 | 1535948543 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 634 | maxnum = 10000
# エラトステネスのふるい
is_prime = [x for x in range(maxnum)]
for prime in is_prime:
if prime == 0 or prime == 1:
is_prime[prime] = 0
continue
for non_prime in range(prime * 2, maxnum, prime):
is_prime[non_prime] = 0
is_like = [False] * maxnum
for i in range(maxnum):
if (is_pr... |
s806073463 | p03476 | u124592621 | 1535948377 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 648 | maxnum = 10000
# エラトステネスのふるい
is_prime = [x for x in range(maxnum)]
for prime in is_prime:
if prime == 0 or prime == 1:
is_prime[prime] = 0
continue
for non_prime in range(prime * 2, maxnum, prime):
is_prime[non_prime] = 0
is_like = [False] * maxnum
for i in range(maxnum):
if (is_pr... |
s978480069 | p03476 | u124592621 | 1535948223 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 652 | maxnum = 10001
# エラトステネスのふるい
is_prime = [x for x in range(maxnum)]
for prime in is_prime:
if prime == 0 or prime == 1:
is_prime[prime] = 0
continue
for non_prime in range(prime * 2, maxnum, prime):
is_prime[non_prime] = 0
is_like = [False] * maxnum
for i in range(maxnum):
if (is_pr... |
s063716387 | p03476 | u124592621 | 1535947646 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 652 | maxnum = 10000
# エラトステネスのふるい
is_prime = [x for x in range(maxnum)]
for prime in is_prime:
if prime == 0 or prime == 1:
is_prime[prime] = 0
continue
for non_prime in range(prime * 2, maxnum, prime):
is_prime[non_prime] = 0
is_like = [False] * maxnum
for i in range(maxnum):
if (is_pr... |
s367707530 | p03476 | u820560680 | 1535146515 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 697 | import bisect
def prime_list(n):
'''
n未満の素数のリストを返す
'''
num = list(range(2, n))
prime = []
while num[0] ** 2 < n:
p = num.pop(0)
for j in range(2 * p, n, p):
if j in num:
num.remove(j)
prime.append(p)
prime += num
return prime
Q = int(i... |
s657194156 | p03476 | u284854859 | 1533342059 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3828 | 524 |
Q = int(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 range(1, n, 2):
j = (i + 1) /... |
s190716842 | p03476 | u594859393 | 1532197751 | Python | PyPy2 (5.6.0) | py | Runtime Error | 35 | 28012 | 703 | from itertools import accumulate, count, islice, takewhile
def eratosthenes():
d = {}
for q in count(2):
p = d.pop(q, None)
if p:
x = next(x for x in count(q + p, p) if x not in d)
d[x] = p
else:
yield q
d[q*q] = q
def likes():
xs = ... |
s361098744 | p03476 | u136090046 | 1530997480 | Python | Python (3.4.3) | py | Runtime Error | 476 | 21452 | 631 | import bisect
def primes(n):
sieve = [True] * n
for i in range(3, int(n ** 0.5) + 1, 2):
if sieve[i]:
sieve[i * i::2 * i] = [False] * (int((n - i * i - 1) / (2 * i)) + 1)
return [2] + [i for i in range(3, n, 2) if sieve[i]]
q = int(input())
array = [[int(x) for x in input().split()] ... |
s771350598 | p03476 | u136090046 | 1530997392 | Python | Python (3.4.3) | py | Runtime Error | 498 | 21332 | 629 | import bisect
def primes(n):
sieve = [True] * n
for i in range(3, int(n ** 0.5) + 1, 2):
if sieve[i]:
sieve[i * i::2 * i] = [False] * (int((n - i * i - 1) / (2 * i)) + 1)
return [2] + [i for i in range(3, n, 2) if sieve[i]]
q = int(input())
array = [[int(x) for x in input().split()] ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.