problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02819
|
n = int(input())
def p(x):
if x == 2:
return True
for i in range(x/2):
if x % i == 0:
return False
return True
for i in range(n,2*n):
if p(i):
print(i)
break
|
n = int(input())
def p(x):
if x == 2:
return True
for i in range(2,x//2):
if x % i == 0:
return False
return True
for i in range(n,2*n):
if p(i):
print(i)
break
|
[
"call.arguments.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,630
| 623,629
|
u924828749
|
python
|
p02819
|
n = int(input())
def p(x):
if x == 2:
return True
for i in range(x/2):
if x % i == 0:
return False
return True
for i in range(x,2*x):
if p(i):
print(i)
break
|
n = int(input())
def p(x):
if x == 2:
return True
for i in range(2,x//2):
if x % i == 0:
return False
return True
for i in range(n,2*n):
if p(i):
print(i)
break
|
[
"call.arguments.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"control_flow.loop.range.bounds.lower.change"
] | 623,631
| 623,629
|
u924828749
|
python
|
p02819
|
x =int(input())
n = 2*10**5
is_prime = [True]*(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
for i in range(x,n):
if is_prime[i]==True:
print(i+1)
break
|
x =int(input())
n = 2*10**5
is_prime = [True]*(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
for i in range(x-1,n):
if is_prime[i]==True:
print(i+1)
break
|
[
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.add"
] | 623,632
| 623,633
|
u498487134
|
python
|
p02819
|
import math
N = int(input())
prime = True
if N == 2:
print(2)
exit()
else:
for k in range(N+1, 110000):
prime = True
max = math.ceil(math.sqrt(k))
for i in range(2, max+1):
if k % i == 0:
prime = False
break
if prime == True:
ans = k
break
print(ans)
|
import math
N = int(input())
prime = True
if N == 2:
print(2)
exit()
else:
for k in range(N, 110000):
prime = True
max = math.ceil(math.sqrt(k))
for i in range(2, max+1):
if k % i == 0:
prime = False
break
if prime == True:
ans = k
break
print(ans)
|
[
"expression.operation.binary.remove"
] | 623,634
| 623,635
|
u159144188
|
python
|
p02819
|
import math
x=int(input())
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(math.sqrt(n)) +1):
if n % i == 0:
return False
return True
for i in range(x, 100003):
if is_prime(i):
print(i)
exit()
|
import math
x=int(input())
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(math.sqrt(n)) +1):
if n % i == 0:
return False
return True
for i in range(x, 100003+1):
if is_prime(i):
print(i)
exit()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,636
| 623,637
|
u265118937
|
python
|
p02819
|
x=int(input())
import math
def is_prime(n):
if n<=1:
return False
for i in range(2,int(math.sqrt(n) + 1)):
if n%i == 0:
return False
return True
for i in range(x+1,2*x+1):
if is_prime(i):
print(i)
exit()
|
x=int(input())
import math
def is_prime(n):
if n<=1:
return False
for i in range(2,int(math.sqrt(n) + 1)):
if n%i == 0:
return False
return True
for i in range(x,2*x+1):
if is_prime(i):
print(i)
exit()
|
[
"expression.operation.binary.remove"
] | 623,638
| 623,639
|
u244434589
|
python
|
p02819
|
isprime = [True] * 20001
def seive(n):
isprime[0] = isprime[1] = False
p = 2
while (p*p <= n):
if isprime[p]:
for i in range(p*p, n+1, p):
isprime[i] = False
p += 1
prime = [j for j in range(n) if isprime[j]]
return prime
def program():
x = int(input())
N = 10100
prime = seive(N)
for i in range(len(prime)):
if prime[i] >= x:
return prime[i]
break
print(program())
|
isprime = [True] * 100201
def seive(n):
isprime[0] = isprime[1] = False
p = 2
while (p*p <= n):
if isprime[p]:
for i in range(p*p, n+1, p):
isprime[i] = False
p += 1
prime = [j for j in range(n) if isprime[j]]
return prime
def program():
x = int(input())
N = 100200
prime = seive(N)
for i in range(len(prime)):
if prime[i] >= x:
return prime[i]
break
print(program())
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 623,640
| 623,641
|
u282813849
|
python
|
p02819
|
dp = [0 for i in range(1000000)]
N = int(input())
for i in range(2,N):
if i**2>N:
break
if dp[i]!=0:
continue
for j in range(i,N,i):
dp[j] = 1
while dp[N]!=0:
N += 1
print(N)
|
dp = [0 for i in range(1000000)]
N = int(input())
for i in range(2,1000):
if i**2>N:
break
if dp[i]!=0:
continue
for j in range(i,1000000,i):
dp[j] = 1
while dp[N]!=0:
N += 1
print(N)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,644
| 623,645
|
u845573105
|
python
|
p02819
|
x = int(input())
def pcheck(n):
for i in range(2, n):
if n % i == 0:
return True
return False
while True:
if pcheck(x) == True:
a = x
break
else:
x += 1
print(a)
|
x = int(input())
def pcheck(n):
for i in range(2, n):
if n % i == 0:
return True
return False
while True:
if pcheck(x) == False:
a = x
break
else:
x += 1
print(a)
|
[
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 623,659
| 623,660
|
u288335507
|
python
|
p02819
|
X=int(input())
if x==2:
print(2)
else:
for i in range(X,10**6):
for j in range(2,i):
if i%j==0:
break
if j==i-1:
print(i)
exit()
|
X=int(input())
if X==2:
print(2)
else:
for i in range(X,10**6):
for j in range(2,i):
if i%j==0:
break
if j==i-1:
print(i)
exit()
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 623,662
| 623,663
|
u425184437
|
python
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x+1,1000000):
if miller_rabin(i):
print(i)
return
main()
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x,1000000):
if miller_rabin(i):
print(i)
return
main()
|
[
"literal.number.integer.change",
"expression.operation.binary.remove"
] | 623,671
| 623,672
|
u762540523
|
python
|
p02819
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x+1,1000000):
if miller_rabin(i):
print(i)
return
main()
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x,1000000):
if miller_rabin(i):
print(i)
return
main()
|
[
"expression.operation.binary.remove"
] | 623,673
| 623,672
|
u762540523
|
python
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x+1,1000000):
if miller_rabin(i):
print(i)
return
main()
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x,1000000):
if miller_rabin(i):
print(i)
return
main()
|
[
"expression.operation.binary.remove"
] | 623,671
| 623,674
|
u762540523
|
python
|
p02819
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x+1,1000000):
if miller_rabin(i):
print(i)
return
main()
|
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 != n - 1 and y != 1 and y != n - 1:
y = (y * y) % n
t <<= 1
if y != n - 1 and t & 1 == 0:
return False
return True
def main():
x=int(input())
for i in range(x,1000000):
if miller_rabin(i):
print(i)
return
main()
|
[
"literal.number.integer.change",
"expression.operation.binary.remove"
] | 623,673
| 623,674
|
u762540523
|
python
|
p02819
|
x=int(input())
while True:
cnt=0
for i in (2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
else:
x+=1
continue
|
x=int(input())
while True:
cnt=0
for i in range(2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
elif cnt==1:
x+=1
continue
|
[
"call.add",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 623,675
| 623,676
|
u350093546
|
python
|
p02819
|
x=int(input())
while True:
cnt=0
for i in (2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
elif cnt==1:
x+=1
continue
|
x=int(input())
while True:
cnt=0
for i in range(2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
elif cnt==1:
x+=1
continue
|
[
"call.add",
"control_flow.loop.range.bounds.upper.change"
] | 623,677
| 623,676
|
u350093546
|
python
|
p02819
|
x=int(input())
while True:
cnt=0
for i in (2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
else:
x+=1
continue
|
x=int(input())
while True:
cnt=0
for i in range(2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
else:
x+=1
continue
|
[
"call.add",
"control_flow.loop.range.bounds.upper.change"
] | 623,675
| 623,678
|
u350093546
|
python
|
p02819
|
x=int(input())
while True:
cnt=0
for i in (2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
elif cnt==1:
x+=1
continue
|
x=int(input())
while True:
cnt=0
for i in range(2,x//2):
if x%i==0:
cnt+=1
break
if cnt==0:
print(x)
break
else:
x+=1
continue
|
[
"call.add",
"control_flow.loop.range.bounds.upper.change"
] | 623,677
| 623,678
|
u350093546
|
python
|
p02819
|
def resolve():
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(input())
while True:
if is_prime(X):
print(X)
return
else:
X += 1
return
resolve()
|
import math
def resolve():
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(input())
while True:
if is_prime(X):
print(X)
return
else:
X += 1
return
resolve()
|
[] | 623,686
| 623,685
|
u364386647
|
python
|
p02819
|
def resolve():
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(input())
while True:
if is_prime(X):
print(X)
return
else:
X += 1
return
resolve()
|
import math
def resolve():
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(input())
while True:
if is_prime(X):
print(X)
return
else:
X += 1
return
resolve()
|
[] | 623,687
| 623,685
|
u364386647
|
python
|
p02819
|
limit = 100000
import math
def resolve():
N = int(input())
for k in range(N, limit+1):
factor = 0
if k % 2 == 0 and k != 2:
continue
for divisor in range(2, math.floor(math.sqrt(k))+1):
if k % divisor == 0:
factor += 1
if factor == 0:
return k
print(resolve())
|
limit = 100003
import math
def resolve():
N = int(input())
for k in range(N, limit+1):
factor = 0
if k % 2 == 0 and k != 2:
continue
for divisor in range(2, math.floor(math.sqrt(k))+1):
if k % divisor == 0:
factor += 1
if factor == 0:
return k
print(resolve())
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 623,688
| 623,689
|
u994935583
|
python
|
p02819
|
x = int(input())
for i in range(x, 10**5):
flag = True
for j in range(2, i):
if (i % j == 0):
flag = False
continue
if flag:
print(i)
break
else:
continue
|
x = int(input())
for i in range(x, 10**5 + 4):
flag = True
for j in range(2, i):
if (i % j == 0):
flag = False
continue
if flag:
print(i)
break
else:
continue
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,696
| 623,697
|
u581403769
|
python
|
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(input())
for i in range(X, 100000):
if is_prime(i):
print(i)
break
|
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(input())
for i in range(X, 100004):
if is_prime(i):
print(i)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,698
| 623,699
|
u926412290
|
python
|
p02819
|
x = int(input())
ans = 0
if x <= 3:
i = x
else:
for i in range(x+1,2*x):
s = 0
for j in range(2,int(pow(i,0.5))+2):
if i%j == 0:
s = 1
break
if s == 0:
break
print(i)
|
x = int(input())
ans = 0
if x <= 3:
i = x
else:
for i in range(x,2*x):
s = 0
for j in range(2,int(pow(i,0.5))+1):
if i%j == 0:
s = 1
break
if s == 0:
break
print(i)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,703
| 623,704
|
u614181788
|
python
|
p02819
|
def isPrime(x):
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
n = int(input())
for i in range(n,10**5):
if isPrime(i):
print(i)
break
|
def isPrime(x):
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
n = int(input())
for i in range(n,10**6):
if isPrime(i):
print(i)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,707
| 623,708
|
u831274245
|
python
|
p02819
|
n=int(input())
def is_prime(n):
if n < 2:
return False
else:
for i in range(2, n):
if i * i > n:
break
elif n % i == 0:
return False
return True
for i in range(i,i+30):
if is_prime(i):
print(i)
|
n=int(input())
def is_prime(n):
if n < 2:
return False
else:
for i in range(2, n):
if i * i > n:
break
elif n % i == 0:
return False
return True
for i in range(n,n+400):
if is_prime(i):
print(i)
break
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"control_flow.break.add"
] | 623,711
| 623,710
|
u193927973
|
python
|
p02819
|
import sys
import math
import itertools
rl = sys.stdin.readline
x = int(rl())
while True:
if x == 2:
print(2)
break
if x % 2:
for i in range(3, 7//2, 2):
if x % i == 0:
break
else:
print(x)
break
x += 1
|
import sys
import math
import itertools
rl = sys.stdin.readline
x = int(rl())
while True:
if x == 2:
print(2)
break
if x % 2:
for i in range(3, x//2, 2):
if x % i == 0:
break
else:
print(x)
break
x += 1
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.step.change"
] | 623,722
| 623,723
|
u823885866
|
python
|
p02819
|
x = int(input())
n=2
x += 1
while n<x:
if x % n == 0:
x += 1
n = 2
else:
n+=1
print(x)
|
x = int(input())
n = 2
while n<x:
if x % n == 0:
x += 1
n = 2
else:
n+=1
print(x)
|
[] | 623,730
| 623,731
|
u566787760
|
python
|
p02819
|
# ABC149B
import numpy as np
def Eratosthenes(n):
''' n 以下の素数をエラトステネスの篩で生成 '''
tbl = np.ones(n+1, dtype=bool)
tbl[0:2] = False
for i in range(2, int(np.sqrt(n))+1):
if tbl[i]:
tbl[2*i::i] = False
return np.arange(n+1)[tbl]
x = int(input())
prime = Eratosthenes(100000)
for i, p in enumerate(prime):
if p >= x:
print(prime[i])
break
|
import numpy as np
def Eratosthenes(n):
''' n 以下の素数をエラトステネスの篩で生成 '''
tbl = np.ones(n+1, dtype=bool)
tbl[0:2] = False
for i in range(2, int(np.sqrt(n))+1):
if tbl[i]:
tbl[2*i::i] = False
return np.arange(n+1)[tbl]
x = int(input())
prime = Eratosthenes(100003)
for i, p in enumerate(prime):
if p >= x:
print(prime[i])
break
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 623,739
| 623,740
|
u437215432
|
python
|
p02819
|
X=int(input())
while True:
for x in range(2,X):
if X%x==0:
break
else:
print(x)
break
X+=1
|
X=int(input())
while True:
for x in range(2,X):
if X%x==0:
break
else:
print(X)
break
X+=1
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 623,741
| 623,742
|
u332793228
|
python
|
p02819
|
x = int(input())
def Prime(x):
if x == 2:
return False
if x % 2 == 0:
return False
else:
sqrtx = x**(1/2)
for i in range(3,int(sqrtx+1),2):
if x % i == 0:
return False
return True
while True:
if Prime(x):
print(x)
break
x+=1
|
x = int(input())
def Prime(x):
if x == 2:
return 2
if x % 2 == 0:
return False
else:
sqrtx = x**(1/2)
for i in range(3,int(sqrtx+1),2):
if x % i == 0:
return False
return True
while True:
if Prime(x):
print(x)
break
x+=1
|
[
"function.return_value.change"
] | 623,751
| 623,752
|
u079022116
|
python
|
p02819
|
# check
def is_prime(n):
if n < 2:
return False
elif n == 2:
return True
else:
for p in range(2, n):
if n % p == 0:
return False
return True
# input
X = int(input())
while is_prime(X) is True:
X += 1
else:
print(X)
|
# check
def is_prime(n):
if n < 2:
return False
elif n == 2:
return True
else:
for p in range(2, n):
if n % p == 0:
return False
else:
return True
# input
X = int(input())
while is_prime(X) is False:
X += 1
print(X)
|
[
"misc.opposites",
"control_flow.loop.condition.change"
] | 623,755
| 623,756
|
u284363684
|
python
|
p02819
|
import math
import sys
sys.setrecursionlimit(100000)
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(input())
def findPrime(x):
if is_Prime(x):
return x
else:
return findPrime(x+1)
print(findPrime(X))
|
import math
import sys
sys.setrecursionlimit(100000)
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(input())
def findPrime(x):
if is_prime(x):
return x
else:
return findPrime(x+1)
print(findPrime(X))
|
[
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 623,762
| 623,763
|
u425762225
|
python
|
p02819
|
def primelist(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
x = int(input())
list = primelist(x*2)
print(min([i for i in list if i>x]))
|
def primelist(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
x = int(input())
list = primelist(x*2)
print(min([i for i in list if i>=x]))
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 623,769
| 623,770
|
u711238850
|
python
|
p02819
|
x=int(input())
sosu=[2,3]
i=4
import math
while 1:
sqrt_i =int(math.sqrt(i))
flag=0
for item in sosu:
if item>sqrt_i:
break
if i%item==0:
flag=1
break
if flag==0:
sosu.append(i)
if i>=x:
print(i)
exit()
i+=1
|
x=int(input())
sosu=[]
i=2
import math
while 1:
sqrt_i =int(math.sqrt(i))
flag=0
for item in sosu:
if item>sqrt_i:
break
if i%item==0:
flag=1
break
if flag==0:
sosu.append(i)
if i>=x:
print(i)
exit()
i+=1
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 623,778
| 623,779
|
u588794534
|
python
|
p02819
|
X = int(input())
ans = X
flag = True
while flag == True:
flag = False
ans += 1
for i in range(2, ans):
if ans % i == 0:
flag = True
break
print(ans)
|
X = int(input())
ans = X - 1
flag = True
while flag == True:
flag = False
ans += 1
for i in range(2, ans):
if ans % i == 0:
flag = True
break
print(ans)
|
[
"assignment.change"
] | 623,789
| 623,790
|
u384476576
|
python
|
p02819
|
x=int(input())
ans=x
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
print(ans)
|
x=int(input())
ans=x-1
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
break
print(ans)
|
[
"control_flow.break.add"
] | 623,791
| 623,792
|
u039189422
|
python
|
p02819
|
x=int(input())
ans=x
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
print(ans)
|
x=int(input())
ans=x-1
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
print(ans)
|
[
"assignment.change"
] | 623,791
| 623,793
|
u039189422
|
python
|
p02819
|
from math import sqrt
def judge(num):
if num <= 2:
return False
elif num == 2:
return True
elif num % 2 == 0:
return False
else:
for i in range(3,int(sqrt(num))+1,2):
if num % i == 0:
return False
return True
s = int(input())
while(1):
if judge(s):
print(s)
break
else:
s += 1
|
from math import sqrt
def judge(num):
if num < 2:
return False
elif num == 2:
return True
elif num % 2 == 0:
return False
else:
for i in range(3,int(sqrt(num))+1,2):
if num % i == 0:
return False
return True
s = int(input())
while(1):
if judge(s):
print(s)
break
else:
s += 1
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,800
| 623,801
|
u005317312
|
python
|
p02819
|
x = int(input());
for i in range(x + 1, 10**6):
for k in range(2, i):
if i % k != 0: #割り切れない
continue;
else: #割り切れた
break;
else:
break;
print(i)
|
x = int(input());
for i in range(x, 10**6):
for k in range(2, i):
if i % k != 0: #割り切れない
continue;
else: #割り切れた
break;
else:
break;
print(i)
|
[
"expression.operation.binary.remove"
] | 623,804
| 623,805
|
u508061226
|
python
|
p02819
|
x = int(input());
for i in range(x + 1, 10**5 + 1):
for k in range(2, i):
if i % k != 0: #割り切れない
continue;
else: #割り切れた
break;
else:
break;
print(i)
|
x = int(input());
for i in range(x, 10**6):
for k in range(2, i):
if i % k != 0: #割り切れない
continue;
else: #割り切れた
break;
else:
break;
print(i)
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,806
| 623,805
|
u508061226
|
python
|
p02819
|
X=int(input())
Y=[i for i in range(100005)]
for j in range(2,333):
k=100004 // j
for a in range(2,k):
Y[a*j] = 0
b=X
while True:
if Y[b] != 0:
print(b)
break
else:
b += 1
|
X=int(input())
Y=[i for i in range(100005)]
for j in range(2,333):
k=100004 // j
for a in range(2,k+1):
Y[a*j] = 0
b=X
while True:
if Y[b] != 0:
print(b)
break
else:
b += 1
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,807
| 623,808
|
u311113280
|
python
|
p02819
|
n=int(input())
p=[i for i in range(3,n+1,2)]
p=[2]+p
prime=[2]
std=[True]*(n+1)
for i in p:
if std[i]:
if i%prime[-1]!=0:
prime.append(i)
for j in range(n//i):
std[i*j]=False
else:
continue
if n in prime:
print(n)
else:
for i in range(n):
t=n+i
for j in prime:
if t%j==0:
break
else:
print(n+i)
break
|
n=int(input())
p=[i for i in range(3,n+1,2)]
p=[2]+p
prime=[2]
std=[True]*(n+1)
for i in p:
if std[i]:
if i%prime[-1]!=0:
prime.append(i)
for j in range(n//i+1):
std[i*j]=False
else:
continue
if n in prime:
print(n)
else:
for i in range(n):
t=n+i
for j in prime:
if t%j==0:
break
else:
print(n+i)
break
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,821
| 623,822
|
u131638468
|
python
|
p02819
|
X=int(input())
flag=False
i=X
while flag==False:
flag_2=True
for j in range(2,2+int(i**0.5)):
if i%j==0:
flag_2=False
if flag_2==True:
ans=i
flag=True
i+=1
print(ans)
|
X=int(input())
flag=False
i=X
ans=0
while flag==False:
flag_2=True
for j in range(2,1+int(i**0.5)):
if i%j==0:
flag_2=False
if flag_2==True:
ans=i
flag=True
i+=1
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,829
| 623,830
|
u934740772
|
python
|
p02819
|
x=int(input())
A=10**5
pn=[2]
for L in range(3, A, 2):
if x==2:
print(2)
exit()
if all(L % L2 != 0 for L2 in pn):
pn.append(L)
if L>=x:
k=L
break
print(k)
|
x=int(input())
A=10**6
pn=[2]
for L in range(3, A, 2):
if x==2:
print(2)
exit()
if all(L % L2 != 0 for L2 in pn):
pn.append(L)
if L>=x:
k=L
break
print(k)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 623,837
| 623,838
|
u440129511
|
python
|
p02819
|
import math
X = int(input())
#素数判定
#Nが素数か True/False で返す
#O(√N)
def is_prime(N):
if N == 1:
return False
for i in range(2,N+1):
#調べるのはNの1/2乗まででよい
if i * i > N:
break
#割り切れたら素数じゃない
if N % i == 0:
return False
return True
for i in range(X,10**10):
if isPrime(i):
print(i)
break
|
import math
X = int(input())
#素数判定
#Nが素数か True/False で返す
#O(√N)
def is_prime(N):
if N == 1:
return False
for i in range(2,N+1):
#調べるのはNの1/2乗まででよい
if i * i > N:
break
#割り切れたら素数じゃない
if N % i == 0:
return False
return True
for i in range(X,10**10):
if is_prime(i):
print(i)
break
|
[
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 623,839
| 623,840
|
u750783400
|
python
|
p02819
|
import math
X = int(input())
#xが素数か判定する
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
while i <= math.sqrt(x):
if x % i == 0:
return False
i += 2
return True
for i in range(X+1,10**5):
if isPrime(i):
print(i)
break
|
import math
X = int(input())
#xが素数か判定する
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
while i <= math.sqrt(x):
if x % i == 0:
return False
i += 2
return True
for i in range(X,10**10):
if isPrime(i):
print(i)
break
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,841
| 623,842
|
u750783400
|
python
|
p02819
|
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
x=int(input())
l=primes(100010)
for i in range(len(l)):
if l[i]>x:
print(l[i])
exit()
|
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
x=int(input())
l=primes(100010)
for i in range(len(l)):
if l[i]>=x:
print(l[i])
exit()
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,843
| 623,844
|
u024782094
|
python
|
p02819
|
x=int(input())
def is_prime(c):
for i in range(2,int(c**(1/2))+2):
if c%i==0:
return False
return True
for i in range(x,100004):
if is_prime(i)==False:
pass
else:
print(i)
break
|
x=int(input())
def is_prime(c):
for i in range(2,int(c**(1/2))+2):
if c%i==0 and c!=2:
return False
return True
for i in range(x,100004):
if is_prime(i)==False:
pass
else:
print(i)
break
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 623,860
| 623,861
|
u884601206
|
python
|
p02819
|
x=int(input())
def is_prime(c):
for i in range(2,int(c**(1/2))+2):
if c%i==0:
return False
return True
for i in range(x,10004):
if is_prime(i)==False:
pass
else:
print(i)
break
|
x=int(input())
def is_prime(c):
for i in range(2,int(c**(1/2))+2):
if c%i==0 and c!=2:
return False
return True
for i in range(x,100004):
if is_prime(i)==False:
pass
else:
print(i)
break
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,862
| 623,861
|
u884601206
|
python
|
p02819
|
X=int(input())
for i in range(X+1,X*2):
ok=0
for j in range(2,i):
if i%j == 0:
ok += 1
if ok == 0:
print(i)
break
|
X=int(input())
for i in range(X,X*2):
ok=0
for j in range(2,i):
if i%j == 0:
ok += 1
if ok == 0:
print(i)
break
|
[
"expression.operation.binary.remove"
] | 623,867
| 623,866
|
u216752093
|
python
|
p02819
|
x = int(input())
is_prime = [True] * (10**5+1) #全部Trueに
is_prime[0] = False
is_prime[1] = False
for i in range(2,int(10**2.5)+1):
if is_prime[i]:
for j in range(i * 2, 10**5 + 1, i):
is_prime[j] = False
while True:
if is_prime[x]:
break
x+=1
print(x)
|
x = int(input())
is_prime = [True] * (10**6+1) #全部Trueに
is_prime[0] = False
is_prime[1] = False
for i in range(2,int(10**3)+1):
if is_prime[i]:
for j in range(i * 2, 10**6 + 1, i):
is_prime[j] = False
while True:
if is_prime[x]:
break
x+=1
print(x)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.step.change"
] | 623,874
| 623,875
|
u974745064
|
python
|
p02819
|
def Sieve_of_Eratosthenes(N):
if N<2:
prime = [False for i in range(N+1)]
return prime
prime = [True for i in range(N+1)]
prime[0] = False
prime[1] = False
for i in range(2, int(N**0.5)+1):
if prime[i]:
for j in range(i*2, N+1, i):
prime[j] = False
return prime
prime=Sieve_of_Eratosthenes(10**5)
x=int(input())
while prime[x]==False:
x+=1
print(x)
|
def Sieve_of_Eratosthenes(N):
if N<2:
prime = [False for i in range(N+1)]
return prime
prime = [True for i in range(N+1)]
prime[0] = False
prime[1] = False
for i in range(2, int(N**0.5)+1):
if prime[i]:
for j in range(i*2, N+1, i):
prime[j] = False
return prime
prime=Sieve_of_Eratosthenes(10**5+5)
x=int(input())
while prime[x]==False:
x+=1
print(x)
|
[
"assignment.change"
] | 623,883
| 623,884
|
u197300773
|
python
|
p02819
|
x = int(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):
# 既にfalseになってたらスキップ
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_ls = primes(10**5 + 3)
r = len(prime_ls)- 1
l = 0
while r - l > 1:
m = (r + l) // 2
if prime_ls[m] >= x:
r = m
else:
l = m
print(prime_ls[r])
|
x = int(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):
# 既にfalseになってたらスキップ
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_ls = primes(10**5 + 3)
r = len(prime_ls)- 1
l = -1
while r - l > 1:
m = (r + l) // 2
if prime_ls[m] >= x:
r = m
else:
l = m
print(prime_ls[r])
|
[
"assignment.value.change",
"expression.operation.unary.add"
] | 623,889
| 623,890
|
u192154323
|
python
|
p02819
|
import sys
input = sys.stdin.readline
x = int(input())
prime = [True] * (100004)
prime[2] = True
def e_prime(x):
i = 2
flag = False
if(i==x):flag=True
while True:
if prime[i]:
if(flag==True):
return i
else:
for j in range(i**2,len(prime),i):
prime[j]=False
i+=1
print(e_prime(x))
|
import sys
input = sys.stdin.readline
x = int(input())
prime = [True] * (100004)
prime[2] = True
def e_prime(x):
i = 2
flag = False
while True:
if(i==x):flag=True
if prime[i]:
if(flag==True):
return i
else:
for j in range(i**2,len(prime),i):
prime[j]=False
i+=1
print(e_prime(x))
|
[] | 623,891
| 623,892
|
u624696727
|
python
|
p02819
|
def check_prime(m):
prime_flag = 1
counter = 1
while counter **2 <= m:
if not m%counter:
prime_flag = 0
break
return prima_flag
n = int(input())
for i in range(n, 10**6):
if check_prime(i):
print(i)
break
|
def check_prime(m):
prime_flag = 1
counter = 2
while counter **2 <= m:
if not m%counter:
prime_flag = 0
break
counter += 1
return prime_flag
n = int(input())
for i in range(n, 10**6):
if check_prime(i):
print(i)
break
|
[
"literal.number.integer.change",
"assignment.value.change",
"identifier.change",
"function.return_value.change"
] | 623,900
| 623,901
|
u667084803
|
python
|
p02819
|
import math
x = int(input())
while True:
ok = True
for j in range(2, int(math.sqrt(x+1)+2)+2):
if x % j == 0:
ok = False
if ok:
print(x)
exit()
x += 1
|
import math
x = int(input())
while True:
ok = True
for j in range(2, int(math.sqrt(x))+1):
if x % j == 0:
ok = False
if ok:
print(x)
exit()
x += 1
|
[
"call.arguments.add",
"call.arguments.change"
] | 623,902
| 623,903
|
u745812846
|
python
|
p02819
|
def ifPrine(n):
if n <= 1:
return False
elif n == 2 or n == 3:
return True
else:
i = 2
while i*i <= n:
if n % i == 0:
return True
else:
i += 1
return False
x = int(input())
q = 0
while q < 100000:
if ifPrine(x+q) == False:
print(x+q)
break
else:
q += 1
|
def ifPrine(n):
if n <= 1:
return True
elif n == 2 or n == 3:
return False
else:
i = 2
while i*i <= n:
if n % i == 0:
return True
else:
i += 1
return False
x = int(input())
q = 0
while q < 100000:
if ifPrine(x+q) == False:
print(x+q)
break
else:
q += 1
|
[
"misc.opposites",
"function.return_value.change"
] | 623,907
| 623,908
|
u000349418
|
python
|
p02819
|
import math
def prime_number(j):
if j == 1: return False
for i in range(2,int(math.sqrt(j)) + 1):
if j % i == 0:
return False
return True
x = int(input())
for j in range(x,10**5 + 1):
if prime_number(j) and x <= j:
print(j)
break
|
import math
def prime_number(j):
if j == 1: return False
for i in range(2,int(math.sqrt(j)) + 1):
if j % i == 0:
return False
return True
x = int(input())
for j in range(x,10**6):
if prime_number(j) and x <= j:
print(j)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 623,911
| 623,912
|
u045953894
|
python
|
p02819
|
import sys
input = sys.stdin.readline
X = int(input())
Num = X+1
while any(Num%i==0 for i in range(2,Num)):
Num += 1
print(Num)
|
import sys
input = sys.stdin.readline
X = int(input())
Num = X
while any(Num%i==0 for i in range(2,Num)):
Num += 1
print(Num)
|
[
"expression.operation.binary.remove"
] | 623,915
| 623,916
|
u656391577
|
python
|
p02819
|
import math
from sys import exit
X = int(input())
while True:
for i in range(2, math.floor(math.sqrt(X) + 1)):
flag = True
if X % i == 0:
flag = False
break
if flag:
print(X)
exit()
X += 1
|
import math
from sys import exit
X = int(input())
while True:
flag = True
for i in range(2, math.floor(math.sqrt(X) + 1)):
if X % i == 0:
flag = False
break
if flag:
print(X)
exit()
X += 1
|
[
"assignment.add",
"assignment.remove"
] | 623,917
| 623,918
|
u219417113
|
python
|
p02819
|
def resolve():
n = int(input())
if n==2:
print("2")
for j in range(10000):
flag = 1
a = int((n+j)**0.5)+1
for i in range(2, a+1):
if (n+j) % i== 0:
flag = -1
if i == a and flag ==1:
print(n+j)
exit()
resolve()
|
def resolve():
n = int(input())
if n==2:
print("2")
exit()
for j in range(10000):
flag = 1
a = int((n+j)**0.5)+1
for i in range(2, a+1):
if (n+j) % i== 0:
flag = -1
if i == a and flag ==1:
print(n+j)
exit()
resolve()
|
[
"call.add"
] | 623,923
| 623,924
|
u793868662
|
python
|
p02819
|
def resolve():
n = int(input())
if n==2:
print("2")
for j in range(10000):
flag = 1
a = int((n+j)**0.5)+1
for i in range(2, a+1):
if (n+i) % j == 0:
flag = -1
if i == a and flag ==1:
print(n+j)
exit()
resolve()
|
def resolve():
n = int(input())
if n==2:
print("2")
exit()
for j in range(10000):
flag = 1
a = int((n+j)**0.5)+1
for i in range(2, a+1):
if (n+j) % i== 0:
flag = -1
if i == a and flag ==1:
print(n+j)
exit()
resolve()
|
[
"call.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 623,925
| 623,924
|
u793868662
|
python
|
p02819
|
n=int(input())
m=10**5+4
for i in range(n,m):
lst=[]
if all(( i % j) !=0 for j in range(2,int(n**0.5//1+1))):
print(i,j)
break
|
n=int(input())
m=10**5+4
for i in range(n,m):
lst=[]
if all(( i % j) !=0 for j in range(2,int(n**0.5//1+1))):
print(i)
break
|
[
"call.arguments.change"
] | 623,928
| 623,929
|
u123745130
|
python
|
p02819
|
X = int(input())
def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
for i in range(X+1, 10 ** 7):
if is_prime(i):
print(i)
break
|
X = int(input())
def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
for i in range(X, 10 ** 7):
if is_prime(i):
print(i)
break
|
[
"expression.operation.binary.remove"
] | 623,934
| 623,935
|
u411858517
|
python
|
p02819
|
X = int(input())
def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
for i in range(X+1, 10 ** 6):
if is_prime(i):
print(i)
break
|
X = int(input())
def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
for i in range(X, 10 ** 7):
if is_prime(i):
print(i)
break
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,936
| 623,935
|
u411858517
|
python
|
p02819
|
from math import sqrt
x = int(input()) - 1
pnums = []
if x >= 4:
for i in range(2, int(sqrt(x))+1):
for j in pnums:
if i % j == 0:
break
else:
pnums.append(i)
while True:
x += 1
x_sqrt = sqrt(x)
if x_sqrt.is_integer():
pnums.append(x_sqrt)
break
for a in pnums:
if x % a == 0:
break
else:
print(x)
break
|
from math import sqrt
x = int(input()) - 1
pnums = []
if x >= 4:
for i in range(2, int(sqrt(x))+1):
for j in pnums:
if i % j == 0:
break
else:
pnums.append(i)
while True:
x += 1
x_sqrt = sqrt(x)
if x_sqrt.is_integer():
pnums.append(x_sqrt)
continue
for a in pnums:
if x % a == 0:
break
else:
print(x)
break
|
[
"control_flow.break.remove",
"control_flow.continue.add"
] | 623,937
| 623,938
|
u040442732
|
python
|
p02819
|
x = int(input())
ps = set(range(x + 1, 4 * x + 1))
for i in range(2, x+1):
for j in range(0, 4 * x + 1, i):
if j in ps:
ps.remove(j)
print(min(ps))
|
x = int(input())
ps = set(range(x, 4 * x + 1))
for i in range(2, x):
for j in range(0, 4 * x + 1, i):
if j in ps:
ps.remove(j)
print(min(ps))
|
[
"expression.operation.binary.remove"
] | 623,939
| 623,940
|
u558242240
|
python
|
p02819
|
x = int(input())
ps = set(range(x + 1, 2 * x + 1))
for i in range(2, x+1):
for j in range(0, 2 * x + 1, i):
if j in ps:
ps.remove(j)
print(min(ps))
|
x = int(input())
ps = set(range(x, 4 * x + 1))
for i in range(2, x):
for j in range(0, 4 * x + 1, i):
if j in ps:
ps.remove(j)
print(min(ps))
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.step.change"
] | 623,941
| 623,940
|
u558242240
|
python
|
p02819
|
x=int(input())
if x==2:
print(2)
exit()
for i in range(x+1,x*100):
for j in range(2,int(x**0.5)+2):
if i%j==0:
break
else:
print(i)
exit()
|
x=int(input())
if x==2:
print(2)
exit()
for i in range(x,x*100):
for j in range(2,int(x**0.5)+2):
if i%j==0:
break
else:
print(i)
exit()
|
[
"expression.operation.binary.remove"
] | 623,948
| 623,949
|
u547167033
|
python
|
p02819
|
x=int(input())
if x==2:
print(2)
exit()
for i in range(x+1,x*10):
for j in range(2,int(x**0.5)+1):
if i%j==0:
break
else:
print(i)
exit()
|
x=int(input())
if x==2:
print(2)
exit()
for i in range(x,x*100):
for j in range(2,int(x**0.5)+2):
if i%j==0:
break
else:
print(i)
exit()
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,950
| 623,949
|
u547167033
|
python
|
p02819
|
import math
def is_sosuu(X):
# 2以外の偶数は素数ではないので無視する
if X % 2 == 0:
return False
# 繰り返しの上限を対象の平方根にする
limit = int(math.sqrt(X)) + 1
# ２の倍数を省く
numbers = [i for i in range(3, limit) if i % 2 == 1]
for i in numbers:
if X % i == 0:
return False
return True
N = int(input())
while True:
if is_sosuu(N):
print(N)
break
N+=1
|
import math
def is_sosuu(X):
# 2以外の偶数は素数ではないので無視する
if X % 2 == 0 and N != 2:
return False
# 繰り返しの上限を対象の平方根にする
limit = int(math.sqrt(X)) + 1
# ２の倍数を省く
numbers = [i for i in range(3, limit) if i % 2 == 1]
for i in numbers:
if X % i == 0:
return False
return True
N = int(input())
while True:
if is_sosuu(N):
print(N)
break
N+=1
|
[
"control_flow.branch.if.condition.change"
] | 623,951
| 623,952
|
u871303155
|
python
|
p02819
|
import sys
x=int(input())
for i in range(x,2*x+1):
for j in range(2,i**0.5+1):
if i%j==0:
break
else:
print(j)
sys.exit()
|
import sys
x=int(input())
for i in range(x,2*x+1):
for j in range(2,int(i**0.5)+1):
if i%j==0:
break
else:
print(i)
sys.exit()
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"io.output.change"
] | 623,955
| 623,956
|
u440161695
|
python
|
p02819
|
import math
x = int(input()) + 1
ans = -1
def is_prime(n):
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
while is_prime(x) == False:
x += 1
print(x)
|
import math
x = int(input())
def is_prime(n):
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
while is_prime(x) == False:
x += 1
print(x)
|
[
"expression.operation.binary.remove"
] | 623,962
| 623,963
|
u011062360
|
python
|
p02819
|
X = int(input())
prime = [0] * (2 * X)
for i in range(2, 2 * X):
if prime[i] == 0:
for j in range(2, (2 * X) // i):
prime[j * i] = 1
else:
continue
for i in range(X+1, 2 * X):
if prime[i] == 0:
print(i)
break
|
X = int(input())
prime = [0] * (2 * X)
for i in range(2, 2 * X):
if prime[i] == 0:
for j in range(2, (2 * X) // i):
prime[j * i] = 1
else:
continue
for i in range(X, 2 * X):
if prime[i] == 0:
print(i)
break
|
[
"expression.operation.binary.remove"
] | 623,964
| 623,965
|
u137913818
|
python
|
p02819
|
X=int(input())
n = 200000
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)
for i in range(len(primes)-1):
if X==2:
print("2")
elif (primes[i]<X)and(X<=primes[i+1]):
print(primes[i+1])
|
X=int(input())
n = 200000
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)
for i in range(len(primes)-1):
if X==2:
print("2")
break
elif (primes[i]<X)and(X<=primes[i+1]):
print(primes[i+1])
break
|
[
"control_flow.break.add"
] | 623,970
| 623,971
|
u995004106
|
python
|
p02819
|
X = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
while 1:
if len(make_divisors(X)) == 2:
break
X += 1
|
X = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
while 1:
if len(make_divisors(X)) == 2:
break
X += 1
print(X)
|
[
"call.add"
] | 623,972
| 623,973
|
u224353074
|
python
|
p02819
|
import sys
import socket
hostname = socket.gethostname()
if hostname == 'F451C':
sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
X = read_int()
n = 10 ** 5
for i in range(X, n):
is_prime = True
for d in range(2, X):
if i % d == 0:
is_prime = False
if is_prime:
print(i)
break
main()
|
import sys
import socket
hostname = socket.gethostname()
if hostname == 'F451C':
sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main():
X = read_int()
n = 10 ** 6
for i in range(X, n):
is_prime = True
for d in range(2, X):
if i % d == 0:
is_prime = False
if is_prime:
print(i)
break
main()
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 623,986
| 623,987
|
u163703551
|
python
|
p02819
|
import sys
import bisect
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
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_list.extend(search_list)
break
else:
#search_listの先頭をprime_listに入れる
head_num = search_list[0]
prime_list.append(head_num)
#search_listの先頭をpopする
search_list.pop(0)
#head_numの倍数を取り除く
search_list = [num for num in search_list if num % head_num != 0]
return prime_list
X = ni()
l = get_primenumber(10 ** 5)
idx = bisect.bisect_left(l, X)
print(l[idx])
|
import sys
import bisect
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
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_list.extend(search_list)
break
else:
#search_listの先頭をprime_listに入れる
head_num = search_list[0]
prime_list.append(head_num)
#search_listの先頭をpopする
search_list.pop(0)
#head_numの倍数を取り除く
search_list = [num for num in search_list if num % head_num != 0]
return prime_list
X = ni()
l = get_primenumber(10 ** 5 +10)
idx = bisect.bisect_left(l, X)
print(l[idx])
|
[
"assignment.change"
] | 623,988
| 623,989
|
u177411511
|
python
|
p02819
|
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(input())
min_prime = 2
for i in range(x, 100000):
if is_prime(i) is True:
min_prime = i
break
print(min_prime)
|
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(input())
min_prime = 2
for i in range(x, 100005):
if is_prime(i) is True:
min_prime = i
break
print(min_prime)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,992
| 623,993
|
u706330549
|
python
|
p02819
|
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(input())
min_prime = 2
for i in range(x, 100000):
if is_prime(i) is True:
min_prime = i
break
print(min_prime)
|
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(input())
min_prime = 2
for i in range(x, 10 ** 6):
if is_prime(i) is True:
min_prime = i
break
print(min_prime)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,992
| 623,994
|
u706330549
|
python
|
p02819
|
def prime_list_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:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
def prime_list_eratosthenes_from(n_from, n_to):
from bisect import bisect_left
data = prime_list_eratosthenes(n_to)
i = bisect_left(data, n_from)
return data[i:]
x = int(input())
d = prime_list_eratosthenes_from(x, 100000)
print(d[0])
|
def prime_list_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:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
def prime_list_eratosthenes_from(n_from, n_to):
from bisect import bisect_left
data = prime_list_eratosthenes(n_to)
i = bisect_left(data, n_from)
return data[i:]
x = int(input())
d = prime_list_eratosthenes_from(x, 1000000)
print(d[0])
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 623,995
| 623,996
|
u073549161
|
python
|
p02819
|
X=int(input())
b=X**0.5
if all(X%i!=0 for i in range(2,int(b)+1)):
X+=1
else:
print(X)
|
X=int(input())
b=X**0.5
while any(X%i==0 for i in range(2,int(b)+1)):
X+=1
else:
print(X)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,006
| 624,007
|
u135116520
|
python
|
p02819
|
x = int(input())
# エラトステネスの篩
def Eratosthenes(n):
if n < 2:
return None
prime = [2]
limit = math.ceil(n**0.5)
data = list(range(3, n+1, 2))
p = -1
while p < limit:
p = data[0]
prime.append(p)
data = [d for d in data if d%p != 0]
return prime + data
prime = Eratosthenes(10**5+3)
if x in prime:
print(x)
else:
import bisect
min_prime_index = bisect.bisect_right(prime, x)
print(prime[min_prime_index])
|
import math
x = int(input())
# エラトステネスの篩
def Eratosthenes(n):
if n < 2:
return None
prime = [2]
limit = math.ceil(n**0.5)
data = list(range(3, n+1, 2))
p = -1
while p < limit:
p = data[0]
prime.append(p)
data = [d for d in data if d%p != 0]
return prime + data
prime = Eratosthenes(10**5+3)
if x in prime:
print(x)
else:
import bisect
min_prime_index = bisect.bisect_right(prime, x)
print(prime[min_prime_index])
|
[] | 624,017
| 624,018
|
u746849814
|
python
|
p02819
|
import math
def check(x):
if x <= 1:
return 0
k = int(math.sqrt(x))
for i in range(2, k+1):
if x % i == 0:
return 0
return 1
n = int(input())
n += 1
while check(n) == 0:
n += 1
print(n)
|
import math
def check(x):
if x <= 1:
return 0
k = int(math.sqrt(x))
for i in range(2, k+1):
if x % i == 0:
return 0
return 1
n = int(input())
while check(n) == 0:
n += 1
print(n)
|
[] | 624,021
| 624,022
|
u929585607
|
python
|
p02819
|
X = int(input())
while True:
for i in range(2, X):
if X % i == 0:
print(i)
break
else:
break
X += 1
print(X)
|
X = int(input())
while True:
for i in range(2, X):
if X % i == 0:
break
else:
break
X += 1
print(X)
|
[
"call.remove"
] | 624,032
| 624,033
|
u690037900
|
python
|
p02819
|
import numpy as np
def prime():
a = np.ones(100000)
t = []
for i in range(2,100000):
if a[i] == 0:
continue
t.append(i)
j=i+i
while j < 100000:
a[j] = 0
j = j + i
for i in range(int(input()),100000):
if i in t:
print(i)
break
prime()
|
import numpy as np
def prime():
a = np.ones(110000)
t = []
for i in range(2,110000):
if a[i] == 0:
continue
t.append(i)
j=i+i
while j < 110000:
a[j] = 0
j = j + i
for i in range(int(input()),110000):
if i in t:
print(i)
break
prime()
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.condition.change"
] | 624,034
| 624,035
|
u341855122
|
python
|
p02819
|
def is_prime(n):
if n == 1:
return False
i = 2
while True:
if i ** 2 >= n:
return True
if n % i == 0:
return False
i += 1
x = int(input())
for i in range(x+1, x ** 2):
if is_prime(i):
print(i)
break
|
def is_prime(n):
if n == 1:
return False
i = 2
while True:
if i ** 2 >= n:
return True
if n % i == 0:
return False
i += 1
x = int(input())
for i in range(x, x ** 2):
if is_prime(i):
print(i)
break
|
[
"expression.operation.binary.remove"
] | 624,036
| 624,037
|
u690357343
|
python
|
p02819
|
x = int(input())
while True:
c = 0
for i in range(2, x+1):
if x % i == 0:
c += 1
if cnt == 1:
print(x)
exit()
else:
x += 1
|
x = int(input())
while True:
c = 0
for i in range(2, x+1):
if x % i == 0:
c += 1
if c == 1:
print(x)
exit()
else:
x += 1
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 624,044
| 624,045
|
u603324902
|
python
|
p02819
|
from bisect import bisect_left
def get_prime_list(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
X = int(input())
primes = get_prime_list(100100)
print(bisect_left(primes, X))
|
from bisect import bisect_left
def get_prime_list(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
X = int(input())
primes = get_prime_list(100100)
print(primes[bisect_left(primes, X)])
|
[
"call.arguments.change"
] | 624,054
| 624,055
|
u690536347
|
python
|
p02819
|
x=int(input())
if(x%2==0):
a=x/2
else:
a=x//2+1
y=2*a+1
import math
def is_prime(n):
for i in range(2,int(math.sqrt(n))+1):
if n%i==0:
return False
return True
while(True):
if(is_prime(y)):
break
y=y+2
if x==2:
y = 2
print(str(int(y)))
|
x=int(input())
if(x%2==0):
a=x/2
else:
a=x//2
y=2*a+1
import math
def is_prime(n):
for i in range(2,int(math.sqrt(n))+1):
if n%i==0:
return False
return True
while(True):
if(is_prime(y)):
break
y=y+2
if(x==2):
y=2
print(str(int(y)))
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 624,060
| 624,061
|
u638720739
|
python
|
p02819
|
x=int(input())
if(x%2==0):
a=x/2
else:
a=x//2+1
y=2*a+1
import math
def is_prime(n):
for i in range(3,int(math.sqrt(n))+1):
if n%i==0:
return False
return True
while(True):
if(is_prime(y)):
break
y=y+2
if x==2:
y = 2
print(str(int(y)))
|
x=int(input())
if(x%2==0):
a=x/2
else:
a=x//2
y=2*a+1
import math
def is_prime(n):
for i in range(2,int(math.sqrt(n))+1):
if n%i==0:
return False
return True
while(True):
if(is_prime(y)):
break
y=y+2
if(x==2):
y=2
print(str(int(y)))
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.branch.if.condition.change"
] | 624,062
| 624,061
|
u638720739
|
python
|
p02819
|
import math
X = int(input())
x=int(math.sqrt(X))
for i in range(X,100001):
c=0
for j in range(2,x+1):
if i%j != 0:
continue
else:
c=1
break
if c==0:
print(i)
break
|
import math
X = int(input())
x=int(math.sqrt(X))
for i in range(X,200001):
c=0
for j in range(2,x+1):
if i%j != 0:
continue
else:
c=1
break
if c==0:
print(i)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,093
| 624,094
|
u880911340
|
python
|
p02819
|
def judge_prime(num):
FLAG = True
for i in range(2, int(np.sqrt(num))+1):
if (num%i == 0):
FLAG = False
if (num == 2):
FLAG = True
return(FLAG)
X = int(input())
while (True):
flag = judge_prime(X)
if (flag):
break
X += 1
print(X)
|
import numpy as np
def judge_prime(num):
FLAG = True
for i in range(2, int(np.sqrt(num))+1):
if (num%i == 0):
FLAG = False
if (num == 2):
FLAG = True
return(FLAG)
X = int(input())
while (True):
flag = judge_prime(X)
if (flag):
break
X += 1
print(X)
|
[] | 624,095
| 624,096
|
u015593272
|
python
|
p02819
|
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
n = int(input())
for i in range(n, 10**5+1):
if is_prime(i):
print(i)
exit()
|
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
n = int(input())
for i in range(n, 10**6):
if is_prime(i):
print(i)
exit()
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 624,097
| 624,098
|
u253952966
|
python
|
p02819
|
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
n = int(input())
for i in range(n, 10**5+1):
if is_prime(n):
print(n)
exit()
|
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
n = int(input())
for i in range(n, 10**6):
if is_prime(i):
print(i)
exit()
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 624,099
| 624,098
|
u253952966
|
python
|
p02819
|
x=int(input())
while(x%i<1 for i in range(2,x)):
x+=1
break
print(x)
|
x = int(input())
while any(x % i < 1 for i in range(2, x)):
x += 1
print(x)
|
[
"call.add",
"control_flow.loop.condition.change",
"control_flow.break.remove"
] | 624,104
| 624,103
|
u269724549
|
python
|
p02819
|
from math import sqrt
X = int(input())
flag = 0
if(X == 1):
print(2)
else:
ans = X
while(flag == 0):
for i in range(int(sqrt(ans))):
if(ans % (i + 2) == 0):
ans += 1
flag = 0
break
flag = 1
print(ans)
|
from math import sqrt
X = int(input())
flag = 0
if(X == 1 or X == 2):
print(2)
else:
ans = X
while(flag == 0):
for i in range(int(sqrt(ans))):
if(ans % (i + 2) == 0):
ans += 1
flag = 0
break
flag = 1
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 624,105
| 624,106
|
u383025592
|
python
|
p02819
|
x = int(input())
while True:
for i in range(2, int(x**0.5)+1):
if x%i==0:
x += 1
break
print(x)
break
|
x = int(input())
while True:
for i in range(2, int(x**0.5)+1):
if x%i==0:
x += 1
break
else:
print(x)
break
|
[] | 624,109
| 624,110
|
u218071226
|
python
|
p02819
|
x = int(input())
while True:
for i in range(2, x**0.5+1):
if x%i==0:
x += 1
break
print(x)
break
|
x = int(input())
while True:
for i in range(2, int(x**0.5)+1):
if x%i==0:
x += 1
break
else:
print(x)
break
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,111
| 624,110
|
u218071226
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.