input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# エラトステネスの篩
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 sieve... | 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):
if sieve[j] == ... | p02819 |
a = int(eval(input()))
flag = 0
j = 0
while(flag != 1):
count =0
temp = a+j
for i in range(2, temp):
if(temp %i == 0):
count +=1
if(count == 0):
flag =1
print(temp)
j+=1 | import math
def isPrime(n):
if(n <= 1):
return False
if(n <= 3):
return True
if(n % 2 == 0 or n % 3 == 0):
return False
for i in range(5,int(math.sqrt(n) + 1), 6):
if(n % i == 0 or n % (i + 2) == 0):
return False
re... | p02819 |
x = int(eval(input()))
def prime_factorize(n):
r = []
while n % 2 == 0:
r.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
r.append(f)
n //= f
else:
f += 2
if n != 1:
r.append(n)
return r
... | x = int(eval(input()))
def isPrime(n):
if n == 2:
return True
if n % 2 == 0:
return False
m = int(n**0.5)+1
for p in range(3, m, 2):
if n % p == 0:
return False
return True
while not isPrime(x):
x += 1
print(x) | p02819 |
'''
import math
import fractions
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 bitlist(x,digit):
re... | '''
import math
import fractions
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 bitlist(x,digit):
re... | p02819 |
import sys
n = int(eval(input()))
for i in range(n,2*n):
chk = True
for j in range(2,n):
if i%j==0:
chk=False
if chk==True:
print(i)
sys.exit()
| x = int(eval(input()))
def is_prime(n):
for i in range(2,int(n**0.5)+1):
if n%i != 0:
continue
else:
return False
return True
while True:
if is_prime(x) == True:
break
else:
x +=1
print(x)
| p02819 |
import sys
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
x = int(eval(input()))
for i in range(x, 10**5+4):
if is_prime(i):
print(i)
sys.exit() | import sys
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
x = int(eval(input()))
if x == 2:
print(x)
sys.exit()
for i in range(x, 10**5+4):
if i % 2 == 1 and is_pr... | p02819 |
x = int(eval(input()))
prime_table = []
def judge(n):
for i in prime_table:
if n%i == 0:
return False
prime_table.append(n)
return True
num = 1
p = True
while p == True:
num += 1
if judge(num) == True:
if num >= x:
p = False
print(num) | x = int(eval(input()))
def is_prime(n):
if n <= 1:
return False
for i in range(2, x):
if x%i == 0:
return False
return True
while is_prime(x) == False:
x += 1
print(x) | p02819 |
x = int(eval(input()))
def is_prime(n):
if n <= 1:
return False
for i in range(2, x):
if x%i == 0:
return False
return True
while is_prime(x) == False:
x += 1
print(x) | import math
x = int(eval(input()))
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(math.sqrt(x))):
if x%i == 0:
return False
return True
while is_prime(x) == False:
x += 1
print(x) | p02819 |
#!/usr/bin/env python3
def main():
x = int(eval(input()))
primes = furui(300000)
for p in primes:
if x <= p:
print(p)
return
raise ValueError
def furui(nmax):
assert nmax > 2
p = 2
primes = list(range(2, nmax + 1))
while True:
if ... | #!/usr/bin/env python3
def main():
x = int(eval(input()))
primes = furui(300000)
for p in primes:
if x <= p:
print(p)
return
raise ValueError
# https://mathtrain.jp/eratosthenes
def furui(nmax):
assert nmax > 2
p = 2
primes = list(range(2, nma... | p02819 |
#!/usr/bin/env python3
def main():
x = int(eval(input()))
primes = furui(300000)
for p in primes:
if x <= p:
print(p)
return
raise ValueError
# https://mathtrain.jp/eratosthenes
def furui(nmax):
assert nmax > 2
p = 2
primes = list(range(2, nma... | #!/usr/bin/env python3
def main():
x = int(eval(input()))
primes = sieve(300000)
for p in primes:
if x <= p:
print(p)
return
raise ValueError
# O(nloglogn) https://mathtrain.jp/eratosthenes
def sieve(n): # exclusive
s = [True] * n
for x in range(2... | p02819 |
def prime(n):
prime_table = [2]
for i in range(3,n+1):
f = 1
for j in prime_table[:bisect.bisect_right(prime_table,int(i**0.5))]:
if i % j == 0:
f = 0
break
if f:
prime_table.append(i)
return prime_table
import bisect
n = int(eval(input()))
prime_table = prim... | def prime(n):
prime_table = [2]
for i in range(3,n+1):
f = 1
for j in prime_table[:bisect.bisect_right(prime_table,int(i**0.5))]:
if i % j == 0:
f = 0
break
if f:
prime_table.append(i)
return prime_table
import bisect
x = int(eval(input()))
pt = prime(5*10**5... | p02819 |
import math
X = int(eval(input()))
def is_prime(x):
a = int(math.sqrt(X)) + 1
for i in range(2,a):
if x % i == 0:
return False
return True
for j in range(X,X+100):
if is_prime(j):
ans = j
break
print(ans) | import math
X = int(eval(input()))
def is_prime(x):
a = int(math.sqrt(X)) + 1#ある数が素数かどうかはO(√A)で判定できる
for i in range(2,a):
if x % i == 0:
return False
return True#xは素数
for j in range(X,10**5+4):
if is_prime(j):
ans = j
break
print(ans) | p02819 |
from bisect import bisect_left, bisect_right
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
... | from bisect import bisect_left
def get_primes(n):
if not isinstance(n, int):
raise TypeError('n is int-type.')
if n < 2:
raise ValueError('n is more than 2')
from math import sqrt
def _sieve_of_eratosthenes(n):
primes = []
limit = sqrt(n)
data =... | p02819 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | n = int(eval(input()))
def f(x):
for k in range(2, int(x**0.5) + 1):
if x % k != 0:
continue
return False
return True
i = n
while 1:
if f(i):
print(i)
break
i += 1 | p02819 |
x = int(eval(input()))
y = x + 100
is_prime = [False] * 2 + [True for _ in range(2, y+1)]
prime = []
for i in range(2, y+1):
for j in range(i*2, y+1, i):
is_prime[j] = False
for i in range(y+1):
if is_prime[i]:
prime.append(i)
for i in range(len(prime)):
if prime[i] >= x:
print((prime[i]))
... | x = int(eval(input()))
while True:
x_sqrt = int(x ** 0.5)
for i in range(2, x_sqrt+1):
if x % i == 0:
break
else:
print(x)
break
x += 1 | p02819 |
x = int(eval(input()))
for i in range(x,10**5+100):
flg = 'so'
for j in range(2,x):
if i % j == 0:
flg = 'no'
if flg == 'so':
print(i)
exit() | x = int(eval(input()))
for i in range(x,10**5+100):
flg = 'so'
for j in range(2,x):
if i % j == 0:
flg = 'no'
break
if flg == 'so':
print(i)
exit() | p02819 |
import math
X = int(eval(input()))
def get_primenumber(number):
prime_list = []
# 2からnumberまでの数字をsearch_listに入れる
search_list = list(range(2, number+1))
while True:
# search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(number):
# prime_listにsearch_listを結合
... | x = int(eval(input()))
while True:
i = 2
ok = True
while i * i <= x:
if x % i == 0:
ok = False
break
i += 1
if ok:
print(x)
break
x += 1 | p02819 |
X = int(eval(input()))
while True:
flg=True
for i in range(2, X):
if X%i!=0:
continue
flg=False
break
if flg:
print(X)
break
else:
X+=1
continue | import math
X = int(eval(input()))
Y = int(math.sqrt(X))
while True:
flg=True
for i in range(2, Y):
if X%i!=0:
continue
flg=False
break
if flg:
print(X)
break
else:
X+=1
continue | p02819 |
#!/usr/bin/env python3
import math
n = int(eval(input()))
def eratosthenes(n):
prime = [2]
i = 2
while prime[-1] < n:
i += 1
prime_bit = 0
for div in prime:
if i % div == 0:
break
if div == prime[-1]: prime_bit = 1
if prim... | #!/usr/bin/env python3
import math
n = int(eval(input()))
def is_prime(n):
for i in range(2,math.ceil(n**1/2)+1):
if n % i == 0:
return False
return True
i = n
while True:
if is_prime(i): break
i += 1
print(i) | p02819 |
X=int(eval(input()))
flag = True
if X == 2:
print(X)
else:
while flag:
i = 2
while i<X:
if X%i == 0:
break
if i == X-1:
print(X)
flag = False
break
i = i+1
X = X+1 | X=int(eval(input()))
def is_prime(q,k=100):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
for i in range(3,k):
x,y = q,i
while y:
x, y = y, x % y
if x != 1: continue
if pow(i, q-1, q) != 1:
return False
retur... | p02819 |
# import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
if X == 2:
print(X)
sys.exit()
def segment_sieve(a,b):
ass = []
is_prime_small = [True] * (int(b**0.5)+1)
is_prime = [True] * (b-a)
for i in range(2,int(b**0.5)):
if is_prime_... | # import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
def is_prime(x):
if x <= 1:
return False
for i in range(2,int(math.sqrt(x))+1):
if x % i == 0:
return False
return True
while not is_prime(X):
X += 1
print(X)
| p02819 |
X = int(eval(input()))
import math
def get_prime(n):
if n <=1:
return []
prime = [2]
limit = int(math.sqrt(n))
# 奇数のリストを作成
data = [i+1 for i in range(2,n,2)]
while limit > data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] !=0]
... | X = int(eval(input()))
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
for i in range(X,(X*2)+100,):
if is_prime(i):
print(i)
break
| p02819 |
X = int(eval(input()))
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
for i in range(X,(X*2)+100,):
if is_prime(i):
print(i)
break
| X = int(eval(input()))
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
while not is_prime(X):
X+=1
print(X) | p02819 |
import math
import sys
x = int(eval(input()))
flg = 0
if x == 2:
print(x)
sys.exit()
for i in range(x,100005):
flg = 0
for j in range(2,int(math.sqrt(i))+1):
if i%j == 0:
flg = 1
if flg == 0 and j == int(math.sqrt(i)):
print(i)
sys.exit()
continue
| import sys
import math
x=int(eval(input()))
while True:
for i in range(2,int(math.sqrt(x))):
if x%i==0:
break
else:
print(x)
break
x+=1 | p02819 |
X = int(eval(input()))
for i in range(X, 100005):
for j in range(2,i):
if i%j == 0:
break
else:
print(i)
quit() | import math
X = int(eval(input()))
def isPrime(n):
if n == 1:
return False
max = math.ceil(math.sqrt(n))
for i in range(2,max):
if n % i == 0:
return False
return True
while(True):
if isPrime(X):
print(X)
quit()
else:
X = X+1 | p02819 |
N = int(eval(input()))
ans = -1
x = N
while(ans == -1):
if all([x % i != 0 for i in range(2, x)]):
ans = x
else:
x += 1
print(ans) | x=int(eval(input()))
f=0
if x == 2:
print((2))
else:
for i in range(x,10**6):
for j in range(2,i//2+2):
if i%j == 0:
break
else:
f=i
break
print(f)
| p02819 |
x=int(eval(input()))
f=0
if x == 2:
print((2))
else:
for i in range(x,10**6):
for j in range(2,i//2+2):
if i%j == 0:
break
else:
f=i
break
print(f)
| from math import sqrt
n=int(eval(input()))
def is_prime(n):
if n<2:
return False
for k in range(2,int(sqrt(n))+1):
if n%k==0:
return False
return True
while not is_prime(n):
n+=1
print(n) | p02819 |
def eratosthenes(n: int) -> list:
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
x = int(eval(input()))
is_prime = eratost... | def is_prime(n):
if n <= 1:
return False
elif n == 2:
return True
elif n % 2 == 0:
return False
for i in range(3, n, 2):
if i * i > n:
break
if n % i == 0:
return False
return True
x = int(eval(input()))
while not is_p... | p02819 |
def genP():
yield 2
yield 3
c=6
while 1:
yield c-1
yield c+1
c+=6
def sosu(n):
if n in [2,3,5]:
return True
l=int(n**0.5)+1
p=genP()
for i in p:
if i>l:
return True
break
elif n%i==0:
return False
break
def resolve():
x=int(eval(input()))
while 1:
if sosu... | def sosu(p):
if p==2:
return True
l=int(p**0.5)+1
for i in range(2,l+1):
if p%i==0:
return False
return True
x=int(eval(input()))
x+=1 if x!=2 and x%2==0 else 0
while sosu(x)==False:
x+=2
print(x) | p02819 |
x = int(eval(input()))
p = [True] * 100004
p[0] = False
p[1] = False
for i in range(int(100003 ** 0.5)):
if p[i] == False:
continue
for j in range(2, 100003 // i + 1):
p[i * j] = False
for i in range(x, 100004):
if p[i] == True:
print(i)
break | x = int(eval(input()))
for i in range(x, 100003 + 1):
for j in range(2, i):
if i % j == 0:
break
else:
print(i)
break | p02819 |
X = int(eval(input()))
count = 0
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
else:
while True:
count = 0
X += 1
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
... | x = int(eval(input()))
p = x - 1
prime = False
if x == 2:
print((2))
else:
while prime == False:
p += 1
prime = True
for i in range(2, p - 1):
if p % i == 0:
prime = False
break
print(p) | p02819 |
def get_primenumber(N):
prime_list = [2]
for num in range(3,N+1,2):
if all( num % prime != 0 for prime in prime_list):
prime_list.append(num)
return prime_list
X = int(eval(input()))
s = get_primenumber(X+100)
for i in range(10**4):
if s[i]>=X:
print((s[i]))
... | K = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,... | p02819 |
import sys
import math
input = sys.stdin.readline
def multiples(n):
for i in range(3,100003):
yield i*n
if i*n > 100003:
break
def sosuu(x):
if x == 2 : return 2
d = set()
end = math.ceil(math.sqrt(x))
d = d.union(multiples(2))
for i in range(3,end,2)... | import sys
import math
input = sys.stdin.readline
def is_prime(x):
if x <= 1:
return False
for i in range(2,math.ceil(x**0.5)):
if x%i==0:
return False
return True
def main():
x = int(eval(input()))
p = x
while not is_prime(p):
p += 1
pr... | p02819 |
n = int(eval(input()))
while(True):
flag = True
for i in range(2, n):
if n % i == 0:
flag = False
break
if flag:
break
n += 1
print(n)
| n = int(eval(input()))
def is_prime(n):
flag = True
for i in range(2, n):
if n % i == 0:
flag = False
break
return flag
while(not is_prime(n)):
n += 1
print(n)
| p02819 |
import math
from itertools import product
x = int(eval(input()))
limit = 10**5
sosu = -1
flag = 1
i = x
while True:
for j in range(2, int(math.sqrt(i))+1):
if (i%j)==0:
flag = 0
break
if flag:
sosu = i
break
else:
i += 1
flag = 1
print(sosu) | import math
x = int(eval(input()))
limit = 10**5
i = x
while True:
for j in range(2, int(math.sqrt(i))+1):
if (i%j)==0:
break
else:
# すべてのjで割り切れなかった場合
print(i)
break
i += 1 | p02819 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): re... | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): re... | p02819 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): re... | # import sys
# sys.setrecursionlimit(10 ** 6)
# # input = sys.stdin.readline ####
# def int1(x): return int(x) - 1
def II(): return int(eval(input()))
# def MI(): return map(int, input().split())
# def MI1(): return map(int1, input().split())
#
# def LI(): return list(map(int, input().split()))
# def LI1(... | p02819 |
# coding: utf-8
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
r... | # coding: utf-8
def elatostenes(x):
for i in range(2, int(x ** 0.5)+1):
if x % i == 0:
return False
return True
X = int(eval(input()))
while True:
if elatostenes(X):
print(X)
exit()
else:
X += 1 | p02819 |
a = int(eval(input()))
def hantei(x):
k = 0
for i in range(2, x//2):
if x % i == 0:
k += 1
if k ==0:
return x
c = True
while c:
hantei(a)
b = hantei(a)
if b is not None:
print(b)
c = False
elif b is None:
a += 1 | a = int(eval(input()))
b = True
def hantei(n, x): #素数だとFalseを返す
for i in range(2, n):
if n % i == 0:
x = True
return x
while b:
b = hantei(a, b)
if b is None:
print(a)
break
a += 1
| p02819 |
X=int(eval(input()))
while True:
for x in range(2,X):
if X%x==0:
break
else:
print(X)
break
X+=1 | X=int(eval(input()))
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if x%i==0:
break
else:
print(x)
break | p02819 |
X=int(eval(input()))
num=2
while num<X:
if X%num==0:
X+=1
num=2
else:
num+=1
print(X) | X=int(eval(input()))
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if x%i==0:
break
else:
print(x)
break | p02819 |
import sys
#import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
X = ri()
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_pr... | import sys
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
X = ir()
def check(n):
if X == 2:
return True
if n % 2 == 0:
return False
f = 3
while f * f <= n:
if n % f == 0... | p02819 |
X = int(eval(input()))
flag = 0
while flag ==0:
if X==2:
X+=1
break
for i in range(X-2):
if X%(i+2)==0:
break
if i+3==X:
flag = 1
break
X +=1
print((X-1)) | X=int(eval(input()))
flag=0
if X==2 or X==3:
flag=1
while flag==0:
for k in range(2,int(X**0.5)+1):
if k==int(X**0.5) and X%k!=0:
flag=1
if k>2 and k%2==0:
continue
elif k>3 and k%3==0:
continue
elif X%k==0:
break
if flag==0:X=X+1
print(X)
| p02819 |
import bisect
x = int(eval(input()))
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:
is_prime[j-1] = False
j += i
table = [ i for i i... | x = int(eval(input()))
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:
is_prime[j-1] = False
j += i
table = [ i for i in range(1, n+1) i... | p02819 |
def Eratosthenes(x):
lis = [int(i) for i in range(2,x)]
#print(lis)
res = list()
while lis:
a = lis.pop(0)
res.append(a)
lis = [i for i in lis if i%a != 0]
#print(lis)
return res
N = int(eval(input()))
lis = Eratosthenes(N)
x = N
while True:
if a... | # -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:09:25 2020
@author: liang
"""
def Eratosthenes(x):
lis = [int(i) for i in range(2,x)]
#print(lis)
res = list()
while lis:
a = lis.pop(0)
res.append(a)
lis = [i for i in lis if i%a != 0]
#print(lis)
... | p02819 |
# -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:09:25 2020
@author: liang
"""
def Eratosthenes(x):
lis = [int(i) for i in range(2,x)]
#print(lis)
res = list()
while lis:
a = lis.pop(0)
res.append(a)
lis = [i for i in lis if i%a != 0]
#print(lis)
... | # -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:25:36 2020
@author: liang
"""
def Eratosthenes(x):
lis = [int(i) for i in range(2,x+1)]
#print(lis)
res = list()
while lis:
a = lis.pop(0)
res.append(a)
lis = [i for i in lis if i%a != 0]
#print(lis)
... | p02819 |
# -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:25:36 2020
@author: liang
"""
def Eratosthenes(x):
lis = [int(i) for i in range(2,x+1)]
#print(lis)
res = list()
while lis:
a = lis.pop(0)
res.append(a)
lis = [i for i in lis if i%a != 0]
#print(lis)
... | # -*- coding: utf-8 -*-
"""
Created on Tue Sep 8 20:37:12 2020
@author: liang
"""
import math
X = int(eval(input()))
N = int(math.sqrt(X))
lis = list(range(2,N+1))
#print(N)
#print(lis)
ans = X
while True:
if all(ans%i != 0 for i in lis):
print(ans)
break
#print(ans)
a... | p02819 |
x=int(eval(input()))
s={2}
if x==2:
print((2))
else:
for i in range(3,10**6):
if all(i%j!=0 for j in s):
s.add(i)
if i>=x:
print(i)
break
| x=int(eval(input()))
counter=0
while counter==0:
counter=1
for i in range(2,x):
if x%i==0:
counter=0
if counter==1:
print(x)
else:
x+=1
| p02819 |
x = int(eval(input()))
n = 2
while n<x:
if x%n == 0:
x+=1
n=2
else:
n+=1
print(x) | x = int(eval(input()))
for y in range(x,2*x):
for i in range(2, int(y**.5)+1):
if y%i ==0:
break
else:
print(y)
break | p02819 |
X = int(eval(input()))
result = False
while result == False:
result = True
for i in range(2,-(-X//2)+1):
if X % i == 0:
result = False
break
else:
result = True
if not result:
X += 1
print(X)
| X = int(eval(input()))-1
result = False
while not result:
result = True
X += 1
for i in range(2,X//2+1):
if X % i == 0:
result = False
break
print(X) | p02819 |
x = int(eval(input()))
while True:
is_prime = True
for i in range(2, x):
if x % i == 0:
is_prime = False
break
if is_prime:
print(x)
break
x += 1
| x = int(eval(input()))
def is_prime(x):
if x <= 1:
return False
for i in range(2, int(x**0.5)+1):
if x % i == 0:
return False
return True
while(not is_prime(x)):
x += 1
print(x)
| p02819 |
import sys
import math
def isPrime(num):
if num < 2: return False
elif num == 2: return True
elif num % 2 == 0: return False
for i in range(3, math.floor(math.sqrt(num))+1, 2):
if num % i == 0:
return False
return True
def callIsPrime(input_num):
numbers = []
... | import sys
import math
def is_prime(num):
if num < 2: return False
elif num == 2: return True
elif num % 2 == 0: return False
for i in range(3, math.floor(math.sqrt(num))+1, 2):
if num % i == 0:
return False
return True
def call_is_prime(n):
return [i for i in ... | p02819 |
import math
X = int(eval(input()))
if X == 2 or X == 3:
print(X)
exit()
x = X
while 1:
flag = 1
for i in range(2,int(math.sqrt(X))+1):
if x%i == 0:
flag = 0
if flag:
print(x)
break
x += 1
|
def is_prime(x):
if x == 1:
return False
flag = True
for i in range(2,int(math.sqrt(x))+1):
if x%i == 0:
flag = False
return flag
import math
X = int(eval(input()))
i=0
while 1:
if is_prime(X+i):
print((X+i))
break
i+=1 | p02819 |
N = int(eval(input()))
over_box = [i for i in range(N,10**6)]
primes = [2]
for i in range(3, N, 2):
all(i % p != 0 for p in primes) and primes.append(i)
for i in over_box:
if N ==2:
print((2))
break
elif all(i % p != 0 for p in primes):
print(i)
break | N = int(eval(input()))
box = [i for i in range(N,100004)]
box = [i for i in box if not i % 2==0]
box = [i for i in box if not i % 3==0]
box = [i for i in box if not i % 5==0]
box = [i for i in box if not i % 7==0]
primes = [2]
for i in range(3, N, 2):
all(i % p != 0 for p in primes) and primes.append(i)
fo... | p02819 |
X = int(eval(input()))
if X == 2:
print((2))
exit()
num = 3
ps = [2]
while 1:
flag = True
for p in ps:
if num%p == 0:
flag = False
break
if flag:
ps.append(num)
if num>=X:
print(num)
exit()
num += 1 | X = int(eval(input()))
if X == 2:
print((2))
exit()
num = 3
ps = [2]
while 1:
flag = True
for p in ps:
if num%p == 0:
flag = False
break
if flag:
ps.append(num)
if num>=X:
print(num)
exit()
num += 2 | p02819 |
x = int(eval(input()))
a = 2
while True:
while a <= int(x**0.5//1):
if x%a == 0: break
a += 1
else:
ans = x
break
x += 1
a = 2
print(ans) | def is_prime(n):
if n == 1:
return True
for i in range(2,int(n**0.5)+1):
if n%i == 0:
return False
return True
x = int(eval(input()))
while True:
if is_prime(x) == True:
ans = x
break
x += 1
print(ans) | p02819 |
X = int(eval(input()))
import math
# Mまでの素数全列挙(エラトステネスの篩)
def primes(M):
is_prime = [-1 for _ in range(M+1)]
for m in range(2, M+1):
if is_prime[m] == -1:
is_prime[m] = 1
l = 2
while m*l <= M:
is_prime[m*l] = 0
l += 1
... | N = int(eval(input()))
import math
# Mまでの素数全列挙(エラトステネスの篩)
def primes(M):
is_prime = [-1 for _ in range(M+1)]
for m in range(2, M+1):
if is_prime[m] == -1:
is_prime[m] = 1
l = 2
while m*l <= M:
is_prime[m*l] = 0
l += 1
... | p02819 |
def is_prime(n):
if n==1:
return False
for i in range(2, int(n**.5)+1):
if n%i==0:
return False
return True
x = int(eval(input()))
for i in range(x, 10**6):
if is_prime(i):
print(i)
break | def is_prime(n):
if n==1:
return False
for i in range(2, int(n**.5)+1):
if n%i==0:
return False
return True
x = int(eval(input()))
if x!=2 and x%2==0:
x+=1
for i in range(x, 10**6, 2):
if is_prime(i):
print(i)
break
| p02819 |
import math
X = int(eval(input()))
X -= 1
Flag = True
if X == 1:
print((2))
Flag = False
while Flag:
X += 1
r = 1
for i in range(math.ceil(math.sqrt(X)) - 1):
r += 1
if X % r == 0:
break
if r == math.ceil(math.sqrt(X)):
print(X)
Flag = False | import math
X = int(eval(input()))
while any(X % i == 0 for i in range(2, int(math.sqrt(X)+1))):
X += 1
print(X) | p02819 |
def prime(x):
flag = True
n = 1
while(n**2 <=x):
n += 1
q,r = divmod(x,n)
if r==0:
flag = False
break
return flag
def find(x):
c = x
while(prime(c)==False):
c +=2
return c
x = int(eval(input()))
if x==2:
print... | def prime(x):
n = 2
while(n * n <= x):
if(x % n ==0):
return False
n += 1
return True
x = int(eval(input()))
while(prime(x)!=True):
x += 1
print(x) | p02819 |
X=int(eval(input()))
ps=[2]
x=2
while ps[-1]<X:
f=True
for p in ps:
if x%p==0:
f=False
break
if f:ps.append(x)
x+=1
print((ps[-1]))
| def is_prime(p):
if p>1:
for i in range(2,p):
if p%i==0:return True
return False
X=int(eval(input()))
p=X
while is_prime(p) != False:p+=1
print(p)
| p02819 |
X = int(eval(input()))
fact = [True] * (10 ** 5 + 1000)
fact[0],fact[1] = False,False
for i in range(2,len(fact)):
if fact[i]:
for j in range(i * 2, len(fact), i):
fact[j] = False
for i in range(X,len(fact)):
if fact[i]:
print(i)
break | X = int(eval(input()))
def checkfact(x):
for i in range(2,int(x ** 0.5) + 1):
if x % i == 0:
return False
return True
while True:
if checkfact(X):
print(X)
break
X += 1 | p02819 |
x = int(eval(input()))
ok = False
while ok == False:
ok = True
for i in range(2, x):
if x%i == 0:
ok = False
x += 1
#print("####")
break
if ok == True:
print(x)
break
| x = int(eval(input()))
ok = False
while ok == False:
ok = True
for i in range(2, int(x/2)):
if x%i == 0:
ok = False
x += 1
#print("####")
break
if ok == True:
print(x)
break
| p02819 |
X = int(eval(input()))
def iter_next_prime():
yield 2
yield 3
primes = [2, 3]
i = 3
while True:
i += 2
for prime in primes:
if i % prime == 0:
break
else:
yield i
primes.append(i)
for prime in iter_next... | X = int(eval(input()))
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, 293, 307, ... | p02819 |
x = int(eval(input()))
if x == 1:
ans = 1
elif x == 2:
ans = 2
else:
num = [3]
for i in range(3, x, 2):
for j in num:
if (i % j) == 0:
break
else:
num.append(i)
last_num = i
k = i + 1
while True:
for j in n... | # ABC149C
import math
def check_prime(num):
for i in range(2, math.ceil(math.sqrt(num))):
if num % i == 0:
return False
else:
return True
x = int(eval(input()))
while True:
if check_prime(x):
print(x)
break
x += 1 | p02819 |
X = int(eval(input()))
prime = [2]
for i in range(3, 100004):
for p in prime:
is_prime = True
if i % p == 0:
is_prime = False
break
if is_prime: prime.append(i)
print((min([i for i in prime if i >= X]))) | X = int(eval(input()))
def is_prime(n):
for i in range(2, int(n ** 1/2) + 1):
if n % i == 0:
return False
return True
for i in range(X, 100004):
if is_prime(i):
print(i)
break | p02819 |
x = int(eval(input()))
s =[2]
a = x
if x==2:
print(x)
else:
for i in range(3,2*x,2):
if all(i%k!=0 for k in s):
s.append(i)
if i >=x:
print(i)
exit()
| x = int(eval(input()))
s =[2]
if x==2:
print(x)
exit()
else:
for i in range(3,int(x/2),2):
if all(i%k!=0 for k in s):
s.append(i)
while any(x%k==0 for k in s):
x+=1
else:
print(x) | p02819 |
from subprocess import*
x=int(eval(input()))
while len(Popen(['factor',str(x)],stdout=PIPE).communicate()[0].split())>2:x+=1
print(x) | x=int(eval(input()))
while any(x%i<1for i in range(2,x)):x+=1
print(x) | p02819 |
import math
x = int(eval(input()))
def prime_get():
if x <= 1:
return []
prime = [2]
limit = int(math.sqrt(x))
data = [i+1 for i in range(2,100004,2)]
while limit >= data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] != 0]
return prime+data... | import math
x = int(eval(input()))
def prime(x):
if x == 2:
return True
elif x % 2 == 0:
return False
elif x > 2:
for i in range(3, math.floor(math.sqrt(x))+1,2):
if x % i == 0:
return False
return True
while prime(x) != True :
x... | p02819 |
x = int(eval(input()))
def get_prime(n):
p = [2]
for i in range(3, n, 2):
if all(i%j!=0 for j in p):
p.append(i)
return p
p = get_prime(x)
if x == 2:
print((2))
else:
if x%2 == 0:
x += 1
while True:
for prime in p:
if x%prime =... | x = int(eval(input()))
if x == 2:
print((2))
exit()
elif x%2 == 0:
x += 1
def get_prime(n):
p = [2]
for i in range(3, n, 2):
if all(i%j!=0 for j in p):
p.append(i)
return p
p = get_prime(x)
while True:
for prime in p:
if x%prime == 0:
... | p02819 |
x = int(eval(input()))
num = 2
# 素数リスト
prime_list = []
while True:
# 取り出した数字が素数リストの要素で割れなければ素数リストに追加する
if all(num % prime != 0 for prime in prime_list):
prime_list.append(num)
if num >= x:
break
num += 1
print(num) | x = int(eval(input()))
import random
def is_prime3(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 i in ra... | p02819 |
import math
x = int(eval(input()))
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
i = x
while not is_prime(i):
i += 1
print(i)
| import math
x = int(eval(input()))
def is_prime(n: int) -> bool:
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
while True:
if is_prime(x):
break
x += 1
print(x)
| p02819 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
x = int(readline())
for i in range(x, 10 ** 10):
b = True
for j in range(2, int(i ** 0.5) + 1):
if i % j == 0:
b = False
break
if b:
... | import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
x = int(input().rstrip('\n'))
for i in range(x, 10 ** 10):
b = True
for j in range(2, int(i ** 0.5) + 1):
if i % j == 0:
b = False
break
if b:
... | p02819 |
def miller_rabin(n, k=10000):
import random
if n == 2:
return True
if n == 1 or n & 1 == 0:
return False
d = (n - 1) >> 1
while d & 1 == 0:
d >>= 1
for _ in range(k):
a = random.randint(1, n - 1)
t = d
y = pow(a, t, n)
while t ... | def miller_rabin(n, k=100):
import random
if n == 2:
return True
if n == 1 or n & 1 == 0:
return False
d = (n - 1) >> 1
while d & 1 == 0:
d >>= 1
for _ in range(k):
a = random.randint(1, n - 1)
t = d
y = pow(a, t, n)
while t !=... | p02819 |
x = int(eval(input()))
while True:
if all(x % i != 0 for i in range(2, x)):
print(x)
exit()
else:
x+=1 | def is_prime(n):
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
x = int(eval(input()))
while True:
if is_prime(x):
print(x)
exit()
x+=1 | p02819 |
x=int(eval(input()))
def primeddx(x):
for i in range(2,x):
if x%i==0:
return False
return True
while not primeddx(x):
x+=1
print(x) | x=int(eval(input()))
def primeddx(x):
for i in range(2,int(x**0.5)):
if x%i==0:
return False
return True
while not primeddx(x):
x+=1
print(x) | p02819 |
def isPrime(n):
# 素数判定
if n < 2:
return False
for i in range(2, n + 1):
if n < i ** 2:
break
if n % i == 0:
return False
return True
def main():
X = int(eval(input()))
while True:
if isPrime(X):
print(X)
... | def isPrime(n):
# 素数判定
if n == 2:
return True
if n < 2 or n % 2 == 0:
return False
m = 3
while m * m <= n:
if n % m == 0:
return False
m += 2
return True
def main():
X = int(eval(input()))
while True:
if isPrime(X):
... | p02819 |
n=int(eval(input()))
if n==2:
print((2))
exit()
prime_list=[2]
for i in range(3,1000000,2):
if all(i%prime!=0 for prime in prime_list):
if i<n:
prime_list.append(i)
else:
print(i)
exit() | n=int(eval(input()))
if n==2:
print((2))
exit()
prime_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, 26... | p02819 |
s = int(eval(input()))
if s <= 2:
print((2))
exit()
elif s <= 3:
print((3))
exit()
elif s <= 5:
print((5))
exit()
while True:
for i in range(2,s // 2):
if s % i == 0:
break
if i == s //2 -1:
print(s)
exit()
s += 1
| ##C
X = int(eval(input()))
##素数かどうか判定
from math import sqrt
def is_prime(n):
for i in range(2, int(sqrt(n))):
if n % i == 0:
return False
else:
return True
while (not is_prime(X)):
X += 1
print(X)
| p02819 |
import sys
def input(): return sys.stdin.readline().rstrip()
def prime_list(n):
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes-=set(range(i*2, n+1, i))
return list(primes)
def main():
x=int(eval(input()))
primes = prime_list(100010)
for p in primes:
... | import sys
def input(): return sys.stdin.readline().rstrip()
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 main():
x=int(eval(input()))
while True:
if is_prime(x)==True:
... | p02819 |
n = int(eval(input()))
s = {2}
#for i in range(3, n, 2):
z = 2
i = 3
while z < n:
x = 1
for j in s:
if i % j == 0:
x = 0
break
if x:
z = i
s.add(i)
i += 2
print(z) | n = int(eval(input()))
def isprime(x):
for i in range(2, int(x**0.5), 1):
if x % i == 0:
return False
return True
i = n
while True:
if isprime(i):
break
else:
i += 1
print(i)
| p02819 |
import bisect
X = int(eval(input()))
N = [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... | 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
X=int(eval(input()))
p = X
while(not is_prime(p)):
p += 1
print(p) | p02819 |
X = int(eval(input()))
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... | X = int(eval(input()))
def is_prime(x):
flag = True
for i in range(2,int(x**(0.5))+1):
if x % i == 0:
flag = False
return flag
for i in range(X,2*X+1):
if is_prime(i):
print(i)
break | p02819 |
import sys
from collections import deque
#import numpy as np
import math
#sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return list(map(str,sys.stdin.readline().rstrip().split()))
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return list(map(int,sys.stdin.re... | import sys
from collections import deque
#import numpy as np
import math
#sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return list(map(str,sys.stdin.readline().rstrip().split()))
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return list(map(int,sys.stdin.re... | p02819 |
x = int(eval(input()))
while True:
n = 0
for i in range(2, x):
if x % i == 0:
n += 1
if n != 0:
x += 1
else:
break
print(x) | x = int(eval(input()))
while True:
judge = False
for i in range(2, x):
if x % i == 0:
judge = True
break
if judge:
x += 1
else:
break
print(x) | p02819 |
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 is_prime(n):
i = 2
while(i**2 <= n):
if n % i == 0:
return False
i += 1
return True
def main():
X = int(eval(input()))
for x in range(X, 2*X):
if is_prime(x):
print(x)
break
if __name__ == "__main__":
main()
| p02819 |
from collections import deque
X = int(eval(input()))
nums = deque([i for i in range(3, 10**5+10, 2)])
prime = 2
while prime < X:
prime = nums.popleft()
nums = deque([i for i in nums if i % prime != 0])
print(prime) | X = int(eval(input()))
def check(num):
max_div = int(num**0.5)
for div in range(2, max_div+1):
if num % div == 0:
return False
else:
return True
num = X
while True:
if check(num):
print(num)
break
num += 1 | p02819 |
from bisect import bisect_left
def get_primes(n):
prime = []
limit = n ** 0.5
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]
X = int(eval(... | X = int(eval(input()))
while any(X % i == 0 for i in range(2, int(X ** 0.5) + 1)):
X += 1
print(X) | p02819 |
def get_primes(x):
if x < 2:
return list()
primes = [2]
n = 3
while n <= x:
is_prime = True
for p in primes:
if n % p == 0:
is_prime = False
break
if p**2 > n:
break
if is_prime:
... | def is_prime(x):
if x <= 1:
return False
elif x == 2:
return True
else:
n = 2
while n**2 <= x:
if x % n == 0:
return False
n += 1
return True
def main():
X = int(eval(input()))
while True:
if i... | p02819 |
X = int(eval(input()))
Y = 0
while Y == 0:
Y = 1
for i in range(2,X-1):
Y = Y * (X % i)
X += 1
print((X-1)) | X = int(eval(input()))
Y = 0
while Y == 0:
Y = 1
for i in range(2,int(X*0.5+1)):
Y = Y * (X % i)
X += 1
print((X-1)) | p02819 |
#%%
import math
# 素数判定関数
def isPrime(num):
# 2未満の数字は素数ではない
if num < 2: return False
# 2は素数
elif num == 2: return True
# 偶数は素数ではない
elif num % 2 == 0: return False
# 3 ~ numまでループし、途中で割り切れる数があるか検索
# 途中で割り切れる場合は素数ではない
for i in range(3, math.floor(math.sqrt(num))+1, 2):
... |
#%%
import math
# 素数判定関数
def isPrime(num):
# 2未満の数字は素数ではない
if num < 2: return False
# 2は素数
elif num == 2: return True
# 偶数は素数ではない
elif num % 2 == 0: return False
# 3 ~ numまでループし、途中で割り切れる数があるか検索
# 途中で割り切れる場合は素数ではない
for i in range(3, math.floor(math.sqrt(num))+1, 2):
... | p02819 |
def is_prime(a):
if a == 2:
return True
for i in range(2, int(a**0.5)+2):
if a%i == 0:
return False
return True
X = int(eval(input()))
for i in range(X, 100004):
if is_prime(i):
print(i)
break | def is_prime(a):
for i in range(2, int(a**0.5)+1):
if a%i == 0:
return False
return True
X = int(eval(input()))
for i in range(X, 100004):
if is_prime(i):
print(i)
break | p02819 |
x=int(eval(input()))
count=0
n=1
while True:
n+=1
ans=True
for i in range(2,int(x**0.5)):
if n%i==0:
ans=False
if ans and n>=x:
print(n)
break
| x=int(eval(input()))
count=0
n=1
while True:
n+=1
ans=True
for i in range(2,int(x**0.5)):
if n%i==0:
ans=False
break
if ans and n>=x:
print(n)
break
| p02819 |
m = int(eval(input()))
if m <= 2 :
print('2')
else:
n = 10**6
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes=list(primes)
for i in range(len(primes)-1):
if primes[i] < m and m <= primes[i+1]:
print((primes[... | m = int(eval(input()))
if m <= 2 :
print('2')
else:
n = 2*10**5
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes=list(primes)
for i in range(len(primes)-1):
if primes[i] < m and m <= primes[i+1]:
print((prime... | p02819 |
def c_next_prime():
from bisect import bisect_left
X = int(eval(input()))
def prime_table(n):
"""n以下の素数のリスト(エラトステネスの篩)"""
is_prime = [True] * (n + 1)
is_prime[0] = is_prime[1] = False # 0と1は素数でない
for j in range(2, int(n**0.5) + 1):
if not is_prime[j]:
... | def c_next_prime():
from bisect import bisect_left
X = int(eval(input()))
def prime_table(n):
"""n以下の素数のリスト(エラトステネスの篩)"""
is_prime = [True] * (n + 1)
is_prime[0] = is_prime[1] = False # 0と1は素数でない
for j in range(2, int(n**0.5) + 1):
if not is_prime[j]:
... | p02819 |
import math
X = int(eval(input()))
def get_primenumber(number):
prime_list = []
#2からnumberまでの数字をsearch_listに入れる
search_list = list(range(2,number+1))
while True:
#search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(number):
#prime_listにsearch_listを結合
prime_... | import math
X = int(eval(input()))
def f(X):
if X <= 1:
return False
for i in range(2, int(math.sqrt(X))+1):
if X%i==0:
return False
return True
while not f(X):
X += 1
print(X) | p02819 |
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
n = int(read())
n_ = 5*10**5
primes = set(range(2, n_+1))
for i in range(2, int(n_**0.5+1)):
primes.difference_update(list(range(i*2, n_+1, i)... | import sys
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
n = int(read())
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
ret... | p02819 |
import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1... | import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i ==... | p02819 |
x = int(eval(input()))
num = 0
for i in range(x,x*2):
for j in range(2,x//2):
if i%j == 0:
num += 1
continue
if num == 0:
print(i)
exit(0)
num = 0 | import math
x = int(eval(input()))
for i in range(x, x * 2):
flag = True
for j in range(2, math.floor(math.sqrt(x))+1):
if i % j == 0:
flag = False
break
if flag:
print(i)
exit(0) | p02819 |
import math
x = int(eval(input()))
prms = []
n = 2
while True:
is_prm = True
for prm in prms:
if n % prm == 0:
is_prm = False
break
if is_prm:
prms.append(n)
if n >= x:
break
n += 1
print(n)
| import math
x = int(eval(input()))
prm_dict = {i: True for i in range(2, 100004)}
for n in range(2, 100004):
if prm_dict[n]:
if n >= x:
break
for nk in range(n * 2, 100004, n):
prm_dict[nk] = False
print(n)
| p02819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.