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())
if n == 2:
print(2)
exit()
for i in range(n+1, 10**6):
for p in range(2, i):
if i % p == 0:
break
elif i-1 == p:
print(i)
exit()
|
n = int(input())
if n == 2:
print(2)
exit()
for i in range(n, 10**6):
for p in range(2, i):
if i % p == 0:
break
elif i-1 == p:
print(i)
exit()
|
[
"expression.operation.binary.remove"
] | 624,116
| 624,117
|
u327532412
|
python
|
p02819
|
import math
array=[2]
for i in range(3,100003,2):
prime=True
for n in range(len(array)):
if array[n] > math.sqrt(i):
break
if i % array[n] == 0:
prime = False
break
if prime:
array.append(i)
l=int(input())
for m in range(len(array)):
if l>array[m]:
pass
else:
print(array[m])
break
|
import math
array=[2]
for i in range(3,100004,2):
prime=True
for n in range(len(array)):
if array[n] > math.sqrt(i):
break
if i % array[n] == 0:
prime = False
break
if prime:
array.append(i)
l=int(input())
for m in range(len(array)):
if l>array[m]:
pass
else:
print(array[m])
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,118
| 624,119
|
u969708860
|
python
|
p02819
|
n = int(input())
x = 10**6
li = [True for i in range(x)]
li[0] = False
li[1] = False
for i in range(int(x**0.5)+1):
if li[i]:
m = 2
while(i*m<=x):
li[i*m] = False
m += 1
#print(li)
for i in range(x):
if i>=n and li[i]:
print(i)
break
|
n = int(input())
x = 10**6
li = [True for i in range(x+10)]
li[0] = False
li[1] = False
for i in range(int(x**0.5)+1):
if li[i]:
m = 2
while(i*m<=x):
li[i*m] = False
m += 1
#print(li)
for i in range(x):
if i>=n and li[i]:
print(i)
break
|
[
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 624,121
| 624,122
|
u626468554
|
python
|
p02819
|
n = int(input())
x = 10**6
li = [True for i in range(x)]
li[0] = False
li[1] = False
for i in range(int(x**0.5)+1):
if li[i]:
m = 2
while(i*m<x):
li[i*m] = False
m += 1
#print(li)
for i in range(x):
if i>n and li[i]:
print(i)
break
|
n = int(input())
x = 10**6
li = [True for i in range(x+10)]
li[0] = False
li[1] = False
for i in range(int(x**0.5)+1):
if li[i]:
m = 2
while(i*m<=x):
li[i*m] = False
m += 1
#print(li)
for i in range(x):
if i>=n and li[i]:
print(i)
break
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 624,123
| 624,122
|
u626468554
|
python
|
p02819
|
x = int(input())
x += 1
while True:
xs = [i for i in range(1, x + 1) if x % i == 0]
if len(xs) == 2:
break
x += 1
print(x)
|
x = int(input())
while True:
xs = [i for i in range(1, x + 1) if x % i == 0]
if len(xs) == 2:
break
x += 1
print(x)
|
[] | 624,124
| 624,125
|
u138781768
|
python
|
p02819
|
# Primality test
import numpy as np
n = 100003 # limit
primes = np.ones((n + 1,), dtype=int)
primes[0] = 0
primes[1] = 0
primes[2*2::2] = 0
primes[3*2::3] = 0
m = 5
l = n ** 0.5
while m <= l:
if primes[m]:
primes[m * 2::m] = 0
if m % 6 == 5:
m += 2
else:
m += 4
primes = primes.nonzero()[0]
# solve
X = int(input())
idx = np.where(primes > X)[0][0]
print(primes[idx])
|
# Primality test
import numpy as np
n = 100003 # limit
primes = np.ones((n + 1,), dtype=int)
primes[0] = 0
primes[1] = 0
primes[2*2::2] = 0
primes[3*2::3] = 0
m = 5
l = n ** 0.5
while m <= l:
if primes[m]:
primes[m * 2::m] = 0
if m % 6 == 5:
m += 2
else:
m += 4
primes = primes.nonzero()[0]
# solve
X = int(input())
idx = np.where(primes >= X)[0][0]
print(primes[idx])
|
[
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 624,132
| 624,133
|
u816488327
|
python
|
p02819
|
a = [True]*110000
n = 100000
for i in range(2, int(n**0.5) + 1):
if a[i]:
for i in range(i*i, n, i):
a[i] = False
s = int(input())
ans = None
start = s
while not a[start] :
start += 1
print(start)
|
a = [True]*110000
n = 110000
for i in range(2, int(n**0.5) + 1):
if a[i]:
for i in range(i*i, n, i):
a[i] = False
s = int(input())
ans = None
start = s
while not a[start] :
start += 1
print(start)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 624,138
| 624,139
|
u585613332
|
python
|
p02819
|
def makePrimeChecker(n):
isPrime = [True] * (n + 1)
isPrime[0] = False
isPrime[1] = False
for i in range(2, int(n ** 0.5) + 1):
if isPrime[i]:
for j in range(i * i, n + 1, i):
isPrime[j] = False
return isPrime
def main():
N = int(input())
ls = makePrimeChecker(10**6)
for i in range(N+1,10**6+1):
if ls[i]:
print(i)
exit()
if __name__ == '__main__':
main()
|
def makePrimeChecker(n):
isPrime = [True] * (n + 1)
isPrime[0] = False
isPrime[1] = False
for i in range(2, int(n ** 0.5) + 1):
if isPrime[i]:
for j in range(i * i, n + 1, i):
isPrime[j] = False
return isPrime
def main():
N = int(input())
ls = makePrimeChecker(10**6)
for i in range(N,10**6+1):
if ls[i]:
print(i)
exit()
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove"
] | 624,147
| 624,148
|
u172111219
|
python
|
p02819
|
x = int(input())
import bisect
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
primess = primes(x)
index = bisect.bisect_left(primess,x)
print(primess[index])
|
x = int(input())
import bisect
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
primess = primes(100010)
idx = bisect.bisect_left(primess,x)
print(primess[idx])
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 624,171
| 624,172
|
u793666115
|
python
|
p02819
|
def primes(n):
bool_arr = [True] * (n+1)
bool_arr[0] = False
bool_arr[1] = False
for i in range(2, len(bool_arr)):
if bool_arr[i]:
for j in range(i, n//i+1):
bool_arr[i*j] = False
return bool_arr
n = 100000
ans = primes(n)
x = int(input())
for i in range(x, len(ans)):
if ans[i]:
print(i)
break
|
def primes(n):
bool_arr = [True] * (n+1)
bool_arr[0] = False
bool_arr[1] = False
for i in range(2, len(bool_arr)):
if bool_arr[i]:
for j in range(i, n//i+1):
bool_arr[i*j] = False
return bool_arr
n = 1000000
ans = primes(n)
x = int(input())
for i in range(x, len(ans)):
if ans[i]:
print(i)
break
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 624,176
| 624,177
|
u137214546
|
python
|
p02819
|
def is_prime(x, i):
if i*i > x:
return True
elif x % i == 0:
return False
else:
is_prime(x, i+1)
def gen_prime(x):
if is_prime(x, 2):
return x
else:
gen_prime(x+1)
if __name__ == "__main__":
import sys
sys.setrecursionlimit(10240)
x = int(input())
print(gen_prime(x))
|
def is_prime(x, i):
if i*i > x:
return True
elif x % i == 0:
return False
else:
return is_prime(x, i+1)
def gen_prime(x):
if is_prime(x, 2):
return x
else:
return gen_prime(x+1)
if __name__ == "__main__":
import sys
sys.setrecursionlimit(10240)
x = int(input())
print(gen_prime(x))
|
[
"control_flow.return.add"
] | 624,178
| 624,179
|
u052159226
|
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())
x=n
for i in range(n,10**5):
if is_prime(i):
break
print (i)
|
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())
x=n
for i in range(n,10**6):
if is_prime(i):
break
print (i)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,180
| 624,181
|
u003475507
|
python
|
p02819
|
import math
x = int(input())
for j in range(x,10**5):
flag = True
for i in range(2,int(math.sqrt(x))+1):
if j%i == 0:
flag = False
if flag:
print(j)
break
|
import math
x = int(input())
for j in range(x,10**6):
flag = True
for i in range(2,int(math.sqrt(x))+1):
if j%i == 0:
flag = False
if flag:
print(j)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,182
| 624,183
|
u231685196
|
python
|
p02819
|
import math
x = int(input())
for j in range(x+1,10**5):
flag = True
for i in range(2,int(math.sqrt(x))+1):
if j%i == 0:
flag = False
if flag:
print(j)
break
|
import math
x = int(input())
for j in range(x,10**6):
flag = True
for i in range(2,int(math.sqrt(x))+1):
if j%i == 0:
flag = False
if flag:
print(j)
break
|
[
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,184
| 624,183
|
u231685196
|
python
|
p02819
|
def is_prime(n):
i=2
while i*i<n:
if n%i==0:
return False
i+=1
return True
n=int(input())+1
while not is_prime(n):
n+=1
print(n)
|
def is_prime(n):
i=2
while i*i<n:
if n%i==0:
return False
i+=1
return True
n=int(input())
while not is_prime(n):
n+=1
print(n)
|
[
"expression.operation.binary.remove"
] | 624,193
| 624,194
|
u831752983
|
python
|
p02819
|
from math import sqrt
X = int(input())
not_finded = True
X = X+1 if (X%2 == 0) else X
def is_prime(X):
flag = True
for i in range(3, int(sqrt(X))+1):
if X % i == 0:
flag = False
return flag
while (not_finded):
if is_prime(X):
not_finded = False
print(X)
else:
X += 2
|
from math import sqrt
X = int(input())
not_finded = True
X = X+1 if (X%2 == 0) and X != 2 else X
def is_prime(X):
flag = True
for i in range(3, int(sqrt(X))+1):
if X % i == 0:
flag = False
return flag
while (not_finded):
if is_prime(X):
not_finded = False
print(X)
else:
X += 2
|
[] | 624,218
| 624,219
|
u411302151
|
python
|
p02819
|
def isPrime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
num = input()
res = True
ans = 0
if num > 2 and num%2 == 0:
num += 1
while(res):
if isPrime(num):
print(num)
break
num += 2
|
import math
def isPrime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
num = int(input())
res = True
ans = 0
if num > 2 and num%2 == 0:
num += 1
while(res):
if isPrime(num):
print(num)
break
num += 2
|
[
"call.add",
"call.arguments.change"
] | 624,222
| 624,223
|
u591295155
|
python
|
p02819
|
X = int(input())
def isprime(n):
if n < 2:
# 2未満は素数でない
return False
if n == 2:
# 2は素数
return True
for p in range(2, n):
if n % p == 0:
# nまでの数で割り切れたら素数ではない
return False
# nまでの数で割り切れなかったら素数
return True
while True:
isprime(X)
if isprime(X) == True:
break
else:
X = X + 1
print(X)
|
X = int(input())
def isprime(n):
if n < 2:
# 2未満は素数でない
return False
if n == 2:
# 2は素数
return True
for p in range(2, n):
if n % p == 0:
break
else:
return True #nまでの数で割り切れなかったら素数
while True:
isprime(X)
if isprime(X) == True:
break
else:
X = X + 1
print(X)
|
[] | 624,232
| 624,233
|
u351185777
|
python
|
p02819
|
import math
x = int(input())
i = 0
flag = True
while flag:
for k in range(2, int(math.sqrt(x+i)) + 1):
if (x+i) % k == 0:
i += 1
print(i)
break
else:
flag = False
print(x+i)
|
import math
x = int(input())
i = 0
flag = True
while flag:
for k in range(2, int(math.sqrt(x+i)) + 1):
if (x+i) % k == 0:
i += 1
break
else:
flag = False
print(x+i)
|
[
"call.remove"
] | 624,236
| 624,237
|
u569853645
|
python
|
p02819
|
x = int(input())
is_prime = False
while True:
if x == 2:
is_prime = True
break
for i in range(2, x):
if x % i == 0:
is_prime = False
break
else:
is_prime = True
if is_prime == False:
x += 1
else:
break
|
x = int(input())
is_prime = False
while True:
if x == 2:
is_prime = True
break
for i in range(2, x):
if x % i == 0:
is_prime = False
break
else:
is_prime = True
if is_prime == False:
x += 1
else:
break
print(x)
|
[
"call.add"
] | 624,242
| 624,243
|
u734603233
|
python
|
p02819
|
A = int(input())
if A == 2:
print(2)
sosu = [2] #素数が入る
sosu_2 = [4] #素数の2乗の数が入る
sosu_2_index = 1
for num in range(3, 100010, 2):
if num > sosu_2[sosu_2_index-1]:
sosu_2_index += 1
flag = True
for i in range(1,sosu_2_index):
if num % sosu[i] == 0:
flag = False
break
if flag:
sosu.append(num)
if num >= A:
print(num)
exit()
sosu_2.append(num**2)
|
A = int(input())
if A == 2:
print(2)
exit()
sosu = [2] #素数が入る
sosu_2 = [4] #素数の2乗の数が入る
sosu_2_index = 1
for num in range(3, 100010, 2):
if num > sosu_2[sosu_2_index-1]:
sosu_2_index += 1
flag = True
for i in range(1,sosu_2_index):
if num % sosu[i] == 0:
flag = False
break
if flag:
sosu.append(num)
if num >= A:
print(num)
exit()
sosu_2.append(num**2)
|
[
"call.add"
] | 624,254
| 624,255
|
u061539997
|
python
|
p02819
|
A = int(input())
if A == 2:
print(2)
sosu = [2] #素数が入る
sosu_2 = [4] #素数の2乗の数が入る
sosu_2_index = 1
for num in range(3, 100010, 2):
if num > sosu_2[sosu_2_index-1]:
sosu_2_index += 1
flag = True
for i in range(1,sosu_2_index):
if num % sosu[i] == 0:
flag = False
break
if flag:
sosu.append(num)
if num >= A:
print(num)
exit()
sosu_2.append(num**2)
|
A = int(input())
if A == 2:
print(2)
exit()
sosu = [2] #素数が入る
sosu_2 = [4] #素数の2乗の数が入る
sosu_2_index = 1
for num in range(3, 100010, 2):
if num > sosu_2[sosu_2_index-1]:
sosu_2_index += 1
flag = True
for i in range(1,sosu_2_index):
if num % sosu[i] == 0:
flag = False
break
if flag:
sosu.append(num)
if num >= A:
print(num)
exit()
sosu_2.append(num**2)
|
[
"call.add"
] | 624,254
| 624,256
|
u061539997
|
python
|
p02819
|
a=int(input())
for i in range(a+1,10**6):
isprime=True
for j in range(2,i):
if i%j==0:
isprime=False
break
if isprime==True:
print(i)
exit()
|
a=int(input())
for i in range(a,10**6):
isprime=True
for j in range(2,i):
if i%j==0:
isprime=False
break
if isprime==True:
print(i)
exit()
|
[
"expression.operation.binary.remove"
] | 624,271
| 624,272
|
u063073794
|
python
|
p02819
|
a=int(input())
for i in range(a+1,100+10**5):
isprime=True
for j in range(2,i):
if i%j==0:
isprime=False
break
if isprime==True:
print(i)
exit()
|
a=int(input())
for i in range(a,10**6):
isprime=True
for j in range(2,i):
if i%j==0:
isprime=False
break
if isprime==True:
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"
] | 624,273
| 624,272
|
u063073794
|
python
|
p02819
|
# -*- coding: utf-8 -*-
import sys
import math
# INPUT
input = list(map(float, input().split()))
q = int(input[0])
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
q = q + 1
while True:
if is_prime(q):
print(q)
sys.exit()
q = q + 1
|
# -*- coding: utf-8 -*-
import sys
import math
# INPUT
input = list(map(float, input().split()))
q = int(input[0])
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
while True:
if is_prime(q):
print(q)
sys.exit()
q = q + 1
|
[
"assignment.remove"
] | 624,295
| 624,296
|
u505505186
|
python
|
p02819
|
m = int(input())
if m <= 2 :
print('2')
else:
n = 10**5
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 primes[i] < m and m <= primes[i+1]:
print(primes[i+1])
|
m = int(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(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[i+1])
|
[
"assignment.change"
] | 624,299
| 624,300
|
u951401193
|
python
|
p02819
|
m = int(input())
if m <= 2 :
print('2')
else:
n = 10**5
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 primes[i] < m and m <= primes[i+1]:
print(primes[i+1])
|
m = int(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(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[i+1])
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 624,299
| 624,301
|
u951401193
|
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())
for i in range(x, 10**5):
if is_prime(i):
print(i)
break
|
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())
for i in range(x, 2*x):
if is_prime(i):
print(i)
break
|
[] | 624,313
| 624,312
|
u864989756
|
python
|
p02819
|
nn=int(input())
n=10**5+100
ar=[0]*(n)
ar[1]=0
ans=0
pre=1
for i in range(2,(n**0.5)+1):
if ar[i]==0:
for j in range(2*i,n,i):
ar[j]=1
ans=1
if ar[nn]==0:
print(nn)
else:
for i in range(nn,n):
if ar[i]==0:
print(i)
break
|
nn=int(input())
n=10**5+100
ar=[0]*(n)
ar[1]=0
ans=0
pre=1
for i in range(2,int((n**0.5))+1):
if ar[i]==0:
for j in range(2*i,n,i):
ar[j]=1
ans=1
if ar[nn]==0:
print(nn)
else:
for i in range(nn,n):
if ar[i]==0:
print(i)
break
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,326
| 624,327
|
u995109095
|
python
|
p02819
|
import sys
def main():
# sys.stdin = open('input149c.txt')
x = int(input())
r = false
while not r:
r = true
for i in range(2,x):
if x % i == 0:
r = false
break
if r == false:
x += 1
print(x)
if __name__ == '__main__':
main()
|
import sys
def main():
# sys.stdin = open('input149c.txt')
x = int(input())
r = False
while not r:
r = True
for i in range(2,x):
if x % i == 0:
r = False
break
if r == False:
x += 1
print(x)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 624,330
| 624,331
|
u946433121
|
python
|
p02819
|
import math
X = int(input())
number = 2
while (1):
flag = 1
for i in range(2, int(math.sqrt(number))+1):
if number % i == 0:
flag = 0
break
if flag == 1:
if number > X:
print(number)
break
number += 1
|
import math
X = int(input())
number = 2
while (1):
flag = 1
for i in range(2, int(math.sqrt(number))+1):
# print(i)
if number % i == 0:
flag = 0
break
if flag == 1:
if number >= X:
print(number)
break
number += 1
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,336
| 624,337
|
u065079240
|
python
|
p02819
|
x = int(input())
while True:
for i in range(2, int(x**0.5)+1):
print(i)
if x % i == 0:
break
else:
print(x)
break
x += 1
|
x = int(input())
while True:
for i in range(2, int(x**0.5)+1):
if x % i == 0:
break
else:
print(x)
break
x += 1
|
[
"call.remove"
] | 624,344
| 624,345
|
u483230733
|
python
|
p02819
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X)+1)/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt+1):
if X % (6*i+1) == 0 or X % (6*i+5) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X)+1)/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt+1):
if X % (6*i+1) == 0 or X % (6*i-1) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
[
"control_flow.loop.for.condition.change"
] | 624,354
| 624,355
|
u606523772
|
python
|
p02819
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X+1))/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt+1):
if X % (6*i+1) == 0 or X % (6*i+5) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X)+1)/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt+1):
if X % (6*i+1) == 0 or X % (6*i-1) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
[
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 624,356
| 624,355
|
u606523772
|
python
|
p02819
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X)-5)/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt):
if X % (6*i+1) == 0 or X % (6*i+5) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
from math import sqrt
X = int(input())
def is_prime_next(X):
X_sqrt = int((sqrt(X)+1)/6)
if X==2 or X==3:
return X
if X%2 == 0:
return None
if X%3 == 0:
return None
for i in range(1, X_sqrt+1):
if X % (6*i+1) == 0 or X % (6*i-1) == 0:
return None
return X
while(1):
X_keep = is_prime_next(X)
if X_keep != None:
break
X += 1
print(X)
|
[
"control_flow.loop.for.condition.change"
] | 624,357
| 624,355
|
u606523772
|
python
|
p02819
|
X = int(input())
E = [1] * (2 * X)
for i, e in enumerate(E):
if i < 1:
continue
if e < 1:
continue
for j in range(2 * i, 2 * X, i):
E[j] = 0
for i, e in enumerate(E):
if i < X:
continue
if e < 1:
continue
print(i)
break
|
X = int(input())
E = [1] * (2 * X)
for i, e in enumerate(E):
if i < 2:
continue
if e < 1:
continue
for j in range(2 * i, 2 * X, i):
E[j] = 0
for i, e in enumerate(E):
if i < X:
continue
if e < 1:
continue
print(i)
break
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 624,366
| 624,367
|
u415905784
|
python
|
p02819
|
X = int(input())
def is_prime(n):
if n <= 1:
return False
else:
for i in range(2, n):
if n%i==0:
return False
return True
while is_prime(X)==False:
X += 1
|
X = int(input())
def is_prime(n):
if n <= 1:
return False
else:
for i in range(2, n):
if n%i==0:
return False
return True
while is_prime(X)==False:
X += 1
print(X)
|
[
"call.add"
] | 624,380
| 624,381
|
u696444274
|
python
|
p02819
|
import math
def prime(X):
for i in range(2,math.ceil(math.sqrt(X))+1):
if X % i == 0:
return False
return True
X = int(input())
while True:
if prime(X):
print(X)
break
X = X + 1
|
import math
def prime(X):
for i in range(2,math.ceil(math.sqrt(X))):
if X % i == 0:
return False
return True
X = int(input())
while True:
if prime(X):
print(X)
break
X = X + 1
|
[
"expression.operation.binary.remove"
] | 624,384
| 624,385
|
u106298129
|
python
|
p02819
|
X=int(input())
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):
if num % i == 0:
return False
# 素数
return True
pn=[]
for i in range(X, 10**5+4):
print(i)
if isPrime(i):
pn.append(i)
print(min(pn))
|
X=int(input())
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):
if num % i == 0:
return False
# 素数
return True
pn=[]
for i in range(X, 10**5+4):
if isPrime(i):
pn.append(i)
print(min(pn))
|
[
"call.remove"
] | 624,395
| 624,396
|
u685662874
|
python
|
p02819
|
import sys
input = sys.stdin.readline
X=int(input().rstrip())
maxX=10**5
def resolve():
check,table=sieve(maxX)
for a in table:
if a>=X:
print(a)
return
def sieve(n):#n以下の素数を返す, is_prime[i]:iが素数ならtrue、table[i]:小さい順に素数入る
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) if is_prime[i-1]]
is_prime=[False]+is_prime ##[False]は勝手につけた、累積和をするときはこの影響で[0]+いらない
return is_prime, table
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """20"""
output = """23"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """2"""
output = """2"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """99992"""
output = """100003"""
self.assertIO(input, output)
if __name__ == "__main__":
#unittest.main()
resolve()
|
import sys
input = sys.stdin.readline
X=int(input().rstrip())
maxX=10**6
def resolve():
check,table=sieve(maxX)
for a in table:
if a>=X:
print(a)
return
def sieve(n):#n以下の素数を返す, is_prime[i]:iが素数ならtrue、table[i]:小さい順に素数入る
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) if is_prime[i-1]]
is_prime=[False]+is_prime ##[False]は勝手につけた、累積和をするときはこの影響で[0]+いらない
return is_prime, table
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """20"""
output = """23"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """2"""
output = """2"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """99992"""
output = """100003"""
self.assertIO(input, output)
if __name__ == "__main__":
#unittest.main()
resolve()
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 624,407
| 624,408
|
u141429472
|
python
|
p02819
|
# ABC149 C - Next Prime
X = int(input())
def isPrime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
while True:
if isPrime(X):
break
else:
X += 1
|
# ABC149 C - Next Prime
X = int(input())
def isPrime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
while True:
if isPrime(X):
print(X)
break
else:
X += 1
|
[
"call.add"
] | 624,410
| 624,411
|
u078349616
|
python
|
p02819
|
# coding: utf-8
import math
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0 # 1は素数ではない
# エラトステネスのふるい
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
return [prime for prime in primes if prime != 0]
X = int(input())
list = primes(10**5)
for i in list:
if i < X:
continue
else:
print(i)
break
|
# coding: utf-8
import math
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0 # 1は素数ではない
# エラトステネスのふるい
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
return [prime for prime in primes if prime != 0]
X = int(input())
list = primes(10**5 + 4)
for i in list:
if i < X:
continue
else:
print(i)
break
|
[
"assignment.change"
] | 624,412
| 624,413
|
u078349616
|
python
|
p02819
|
def is_prime(x):
n = math.floor(math.sqrt(x))
for i in range(2,n+1):
if x % i == 0:
return False
return True
a = int(input())
while not(is_prime(a)):
a += 1
print(a)
|
import math
def is_prime(x):
n = math.floor(math.sqrt(x))
for i in range(2,n+1):
if x % i == 0:
return False
return True
a = int(input())
while not(is_prime(a)):
a += 1
print(a)
|
[] | 624,422
| 624,423
|
u825842302
|
python
|
p02819
|
import math
x = int(input())
def using_sqrt(k):
factor = 0
# 2以外の偶数は素数ではないので無視する
if k % 2 == 0 and k != 2:
return False
# 繰り返しの上限を対象の平方根にする
for divisor in range(2, math.floor(math.sqrt(k))+1):
if k % divisor == 0:
factor += 1
if factor == 0:
return True
else:
return False
for i in range(x,100000):
if using_sqrt(i):
print(i)
break
|
import math
x = int(input())
def using_sqrt(k):
factor = 0
# 2以外の偶数は素数ではないので無視する
if k % 2 == 0 and k != 2:
return False
# 繰り返しの上限を対象の平方根にする
for divisor in range(2, math.floor(math.sqrt(k))+1):
if k % divisor == 0:
factor += 1
if factor == 0:
return True
else:
return False
for i in range(x,110001):
if using_sqrt(i):
print(i)
break
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,434
| 624,435
|
u352623442
|
python
|
p02819
|
N = int(input())
if N%2==0 and not N==2:
N=N+1
while True:
for i in range(2, N//2):
if N%i==0:
N += 2
continue
break
print(N)
|
N = int(input())
if N%2==0 and not N==2:
N=N+1
j = 0
while True:
for i in range(2, N//2):
if N%i==0:
N += 2
break
else:
break
print(N)
|
[
"control_flow.continue.remove",
"control_flow.break.add"
] | 624,440
| 624,441
|
u442810826
|
python
|
p02819
|
def is_prime(n):
for p in range(2,n):
if n % p ==0:
return True
N =int(input())
p=N
while cnt <10**7:
if is_prime(p):
p +=1
else:
print(p)
break
|
def is_prime(n):
for p in range(2,n):
if n % p ==0:
return True
N =int(input())
p=N
while p <10**7:
if is_prime(p):
p +=1
else:
print(p)
break
|
[
"identifier.change",
"control_flow.loop.condition.change"
] | 624,446
| 624,447
|
u007299532
|
python
|
p02819
|
import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10**9
[X] = list(map(int,input().split()))
# print(X)
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(i)
return ass
for i in range(X+1,INF):
if is_prime(i):
print(i)
exit(0)
print(-1)
|
import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10**9
[X] = list(map(int,input().split()))
# print(X)
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(i)
return ass
for i in range(X,INF):
if is_prime(i):
print(i)
exit(0)
print(-1)
|
[
"expression.operation.binary.remove"
] | 624,448
| 624,449
|
u068692021
|
python
|
p02819
|
import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10**9
[X] = list(map(int,input().split()))
# print(X)
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(i)
return ass
for i in range(X+1,INF):
if is_prime(i):
print(i)
exit(0)
print(-1)
|
import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10**9
[X] = list(map(int,input().split()))
# print(X)
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 2):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(i)
return ass
for i in range(X,INF):
if is_prime(i):
print(i)
exit(0)
print(-1)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 624,450
| 624,449
|
u068692021
|
python
|
p02819
|
def primes(N):
p = [False, False] + [True] * (N - 1)
for i in range(2, int(N ** 0.5) + 1):
if p[i]:
for j in range(i * 2, N + 1, i):
p[j] = False
return p
N = int(input())
P = primes(N * 2)
print([i for i in range(N + 1, N * 2) if P[i]][0])
|
def primes(N):
p = [False, False] + [True] * (N - 1)
for i in range(2, int(N ** 0.5) + 1):
if p[i]:
for j in range(i * 2, N + 1, i):
p[j] = False
return p
N = int(input())
P = primes(N * 2)
print([i for i in range(N, N * 2) if P[i]][0])
|
[
"expression.operation.binary.remove"
] | 624,475
| 624,476
|
u332906195
|
python
|
p02819
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 100003):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 100004):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,477
| 624,478
|
u258391277
|
python
|
p02819
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 10007):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 100004):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,479
| 624,478
|
u258391277
|
python
|
p02819
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 10**5):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
x = int(input())
for i in range(x, 100004):
if is_prime(i):
print(i)
exit()
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 624,480
| 624,478
|
u258391277
|
python
|
p02819
|
n = int(input())
l = [1]*100010
l[0] = 0
l[1] = 0
for i in range(2,10**5):
if l[i]:
for j in range(2*i,10**5,i):
l[j] = 0
while not l[n]:
n += 1
print(n)
|
n = int(input())
l = [1]*100010
l[0] = 0
l[1] = 0
for i in range(2,10**5+10):
if l[i]:
for j in range(2*i,10**5+10,i):
l[j] = 0
while not l[n]:
n += 1
print(n)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 624,481
| 624,482
|
u543954314
|
python
|
p02819
|
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)
break
x += 1
|
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())
while True:
if is_prime(x):
print(x)
break
x += 1
|
[] | 624,485
| 624,486
|
u183840468
|
python
|
p02819
|
a = int(input())
if a==2:
print(2)
elif a==3:
print(3)
elif a%2==0:
k=0
a-=1
while k==0:
a+=2
count=0
for i in range(2,a//2 + 1):
if a%i!=0:
count+=1
if count==a//2 - 1:
k=1
print(a)
elif a%2!=0:
k=0
while k==0:
a+=2
count=0
for i in range(2,a//2 + 1):
if a%i!=0:
count+=1
if count==a//2 - 1:
k=1
print(a)
|
a = int(input())
if a==2:
print(2)
elif a==3:
print(3)
elif a%2==0:
k=0
a-=1
while k==0:
a+=2
count=0
for i in range(2,a//2 + 1):
if a%i!=0:
count+=1
if count==a//2 - 1:
k=1
print(a)
elif a%2!=0:
k=0
a-=2
while k==0:
a+=2
count=0
for i in range(2,a//2 + 1):
if a%i!=0:
count+=1
if count==a//2 - 1:
k=1
print(a)
|
[] | 624,496
| 624,497
|
u557729026
|
python
|
p02819
|
import math
def trial_division(tar):
dest = int(math.sqrt(tar))+1
for i in range(2,dest):
if tar%i == 0:
#print(int(i))
return int(0) #not prime number
return int(1) #prime number
x = int(input())
while trial_division(x)==0:
x+=1
|
import math
def trial_division(tar):
dest = int(math.sqrt(tar))+1
for i in range(2,dest):
if tar%i == 0:
#print(int(i))
return int(0) #not prime number
return int(1) #prime number
x = int(input())
while trial_division(x)==0:
x+=1
print(x)
|
[
"call.add"
] | 624,498
| 624,499
|
u010462426
|
python
|
p02819
|
X = int(input())
count = 0
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
else:
while 1 > 2:
count = 0
X += 1
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
break
|
X = int(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:
print(X)
break
|
[
"control_flow.loop.condition.change"
] | 624,504
| 624,505
|
u550488532
|
python
|
p02819
|
X = int(input())
is_prime_num_list = [True] * 100000
is_prime_num_list[0] = False
is_prime_num_list[1] = False
for i in range(2, X + 1):
if is_prime_num_list[i] == True:
# iの倍数番目をFalseにする
for j in range(2 * i, 100000, i):
is_prime_num_list[j] = False
prime_num_list = [i for i, j in enumerate(is_prime_num_list) if i >= X and j == True]
print(min(prime_num_list))
'''
if is_prime_num_list[X] == True:
print(X)
exit()
'''
'''
while True:
X += 1
is_target = True
for i in prime_num_list:
if X % i == 0:
is_target = False
break
if is_target:
print(X)
exit()
'''
|
X = int(input())
is_prime_num_list = [True] * 100005
is_prime_num_list[0] = False
is_prime_num_list[1] = False
for i in range(2, X + 1):
if is_prime_num_list[i] == True:
# iの倍数番目をFalseにする
for j in range(2 * i, 100005, i):
is_prime_num_list[j] = False
prime_num_list = [i for i, j in enumerate(is_prime_num_list) if i >= X and j == True]
print(min(prime_num_list))
'''
if is_prime_num_list[X] == True:
print(X)
exit()
'''
'''
while True:
X += 1
is_target = True
for i in prime_num_list:
if X % i == 0:
is_target = False
break
if is_target:
print(X)
exit()
'''
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,508
| 624,509
|
u886655280
|
python
|
p02819
|
s = [True for i in range(200000)]
s[0] = False
s[1] = False
n = int(input())
for i in range(2,len(s)):
if not s[i]:
continue
for j in range(i+i, len(s), i):
s[j] = False
for i in range(n+1, len(s)):
if s[i]:
print(i)
break
|
s = [True for i in range(200000)]
s[0] = False
s[1] = False
n = int(input())
for i in range(2,len(s)):
if not s[i]:
continue
for j in range(i+i, len(s), i):
s[j] = False
for i in range(n, len(s)):
if s[i]:
print(i)
break
|
[
"expression.operation.binary.remove"
] | 624,510
| 624,511
|
u114801897
|
python
|
p02819
|
def is_prime(num):
for i in range(num):
if num % i == 0:
return False
return True
x = int(input())
for i in range(x, 10000+4):
if is_prime(i):
print(i)
break
|
def is_prime(num):
for i in range(2, num):
if num % i == 0:
return False
return True
x = int(input())
for i in range(x, 100004):
if is_prime(i):
print(i)
break
|
[
"call.arguments.add",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 624,512
| 624,513
|
u074338678
|
python
|
p02819
|
import math
X = int(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_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
prime_list = get_primenumber(100000)
left = 0
right = len(prime_list)-1
if X == 2:
print(int(2))
elif X > 99991:
print(int(100003))
else:
while left <= right:
mid = (left+right) // 2
if prime_list[mid] == X:
ans = prime_list[mid]
break
elif prime_list[mid] > X:
if prime_list[mid-1] < X:
ans = prime_list[mid]
break
else:
right = mid - 1
else:
if prime_list[mid+1] > X:
ans = prime_list[mid]
break
else:
left = mid + 1
print(int(ans))
|
import math
X = int(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_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
prime_list = get_primenumber(100000)
left = 0
right = len(prime_list)-1
if X == 2:
print(int(2))
elif X > 99991:
print(int(100003))
else:
while left <= right:
mid = (left+right) // 2
if prime_list[mid] == X:
ans = prime_list[mid]
break
elif prime_list[mid] > X:
if prime_list[mid-1] < X:
ans = prime_list[mid]
break
else:
right = mid - 1
else:
if prime_list[mid+1] > X:
ans = prime_list[mid+1]
break
else:
left = mid + 1
print(int(ans))
|
[
"assignment.change"
] | 624,516
| 624,517
|
u459150945
|
python
|
p02819
|
import random
def is_prime(q, k=50):
q = abs(q)
#計算するまでもなく判定できるものははじく
if q == 2:
return True
if q < 2 or q & 1 == 0:
return False
#n-1=2^s*dとし（但しaは整数、dは奇数)、dを求める
d = (q-1) >> 1
while d & 1 == 0:
d >>= 1
#判定をk回繰り返す
for i in xrange(k):
a = random.randint(1, q-1)
t = d
y = pow(a, t, q)
#[0,s-1]の範囲すべてをチェック
while t != q-1 and y != 1 and y != q-1:
y = pow(y, 2, q)
t <<= 1
if y != q-1 and t & 1 == 0:
return False
return True
X = int(input())
while True:
if is_prime(X):
break
X += 1
print(X)
|
import random
def is_prime(q, k=50):
q = abs(q)
#計算するまでもなく判定できるものははじく
if q == 2:
return True
if q < 2 or q & 1 == 0:
return False
#n-1=2^s*dとし（但しaは整数、dは奇数)、dを求める
d = (q-1) >> 1
while d & 1 == 0:
d >>= 1
#判定をk回繰り返す
for i in range(k):
a = random.randint(1, q-1)
t = d
y = pow(a, t, q)
#[0,s-1]の範囲すべてをチェック
while t != q-1 and y != 1 and y != q-1:
y = pow(y, 2, q)
t <<= 1
if y != q-1 and t & 1 == 0:
return False
return True
X = int(input())
while True:
if is_prime(X):
break
X += 1
print(X)
|
[
"identifier.change",
"call.function.change"
] | 624,523
| 624,524
|
u028325088
|
python
|
p02819
|
X=int(input())
count = 0
for i in range(100000):
for j in range(1,X):
if X % j == 0:
count = count + 1
break
if count == 0:
break
count = 0
X = X + 1
print(X)
|
X = int(input())
count = 0
for i in range(100000):
for j in range(2,X):
if X % j == 0:
count = count + 1
break
if count == 0:
break
count = 0
X = X + 1
print(X)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 624,527
| 624,528
|
u137316733
|
python
|
p02819
|
X=int(input())
count = 0
for i in range(100000):
for j in range(1,X):
if X % j == 0:
count = count + 1
break
if count == 0:
break
counr = 0
X = X + 1
print(X)
|
X = int(input())
count = 0
for i in range(100000):
for j in range(2,X):
if X % j == 0:
count = count + 1
break
if count == 0:
break
count = 0
X = X + 1
print(X)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"assignment.variable.change",
"identifier.change"
] | 624,529
| 624,528
|
u137316733
|
python
|
p02818
|
def main():
a, b, k = map(int, input().split())
if k >= a+b:
print(0, 0)
elif a>k:
print(a, b)
else:
b = b - (k - a)
a = 0
print(a, b)
# if __name__ == '__main__':
main()
|
def main():
a, b, k = map(int, input().split())
if k >= a+b:
print(0, 0)
elif a>=k:
print(a-k, b)
else:
b = b - (k - a)
a = 0
print(a, b)
# if __name__ == '__main__':
main()
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,534
| 624,535
|
u086716588
|
python
|
p02818
|
A,B,K=map(int,input().split())
if(A>K):
print("{} {}".format(K-A,B))
else:
if(B-K+A)>0:
print("{} {}".format(0,B-K+A))
else:
print("0 0")
|
A,B,K=map(int,input().split())
if(A>K):
print("{} {}".format(A-K,B))
else:
if(B-K+A)>0:
print("{} {}".format(0,B-K+A))
else:
print("0 0")
|
[
"expression.operation.binary.remove"
] | 624,556
| 624,557
|
u054729397
|
python
|
p02818
|
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from math import gcd
#import random
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def show(*inp, end='\n'):
if show_flg:
print(*inp, end=end)
YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def main():
A, B, K = MI()
if K <= A:
print(A, B)
else:
K -= A
print(0, max(B - K, 0))
if __name__ == '__main__':
main()
|
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from math import gcd
#import random
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return [int(i) for i in input().split()]
def LI_(): return [int(i)-1 for i in input().split()]
def StoI(): return [ord(i)-97 for i in input()]
def ItoS(nn): return chr(nn+97)
def input(): return sys.stdin.readline().rstrip()
def show(*inp, end='\n'):
if show_flg:
print(*inp, end=end)
YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']
show_flg = False
# show_flg = True
def main():
A, B, K = MI()
if K <= A:
print(A - K, B)
else:
K -= A
print(0, max(B - K, 0))
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.add"
] | 624,565
| 624,566
|
u642874916
|
python
|
p02818
|
a,b,k = map(int, input().split( ))
a1 = max(a-k,0)
a2 = max(b-(a-a1),0)
print(a1,a2)
|
a,b,k = map(int, input().split( ))
a1 = max(a-k,0)
a2 = max(b-(k-(a-a1)),0)
print(a1,a2)
|
[
"call.arguments.change"
] | 624,572
| 624,573
|
u520276780
|
python
|
p02818
|
a,b,k = map(int, input().split( ))
a1 = max(a-k,0)
a2 = max(b-(k-a1),0)
print(a1,a2)
|
a,b,k = map(int, input().split( ))
a1 = max(a-k,0)
a2 = max(b-(k-(a-a1)),0)
print(a1,a2)
|
[
"call.arguments.change"
] | 624,574
| 624,573
|
u520276780
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a >= k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,min(0,b)))
|
a, b, k = map(int, input().split())
if a >= k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,max(0,b)))
|
[
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 624,579
| 624,580
|
u109266345
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a >= k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,b))
|
a, b, k = map(int, input().split())
if a >= k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,max(0,b)))
|
[
"call.add",
"call.arguments.change"
] | 624,581
| 624,580
|
u109266345
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a > k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,b))
|
a, b, k = map(int, input().split())
if a >= k:
a = a-k
else:
b = b-(k-a)
a = 0
print("{} {}".format(a,max(0,b)))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 624,582
| 624,580
|
u109266345
|
python
|
p02818
|
A, B, K = (int(i) for i in input().split())
if A >= K:
print(A-K)
exit()
elif (A+B) >= K:
print(0, B-(K-A))
else:
print(0, 0)
|
A, B, K = (int(i) for i in input().split())
if A >= K:
print(A-K, B)
exit()
elif (A+B) >= K: print(0, B-(K-A))
else: print(0, 0)
|
[
"call.arguments.add"
] | 624,585
| 624,586
|
u058592821
|
python
|
p02818
|
A,B,K = map(int,input().split())
if (A <= K):
print("0 {}".format(B-(K-A)))
else:
print("{} {}".format(A-K,B))
|
A,B,K = map(int,input().split())
if (A <= K):
print("0 {}".format(max(0,B-(K-A))))
else:
print("{} {}".format(A-K,B))
|
[
"call.add",
"call.arguments.change"
] | 624,587
| 624,588
|
u202634017
|
python
|
p02818
|
n = input()
m = n.split()
p = [int(i) for i in m]
if p[0] > p[2]:
print(str(p[0]-p[2])+" "+str(p[1]))
else:
print("0 "+str(p[1]+p[0]-p[2]))
|
n = input()
m = n.split()
p = [int(i) for i in m]
if p[0] > p[2]:
print(str(p[0]-p[2])+" "+str(p[1]))
else:
print("0 "+str(max(0,p[1]+p[0]-p[2])))
|
[
"call.add",
"call.arguments.change"
] | 624,599
| 624,600
|
u982944976
|
python
|
p02818
|
#!/usr/bin/env python3
import sys
INF = float("inf")
def solve(A: int, B: int, K: int):
if A <= K:
a = 0
b = B-(K-A)
else:
a = A-K
b = B
print(a, b, sep=" ")
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(A, B, K)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
INF = float("inf")
def solve(A: int, B: int, K: int):
if A <= K:
a = 0
b = max(B-(K-A), 0)
else:
a = A-K
b = B
print(a, b, sep=" ")
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(A, B, K)
if __name__ == '__main__':
main()
|
[
"call.add",
"call.arguments.add"
] | 624,606
| 624,607
|
u947883560
|
python
|
p02818
|
# -*- coding: utf-8 -*-
A, B, K = map(int, input().split())
diff = K - A
A = max(0, A - K)
if diff > 0:
B -= diff
print(A, B)
|
# -*- coding: utf-8 -*-
A, B, K = map(int, input().split())
diff = K - A
A = max(0, A - K)
if diff > 0:
B -= diff
print(A, max(0, B))
|
[
"call.add",
"call.arguments.change"
] | 624,608
| 624,609
|
u263226212
|
python
|
p02818
|
def main():
a,b,k=map(int,input().split())
if a-k<0:
print(0,b-(k-a))
else:
print(a-k,b)
main()
|
def main():
a,b,k=map(int,input().split())
if a-k<0:
print(0,max(b-(k-a),0))
else:
print(a-k,b)
main()
|
[
"call.add",
"call.arguments.add"
] | 624,617
| 624,618
|
u393253137
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A >= K:
A -= K
else:
A = 0
K -= A
if B >= K:
B -= K
else:
B = 0
print('{} {}'.format(A, B))
|
A, B, K = map(int, input().split())
if A >= K:
A -= K
else:
K -= A
A = 0
if B >= K:
B -= K
else:
B = 0
print('{} {}'.format(A, B))
|
[
"assignment.remove",
"assignment.add"
] | 624,619
| 624,620
|
u929569377
|
python
|
p02818
|
A,B,K = list(map(int, input().split()))
N = A+B-K
if N <=0:
print('0 0')
elif N < B:
print('0 %d' %N)
else:
print('%d %d' %(A-N,B))
|
A,B,K = list(map(int, input().split()))
N = A+B-K
if N <=0:
print('0 0')
elif N < B:
print('0 %d' %N)
else:
print('%d %d' %(A-K,B))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 624,633
| 624,634
|
u231189826
|
python
|
p02818
|
import sys
A, B, K = map(int, input().split())
if A + B <= K:
print(0, 0)
sys.exit(0)
if A <= K:
print(A-K, B)
sys.exit(0)
print(0, A+B-K)
|
import sys
A, B, K = map(int, input().split())
if A + B <= K:
print(0, 0)
sys.exit(0)
if A >= K:
print(A-K, B)
sys.exit(0)
print(0, A+B-K)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,652
| 624,653
|
u252729807
|
python
|
p02818
|
A,B,K = map(int,input().split())
if K < A:
A = A - K
print(A,B)
else:
K = K - A
A = 0
print(K)
if K < B:
B -= K
print(A,B)
else:
B = 0
print(A,B)
|
A,B,K = map(int,input().split())
if K < A:
A = A - K
print(A,B)
else:
K = K - A
A = 0
# print(K)
if K < B:
B -= K
print(A,B)
else:
B = 0
print(A,B)
|
[
"call.remove"
] | 624,662
| 624,663
|
u398175819
|
python
|
p02818
|
a,b,k = map(int, input().split())
if a >= k:
print(0, b)
else:
k = k-a
if b >= k:
print(0, b-k)
else:
print(0, 0)
|
a,b,k = map(int, input().split())
if a >= k:
print(a-k, b)
else:
k = k-a
if b >= k:
print(0, b-k)
else:
print(0, 0)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 624,671
| 624,672
|
u952939556
|
python
|
p02818
|
a, b, k = map(int, input().split())
b -= k - a
a -= k
print(max(0, a), max(0, b))
|
a, b, k = map(int, input().split())
b -= max(0, k - a)
a -= k
print(max(0, a), max(0, b))
|
[
"call.add",
"call.arguments.change"
] | 624,675
| 624,676
|
u832152513
|
python
|
p02818
|
a,b,k = map(int,input().split())
aa = max((a-k),0)
if k > a:
bb = max(b-(k-a),0)
print(aa,bb)
|
a,b,k = map(int,input().split())
aa = max((a-k),0)
bb = b
if k > a:
bb = max(b-(k-a),0)
print(aa,bb)
|
[
"assignment.add"
] | 624,682
| 624,683
|
u738898077
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a >= k:
print('{} {}'.format(a-k.b))
elif a+b >= k:
print('0 {}'.format(b-(k-a)))
else:
print('0 0')
|
a, b, k = map(int, input().split())
if a >= k:
print('{} {}'.format(a-k,b))
elif a+b >= k:
print('0 {}'.format(b-(k-a)))
else:
print('0 0')
|
[
"misc.typo",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 624,686
| 624,687
|
u036340997
|
python
|
p02818
|
a, b, k = map(int, input().split())
if (a >= k):
a -= k
else:
a = 0
b = max(b + a - k, 0)
print(' '.join([str(a), str(b)]))
|
a, b, k = map(int, input().split())
if (a >= k):
a -= k
else:
b = max(b + a - k, 0)
a = 0
print(' '.join([str(a), str(b)]))
|
[
"assignment.remove",
"assignment.add"
] | 624,688
| 624,689
|
u186426563
|
python
|
p02818
|
a, b, k = map(int,input().split())
t = min(a,k)
a -= t
k -= t
u = min(b,k)
b-=k
print(a,b)
|
a, b, k = map(int,input().split())
t = min(a,k)
a -= t
k -= t
u = min(b,k)
b-=u
print(a,b)
|
[
"identifier.change"
] | 624,694
| 624,695
|
u325227960
|
python
|
p02818
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(A: int, B: int, K: int):
t = max(0, A-K)
a = B
if A-K > 0:
a = B
else:
a -= max(0, K-A)
print(t, a)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(A, B, K)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(A: int, B: int, K: int):
t = max(0, A-K)
a = B
if A-K > 0:
a = B
else:
a = max(0, a- (K-A))
print(t, a)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(A, B, K)
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"call.arguments.change"
] | 624,696
| 624,697
|
u386819480
|
python
|
p02818
|
A,B,K=map(int,input().split())
if K<=A:
print(K-A,B)
elif A<K<=A+B:
print(0,A+B-K)
else:
print(0,0)
|
A,B,K=map(int,input().split())
if K<=A:
print(A-K,B)
elif A<K<=A+B:
print(0,A+B-K)
else:
print(0,0)
|
[
"expression.operation.binary.remove"
] | 624,700
| 624,701
|
u572142121
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>k:
t=a-k
s=b
else:
t=0
s=b-k+a
print(str(t)+' '+str(s))
|
a,b,k=map(int,input().split())
if a>k:
t=a-k
s=b
else:
t=0
s=max(b-k+a,0)
print(str(t)+' '+str(s))
|
[
"call.add",
"call.arguments.add"
] | 624,702
| 624,703
|
u919730120
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A <= K:
K -= A
A = 0
B -= K
else:
A -= K
print(A, B)
|
A, B, K = map(int, input().split())
if A <= K:
K -= A
A = 0
B -= K
else:
A -= K
print(A, max(B, 0))
|
[
"call.add",
"call.arguments.add"
] | 624,708
| 624,709
|
u815878613
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A <= K:
print(0, B - (K - A))
else:
print(A - K, B)
|
A, B, K = map(int, input().split())
if A <= K:
print(0, max(B - (K - A), 0))
else:
print(A - K, B)
|
[
"call.add",
"call.arguments.add"
] | 624,716
| 624,715
|
u006657459
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A < K:
print(0, B - (K - A))
else:
print(A - K, B)
|
A, B, K = map(int, input().split())
if A <= K:
print(0, max(B - (K - A), 0))
else:
print(A - K, B)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 624,717
| 624,715
|
u006657459
|
python
|
p02818
|
a, b, k = map(int, input().split())
print(max(0, a - k), min(b, a + b - k))
|
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, min(b, a + b - k)))
|
[
"call.arguments.add",
"call.arguments.change"
] | 624,722
| 624,723
|
u081193942
|
python
|
p02819
|
from sympy import sieve
def Eratosthenes(n):
li = [i for i in range(2,n+1)]
judge = [True for i in range(n+1)]
ans = []
for i in range(2,n+1):
if judge[i] == True:
for j in range(i*2,n+1,i):
judge[j] = False
ans.append(i)
return ans
x = int(input())
l = Eratosthenes(10 ** 6)
for i in l:
if i >= x:
print(i)
exit()
|
def Eratosthenes(n):
li = [i for i in range(2,n+1)]
judge = [True for i in range(n+1)]
ans = []
for i in range(2,n+1):
if judge[i] == True:
for j in range(i*2,n+1,i):
judge[j] = False
ans.append(i)
return ans
x = int(input())
l = Eratosthenes(10 ** 6)
for i in l:
if i >= x:
print(i)
exit()
|
[] | 624,726
| 624,727
|
u614734359
|
python
|
p02819
|
x=int(input())+1
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 1:
if is_prime(x):print(x);exit()
x+=1
|
x=int(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 1:
if is_prime(x):print(x);exit()
x+=1
|
[
"expression.operation.binary.remove"
] | 624,738
| 624,739
|
u227082700
|
python
|
p02819
|
def is_prime2(q,k=100):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
for i in xrange(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
return True
c = int(input())
for i in range(c, 10**6):
if is_prime(i):
print(i)
break
|
def is_prime2(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
return True
c = int(input())
for i in range(c, 10**6):
if is_prime2(i):
print(i)
break
|
[
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 624,789
| 624,790
|
u921518222
|
python
|
p02819
|
a = int(input())
def mark(s, x):
for i in range(x + x, len(s), x):
s[i] = False
def sieve(n):
s = [True] * n
for x in range(2, int(n**0.5) + 1):
if s[x]: mark(s, x)
return [i for i in range(0,n) if s[i] and i > a]
s = (sieve(a * 2))
print(s[0])
|
a = int(input())
def mark(s, x):
for i in range(x + x, len(s), x):
s[i] = False
def sieve(n):
s = [True] * n
for x in range(2, int(n**0.5) + 1):
if s[x]: mark(s, x)
return [i for i in range(0,n) if s[i] and i >= a]
s = sieve(a * 2)
print(s[0])
|
[
"expression.operator.compare.change",
"function.return_value.change"
] | 624,754
| 624,753
|
u982944976
|
python
|
p02819
|
X = int(input())
while X != 'prime':
for i in range(2,X):
if X%i == 0:
X+=1
continue
break
print(X)
|
X = int(input())
while X != 'prime':
for i in range(2,X):
if X%i == 0:
break
else:
break
X+=1
print(X)
|
[
"control_flow.break.add",
"control_flow.break.remove"
] | 624,760
| 624,761
|
u962858258
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.