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 |
|---|---|---|---|---|---|---|---|
p02818 | a,b,k= [int(i) for i in input().split()]
if k == a:
print(0,b)
elif k < a:
print(a-k,b)
elif k > a:
print(0, b-(k-a)) | a,b,k= [int(i) for i in input().split()]
if k == a:
print(0,b)
elif k < a:
print(a-k,b)
elif k > a:
print(0, max(b-(k-a),0)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 622,991 | 622,992 | u452269253 | python |
p02818 | A,B,K = map(int,input().split())
if A >= K:
print(A - K,B)
else:
print(0, B - (K - A) ) | A,B,K = map(int,input().split())
if A >= K:
print(A - K,B)
else:
print(0, max( B - (K - A),0 ) ) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 622,995 | 622,996 | u454093752 | python |
p02818 | A, B, K = map(int, input().split())
if A >= K:
print(A - K, B)
elif B - (A - K) < 0:
print(0, 0)
else:
print(0, B - (K - A)) | A, B, K = map(int, input().split())
if A >= K:
print(A - K, B)
elif B - (K - A) < 0:
print(0, 0)
else:
print(0, B - (K - A)) | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 622,997 | 622,998 | u241159583 | python |
p02818 | a,b,k = map(int,input().split())
if a>k and a>0:
a-=k
else:
a=0
if b>k-a and b>0:
b-=(k-a)
else:
b=0
print(str(a)+" "+str(b)) | a,b,k = map(int,input().split())
if a>k and a>0:
a-=k
else:
if b>k-a and b>0:
b-=(k-a)
else:
b=0
a=0
print(str(a)+" "+str(b)) | [
"assignment.remove",
"assignment.add"
] | 623,009 | 623,010 | u498975813 | python |
p02818 | a, b, k = [int(v) for v in input().split()]
if k >= a:
a = 0
k -= a
else:
a -= k
k = 0
if k >= b:
b = 0
else:
b -= k
print(a, b) | a, b, k = [int(v) for v in input().split()]
if k >= a:
k -= a
a = 0
else:
a -= k
k = 0
if k >= b:
b = 0
else:
b -= k
print(a, b) | [
"assignment.remove",
"assignment.add"
] | 623,015 | 623,016 | u006883624 | python |
p02818 | inpt = input()
inpt = inpt.split(" ")
inpt = [int(i) for i in inpt]
A = inpt[0]
B = inpt[1]
K = inpt[2]
if A >= K:
A = A - K
else:
A = 0
K = K - A
B = max(0,B - K)
print(A,B)
| inpt = input()
inpt = inpt.split(" ")
inpt = [int(i) for i in inpt]
A = inpt[0]
B = inpt[1]
K = inpt[2]
if A >= K:
A = A - K
else:
K = K - A
A = 0
B = max(0,B - K)
print(A,B)
| [
"assignment.remove",
"assignment.add"
] | 623,017 | 623,018 | u743383679 | python |
p02818 | A,B,K = list(map(int,input().split(" ")))
if K <= A:
A = A - K
print(str(A) + " " + str(B))
else:
K -= A
A = 0
if B >= K:
B -= K
print(str(A) + " " + str(B))
if B < K:
print("0 0") | A,B,K = list(map(int,input().split(" ")))
if K <= A:
A = A - K
print(str(A) + " " + str(B))
else:
K -= A
A = 0
if B >= K:
B -= K
print(str(A) + " " + str(B))
exit()
if B < K:
print("0 0") | [
"call.add"
] | 623,029 | 623,030 | u188745744 | python |
p02818 | a,b,k=map(int,input().split())
ansa=max(a-k,0)
if a<=k:
print(ansa,b-(k-a))
else:
print(ansa,b) | a,b,k=map(int,input().split())
ansa=max(a-k,0)
if a<=k:
print(ansa,max(b-(k-a),0))
else:
print(ansa,b) | [
"call.add",
"call.arguments.add"
] | 623,031 | 623,032 | u185896732 | python |
p02818 | a,b,k = (int(i) for i in input().split())
ak = k-a
if 0 < ak :
bk = b - ak
if 0 < bk :
print(0,bk)
elif bk < 0 :
print(0,ak-b)
elif bk == 0 :
print(0,0)
elif ak < 0 :
print(a-k,b)
elif ak == 0 :
print(0,b)
| a,b,k = (int(i) for i in input().split())
ak = k-a
if 0 < ak :
bk = b - ak
if 0 < bk :
print(0,bk)
elif bk < 0 :
print(0,0)
elif bk == 0 :
print(0,0)
elif ak < 0 :
print(a-k,b)
elif ak == 0 :
print(0,b)
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 623,053 | 623,054 | u215461917 | python |
p02818 | a, b, k = map(int, input().split())
print(str(max(0, a-k))+' '+str(max(0, a+b-k))) | a, b, k = map(int, input().split())
print(str(max(0, a-k))+' '+str(max(0, min(b, a+b-k)))) | [
"call.add",
"call.arguments.change"
] | 623,055 | 623,056 | u499832992 | python |
p02818 | A, B, K = (int(i) for i in input().split())
if A >= K:
a = A - K
k = K - A
else:
a = 0
k = K - A
b = max(B - k, 0)
print(a, b) | A, B, K = (int(i) for i in input().split())
if A >= K:
a = A - K
k = 0
else:
a = 0
k = K - A
b = max(B - k, 0)
print(a, b) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 623,057 | 623,058 | u929520616 | 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(0, b - k + a))
else:
print(a - k, b)
| [
"call.arguments.add",
"call.arguments.change"
] | 623,061 | 623,062 | u008357982 | python |
p02818 | A, B, K = map(int, input().split())
if K <= A:
print(A - K, B)
elif A < K <= 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) | [
"control_flow.branch.if.condition.change"
] | 623,073 | 623,074 | u728566015 | python |
p02818 |
a,b,k=map(int,input().split())
a=max(a-k,0)
k=max(k-a,0)
b=max(b-k,0)
print(a,b)
|
a,b,k=map(int,input().split())
a1=max(a-k,0)
k=max(k-a,0)
b=max(b-k,0)
print(a1,b)
| [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 623,079 | 623,080 | u695079172 | python |
p02818 | a,b,k=map(int,input.split())
a=max(a-k,0)
k=max(k-a,0)
b=max(b-k,0)
print(a,b) |
a,b,k=map(int,input().split())
a1=max(a-k,0)
k=max(k-a,0)
b=max(b-k,0)
print(a1,b)
| [
"call.add",
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 623,081 | 623,080 | u695079172 | python |
p02818 | A,B,K=map(int,input().split())
X=min(A,K)
A-=X
K-=X
B-=K
print(A,B) | A,B,K=map(int,input().split())
X=min(A,K)
A-=X
K-=X
B-=K
print(A,max(0,B)) | [
"call.add",
"call.arguments.change"
] | 623,084 | 623,085 | u695811449 | python |
p02818 | A,B,K = map(int,input().split())
T = A - K
O = B
if T >= 0:
print(T, 0)
elif O+T >=0:
print(0,O+T)
else:
print(0,0) | A,B,K = map(int,input().split())
T = A - K
O = B
if T >= 0:
print(T, O)
elif O+T >=0:
print(0,O+T)
else:
print(0,0) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 623,086 | 623,087 | u890183245 | python |
p02818 | A, B, K = map(int, input().split())
if A + B <= K:
A = 0
B = 0
else:
if A <= K:
B = K - A
A = 0
else:
A = A - K
print(A,B)
| A, B, K = map(int, input().split())
if A + B <= K:
A = 0
B = 0
else:
if A <= K:
B = B - (K - A)
A = 0
else:
A = A - K
print(A,B)
| [
"assignment.change"
] | 623,102 | 623,103 | u547728429 | python |
p02818 | import sys
def input():
return sys.stdin.readline()[:-1]
A,B,K = map(int,input().split(' '))
if K>=A:
A = 0
K -= A
if K>=B:
B = 0
else:
B -= K
else:
A -= K
print(A,B) | import sys
def input():
return sys.stdin.readline()[:-1]
A,B,K = map(int,input().split(' '))
if K>=A:
K -= A
A = 0
if K>=B:
B = 0
else:
B -= K
else:
A -= K
print(A,B) | [
"assignment.remove",
"assignment.add"
] | 623,110 | 623,111 | u598720217 | python |
p02818 | A, B, K = map(int, input().split())
if A>=1:
if A>K:
print(A-K, B)
else:
if B-A>0:
print(0, B+A-K)
else:
print(0,0)
else:
if B-K>0:
print(0, B-K)
else:
print(0,0)
| A, B, K = map(int, input().split())
if A>=1:
if A>K:
print(A-K, B)
else:
if B+A-K>0:
print(0, B+A-K)
else:
print(0,0)
else:
if B-K>0:
print(0, B-K)
else:
print(0,0) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 623,112 | 623,113 | u906481659 | python |
p02818 | A, B, K = [int(i) for i in input().split()]
b1 = A - K
o1 = b1 if (b1 > 0) else 0
b2 = -b1
o2 = B - b2 if (b2 > 0) else B
o3 = B - b2 if (o2 > 0) else 0
o = str(o1) + " " + str(o3)
print(o) | A, B, K = [int(i) for i in input().split()]
b1 = A - K
o1 = b1 if (b1 > 0) else 0
b2 = -b1
o2 = B - b2 if (b2 > 0) else B
o3 = o2 if (o2 > 0) else 0
o = str(o1) + " " + str(o3)
print(o) | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 623,128 | 623,129 | u854524434 | python |
p02818 | # 1行目の入力を空白で分割された数値として扱う
A, B, K = map(int, input().split())
#
if A > K:
A = A - K
else:
if A + B < K:
B = B - (K - A)
A = 0
else:
B = 0
A = 0
# 答えの出力
print(str(A) + " " + str(B)) | # 1行目の入力を空白で分割された数値として扱う
A, B, K = map(int, input().split())
#
if A >= K:
A = A - K
else:
if A + B >= K:
B = B - (K - A)
A = 0
else:
B = 0
A = 0
# 答えの出力
print(str(A) + " " + str(B)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,134 | 623,135 | u826027240 | python |
p02818 | def acinput():
return list(map(int, input().split(" ")))
A,B,K=acinput()
if A>=K:
A-=K
else:
B-=(K-A)
A = 0
print(A,B)
| def acinput():
return list(map(int, input().split(" ")))
A,B,K=acinput()
if A>=K:
A-=K
else:
B-=(K-A)
A = 0
print(A,max(0,B))
| [
"call.add",
"call.arguments.change"
] | 623,143 | 623,144 | u346308892 | python |
p02818 | A, B, K = map(int, input().split())
if A <= K:
a = 0
if B <= K - A:
b = 0
else:
b = B - (K - A)
else:
a = A - K
print(a, b) | A, B, K = map(int, input().split())
if A <= K:
a = 0
if B <= K - A:
b = 0
else:
b = B - (K - A)
else:
a = A - K
b = B
print(a, b) | [
"assignment.add"
] | 623,155 | 623,156 | u249218227 | python |
p02818 | a,b,k=map(int,input().split())
if(a<=k):
k-=a
else:
print(a-k,b)
exit()
if(b<=k):
print(0,0)
else:
print(0,k-b) | a,b,k=map(int,input().split())
if(a<=k):
k-=a
else:
print(a-k,b)
exit()
if(b<=k):
print(0,0)
else:
print(0,b-k) | [
"expression.operation.binary.remove"
] | 623,165 | 623,166 | u777028980 | python |
p02818 | A,B,K=map(int, input().split())
if K<=A:
A-=K
elif K<=A+B:
A=0
B-=K-A
else:
A=0
B=0
print(A,B) | A,B,K=map(int, input().split())
if K<=A:
A-=K
elif K<=A+B:
B-=K-A
A=0
else:
A=0
B=0
print(A,B) | [
"assignment.remove",
"assignment.add"
] | 623,173 | 623,174 | u748311048 | python |
p02818 | A,B,K=map(int, input().split())
if K<=A:
A-=K
elif K<=A+B:
B-=K-A
else:
A=0
B=0
print(A,B) | A,B,K=map(int, input().split())
if K<=A:
A-=K
elif K<=A+B:
B-=K-A
A=0
else:
A=0
B=0
print(A,B) | [
"assignment.add"
] | 623,175 | 623,174 | u748311048 | python |
p02818 | A, B, K = (int(x) for x in input().split())
if A < K:
K -=A
A=0
else:
A-=K
if B < K:
B=0
else:
B-=K
print(str(A) + " " + str(B)) | A, B, K = (int(x) for x in input().split())
if A <= K:
K -=A
A = 0
else:
A-=K
K = 0
if B <= K:
B = 0
else:
B-=K
print(str(A) + " " + str(B)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,178 | 623,179 | u708494712 | python |
p02818 | A,B,K = list(map(int,input().split()))
ans = [A,B]
if A+B <= K:
ans = [0,0]
elif A<=K:
ans[0] = 0
ans[1] = B-(K-A)
else:
ans[0] = K-A
print(ans[0],ans[1]) | A,B,K = list(map(int,input().split()))
ans = [A,B]
if A+B <= K:
ans = [0,0]
elif A<=K:
ans[0] = 0
ans[1] = B-(K-A)
else:
ans[0] = A-K
print(ans[0],ans[1]) | [
"expression.operation.binary.remove"
] | 623,186 | 623,187 | u971124021 | python |
p02818 | A,B,K = map(int,input().split())
if A>K:
print(A-K,end ="")
print(B)
elif A+B > K:
print(0,end = " ")
print(B-(K-A))
elif A+B <=K:
print(0,end = " ")
print(0) | A,B,K = map(int,input().split())
if A>K:
print(A-K,end =" ")
print(B)
elif A+B > K:
print(0,end = " ")
print(B-(K-A))
elif A+B <=K:
print(0,end = " ")
print(0)
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 623,188 | 623,189 | u527993431 | python |
p02818 | a, b, k = map(int, input().split())
if a > k:
c = a - k
elif a + b > k:
c = 0
d = a + b - k
else:
c = 0
d = 0
print(c, d) | a, b, k = map(int, input().split())
if a > k:
c = a - k
d = b
elif a + b > k:
c = 0
d = a + b - k
else:
c = 0
d = 0
print(c, d)
| [
"assignment.add"
] | 623,192 | 623,193 | u878849567 | python |
p02818 | takahashi, aoki, kaisu = [int(x) for x in input().split()]
taka_amari = takahashi - kaisu
if taka_amari<0:
ao_amari = aoki+taka_amari
if taka_amari<0:
taka_amari = 0
if ao_amari<0:
ao_amari = 0
print(str(taka_amari) + " " + str(ao_amari)) | takahashi, aoki, kaisu = [int(x) for x in input().split()]
taka_amari = takahashi - kaisu
ao_amari = aoki
if taka_amari<0:
ao_amari = aoki+taka_amari
if taka_amari<0:
taka_amari = 0
if ao_amari<0:
ao_amari = 0
print(str(taka_amari) + " " + str(ao_amari)) | [
"assignment.add"
] | 623,194 | 623,195 | u642682703 | python |
p02818 | s=list(map(int,input().split()))
ans=s[2]-s[0]
if(ans>0):
if(s[1]>ans):
print(0,s[1]-ans)
else:
print(0,0)
else:
print(-ans,s[2]) | s=list(map(int,input().split()))
ans=s[2]-s[0]
if(ans>0):
if(s[1]>ans):
print(0,s[1]-ans)
else:
print(0,0)
else:
print(-ans,s[1]) | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 623,196 | 623,197 | u088277062 | python |
p02818 | from sys import stdin
A,B,K = [int(x) for x in stdin.readline().rstrip().split()]
t = A
a = B
t -= min(A,K)
a -= (K-min(A,K))
print(t,a) | from sys import stdin
A,B,K = [int(x) for x in stdin.readline().rstrip().split()]
t = A
a = B
t -= min(A,K)
a -= (K-min(A,K))
print(t,max(a,0)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 623,211 | 623,212 | u405256066 | python |
p02818 | A, B, K = map(int,input().split())
if K >= A:
print(0, B-(K-A))
else:
print(A-K, B) | A, B, K = map(int,input().split())
if K >= A:
print(0, max(B-(K-A), 0))
else:
print(A-K, B) | [
"call.add",
"call.arguments.add"
] | 623,229 | 623,230 | u513434790 | python |
p02818 | import sys
def solve():
A, B, K = map(int, input().split())
if A <= K:
K -= A
A = 0
else:
A -= K
if K > 0:
if B <= K:
K -= B
B = 0
else:
B -= K
print(A, B)
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
A, B, K = map(int, input().split())
if A <= K:
K -= A
A = 0
else:
A -= K
K = 0
if K > 0:
if B <= K:
K -= B
B = 0
else:
B -= K
K = 0
print(A, B)
return 0
if __name__ == "__m... | [
"assignment.add"
] | 623,237 | 623,238 | u608088992 | python |
p02818 | A, B, K = map(int, input().split())
if A > K:
print('{} {}'.format(A - K, B))
else:
print('0 {}'.format(B - (K - A))) | A, B, K = map(int, input().split())
if A > K:
print('{} {}'.format(A - K, B))
else:
print('0 {}'.format(max(0, B - (K - A)))) | [
"call.add",
"call.arguments.change"
] | 623,239 | 623,240 | u168333670 | python |
p02818 | A,B,K = list(map(int,input().split()))
if K<=A:
print(A-K,B)
elif K<=A+B:
print(0,B+A-K)
else:
print(0) | A,B,K = list(map(int,input().split()))
if K<=A:
print(A-K,B)
elif K<=A+B:
print(0,B+A-K)
else:
print(0,0) | [
"call.arguments.add"
] | 623,245 | 623,246 | u785989355 | python |
p02818 | #B
A,B,K = map(int,input().split())
if A > K:
a = A-K
print(a,B)
else:
a = 0
b = B-(K-A)
print(a,b)
| #B
A,B,K = map(int,input().split())
if A > K:
a = A-K
print(a,B)
else:
a = 0
b = max(0,B-(K-A))
print(a,b)
| [
"call.add",
"call.arguments.change"
] | 623,267 | 623,268 | u533885955 | python |
p02818 | A, B, K = map(int, input().split())
if A - K >= 0:
print(A - K, B)
else:
B = B - (K - A)
print(0, B) | A, B, K = map(int, input().split())
if A - K >= 0:
print(A - K, B)
else:
B = max(B - (K - A), 0)
print(0, B) | [
"call.add",
"call.arguments.add"
] | 623,273 | 623,274 | u078349616 | python |
p02818 | import sys
input = sys.stdin.readline
a, b, k = [int(x) for x in input().strip().split()]
if k <= a:
print((a - k) + b, b)
else:
print(0, max(0, b - (k - a))) | import sys
input = sys.stdin.readline
a, b, k = [int(x) for x in input().strip().split()]
if k <= a:
print(a - k, b)
else:
print(0, max(0, b - (k - a))) | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 623,302 | 623,303 | u408620326 | python |
p02818 | # coding: utf-8
# Your code here!
A,B,K=map(int,input().split())
if K<=A:
print("{} {}".format(A-K,B))
else:
print("{} {}".format(0,A+B-K)) | # coding: utf-8
# Your code here!
A,B,K=map(int,input().split())
if K<=A:
print("{} {}".format(A-K,B))
else:
print("{} {}".format(0,max(A+B-K,0))) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 623,304 | 623,305 | u095426154 | python |
p02818 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b,k = map(int, input().split())
if a > k:
print(a - k + b,b)
else:
if b - (k - a) > 0:
print(0,b - (k - a))
else:
print(0,0) | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b,k = map(int, input().split())
if a > k:
print(a - k ,b)
else:
if b - (k - a) > 0:
print(0,b - (k - a))
else:
print(0,0) | [
"expression.operation.binary.remove"
] | 623,310 | 623,311 | u130492706 | python |
p02818 | a,b,k=map(int,input().split())
if a>=k:
aa=a-k
bb=b
else:
aa=0
bb=a+b-k
print(aa,bb) | a,b,k=map(int,input().split())
if a>=k:
aa=a-k
bb=b
else:
aa=0
bb=max(a+b-k,0)
print(aa,bb) | [
"call.add",
"call.arguments.add"
] | 623,316 | 623,317 | u177388368 | python |
p02818 | a,b,k=map(int,input().split())
print(max(0,a-k),max(0,b-(k-a))) | a,b,k=map(int,input().split())
print(max(0,a-k),max(0,b-(max(0,k-a)))) | [
"call.add",
"call.arguments.change"
] | 623,320 | 623,321 | u625963200 | python |
p02818 | # B
A, B, K = map(int, input().split())
A = A - min(A,K)
K = K - min(A,K)
B = B - min(B,K)
print(A, B) | # B
A, B, K = map(int, input().split())
A, K = A - min(A,K), K - min(A,K)
B = B - min(B,K)
print(A, B) | [
"assignment.value.change"
] | 623,326 | 623,327 | u663093503 | 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"
] | 623,336 | 623,337 | u877415670 | python |
p02818 | # 2019/12/29
a,b,k=map(int,input().split())
if a>=k:
a-=k
else:
a,b=0,b-(k-a)
print(a,b,sep=' ') | # 2019/12/29
a,b,k=map(int,input().split())
if a>=k:
a-=k
else:
a,b=0,max(b-(k-a),0)
print(a,b,sep=' ') | [
"call.add",
"call.arguments.add"
] | 623,352 | 623,353 | u919633157 | python |
p02818 | A,B,K = map(int, input().split())
if A >= K:
A -= K
elif A <= K:
B = max(0, K - A)
A = 0
print(A, B)
| A,B,K = map(int, input().split())
if A >= K:
A -= K
elif A <= K:
B = max(0, B - (K - A))
A = 0
print(A, B)
| [
"call.arguments.change"
] | 623,354 | 623,355 | u037430802 | python |
p02818 | A,B,K = map(int, input().split())
if A >= K:
A -= K
elif A <= K:
B -= max(0, K - A)
A = 0
print(A, B) | A,B,K = map(int, input().split())
if A >= K:
A -= K
elif A <= K:
B = max(0, B - (K - A))
A = 0
print(A, B)
| [
"assignment.value.change",
"call.arguments.change"
] | 623,356 | 623,355 | u037430802 | python |
p02818 | A,B,K = map(int,input().split(' '))
if K - A > 0:
print(0,(B - (K - A)))
else:
print(A-K,B) | A,B,K = map(int,input().split(' '))
if K - A > 0:
print(0,max(0,(B - (K - A))))
else:
print(A-K,B) | [
"call.arguments.add",
"call.arguments.change"
] | 623,361 | 623,362 | u415154163 | python |
p02818 | A,B,K = map(int,input().split())
if K > A:
K = K - A
A = 0
B -= K
else:
A -= K
print("{} {}".format(A,B)) | A,B,K = map(int,input().split())
if K > A:
K = K - A
A = 0
B -= K
else:
A -= K
print("{} {}".format(A,max(B,0))) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 623,363 | 623,364 | u355371431 | python |
p02818 | A, B, K = map(int, input().split())
if K <= A:
print(A - K, B)
else:
print(0, B - (K - A)) | A, B, K = map(int, input().split())
if K <= A:
print(A - K, B)
else:
print(0, max(B - (K - A), 0)) | [
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 623,367 | 623,368 | u745561510 | python |
p02818 | a, b, k = map(int, input().split())
if k > a:
k -= a
a = 0
b -= k
if b < 0:
b = 0
elif k < a:
a -= k
print(a, b)
| a, b, k = map(int, input().split())
if k > a:
k -= a
a = 0
b -= k
if b < 0:
b = 0
elif k <= a:
a -= k
print(a, b)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,373 | 623,374 | u339503988 | python |
p02818 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
A, B, K = map(int, input().split())
if K <= A:
print(A-K, B)
else:
print(0, B-(K-A))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
A, B, K = map(int, input().split())
if K <= A:
print(A-K, B)
else:
print(0, max(0, B-(K-A)))
| [
"call.arguments.add",
"call.arguments.change"
] | 623,387 | 623,388 | u741397536 | python |
p02818 | A, B, K = map(int, input().split())
print(max(A-K, 0), B - max(0, (K - A)))
| A, B, K = map(int, input().split())
print(max(A-K, 0), max(0, B - max(0, (K - A))))
| [
"call.arguments.add",
"call.arguments.change"
] | 623,393 | 623,394 | u814986259 | python |
p02819 | from bisect import bisect_left
INFTY = 10**5
P = [1 for _ in range(INFTY)]
P[0]=0
P[1]=0
for i in range(2,int(INFTY**0.5)+1):
for j in range(i*i,INFTY,i):
P[j] = 0
Q = []
for i in range(INFTY):
if P[i]==1:
Q.append(i)
X = int(input())
ind = bisect_left(Q,X)
print(Q[ind]) | from bisect import bisect_left
INFTY = 10**5+10
P = [1 for _ in range(INFTY)]
P[0]=0
P[1]=0
for i in range(2,int(INFTY**0.5)+1):
for j in range(i*i,INFTY,i):
P[j] = 0
Q = []
for i in range(INFTY):
if P[i]==1:
Q.append(i)
X = int(input())
ind = bisect_left(Q,X)
print(Q[ind]) | [
"assignment.change"
] | 623,397 | 623,398 | u644907318 | python |
p02819 | from bisect import bisect_right
INFTY = 10**5
P = [1 for _ in range(INFTY)]
P[0]=0
P[1]=0
for i in range(2,int(INFTY**0.5)+1):
for j in range(i*i,INFTY,i):
P[j] = 0
Q = []
for i in range(INFTY):
if P[i]==1:
Q.append(i)
X = int(input())
ind = bisect_right(Q,X)
print(Q[ind]) | from bisect import bisect_left
INFTY = 10**5+10
P = [1 for _ in range(INFTY)]
P[0]=0
P[1]=0
for i in range(2,int(INFTY**0.5)+1):
for j in range(i*i,INFTY,i):
P[j] = 0
Q = []
for i in range(INFTY):
if P[i]==1:
Q.append(i)
X = int(input())
ind = bisect_left(Q,X)
print(Q[ind]) | [
"identifier.change",
"assignment.value.change",
"call.function.change"
] | 623,399 | 623,398 | u644907318 | python |
p02819 | X = int(input())
for i in range(X+1, 9999999999999999):
flag = 1
for j in range(2, X//2 +1):
if i % j == 0:
flag = -12
break
if X == 2:
print(2)
break
elif X == 3:
print(3)
break
elif flag == 1:
print(i)
break | X = int(input())
for i in range(X, 9999999999999999):
flag = 1
for j in range(2, X//2 +1):
if i % j == 0:
flag = -1
break
if X == 2:
print(2)
break
elif X == 3:
print(3)
break
elif flag == 1:
print(i)
break | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change"
] | 623,401 | 623,402 | u860338101 | python |
p02819 | X = int(input())
for i in range(X+1, 999999999):
flag = 1
for j in range(2, i//2+1):
if i % j == 0:
flag = -12
break
if X == 2:
print(2)
break
elif X == 3:
print(3)
break
elif flag == 1:
print(i)
break | X = int(input())
for i in range(X, 9999999999999999):
flag = 1
for j in range(2, X//2 +1):
if i % j == 0:
flag = -1
break
if X == 2:
print(2)
break
elif X == 3:
print(3)
break
elif flag == 1:
print(i)
break | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 623,403 | 623,402 | u860338101 | python |
p02819 | X = int(input())
def is_Prime(x):
for i in range(2, x+1):
if i * i + 1 > x:
return True
if x % i == 0:
return False
for i in range(X+1, 2*X+1):
if is_Prime(i):
print(i)
break
| X = int(input())
def is_Prime(x):
for i in range(2, x+1):
if i * i + 1 > x:
return True
if x % i == 0:
return False
for i in range(X, 2*X+1):
if is_Prime(i):
print(i)
break
| [
"expression.operation.binary.remove"
] | 623,404 | 623,405 | u779728630 | python |
p02819 | x = int(input())
while True:
flag ==0
for i in range(2,x//2):
if x%i==0:
flag ==1
break
if flag ==1:
print(x)
exit()
else:
x = x+1 | x = int(input())
while True:
flag =0
for i in range(2,x//2):
if x%i==0:
flag =1
break
if flag ==0:
print(x)
exit()
x = x+1 | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 623,411 | 623,412 | u620846115 | python |
p02819 | X=int(input())
x=0
for j in range(X,10**5+1):
for i in range(j-1,0,-1):
if i==1:
print(j)
x=1
elif j%i==0:
break
if x==1:
break | X=int(input())
x=0
for j in range(X,10**6):
for i in range(j-1,0,-1):
if i==1:
print(j)
x=1
elif j%i==0:
break
if x==1:
break | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 623,413 | 623,414 | u827261928 | python |
p02819 | x = int(input())
if x == 2:
print(2)
exit()
for i in range(1,1000000):
for j in range(2, x+i):
if (x+i) % j == 0:
break
if j == x+i-1:
print(x+i)
exit()
| x = int(input())
if x == 2:
print(2)
exit()
for i in range(1000000):
for j in range(2, x+i):
if (x+i) % j == 0:
break
if j == x+i-1:
print(x+i)
exit() | [
"call.arguments.change"
] | 623,418 | 623,419 | u306412379 | python |
p02819 | X=int(input())
ans=0
for i in range(X+1,10**5+100):
cond=True
for j in range(2,int(i**0.5)+1):
if i%j==0:
cond=False
break
if cond:
ans=i
break
print(ans) | X=int(input())
ans=0
for i in range(X,10**5+100):
cond=True
for j in range(2,int(i**0.5)+1):
if i%j==0:
cond=False
break
if cond:
ans=i
break
print(ans) | [
"expression.operation.binary.remove"
] | 623,431 | 623,432 | u703528810 | python |
p02819 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
X = int(input())
double = X*2+1
s = set()
for i in range(2, double):
if i in s:
continue
if i>X:
print(i)
break
cnt = 1
while cnt*i<=double:
... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
X = int(input())
double = X*10+1
s = set()
for i in range(2, double):
if i in s:
continue
if i>=X:
print(i)
break
cnt = 1
while cnt*i<=double:
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,459 | 623,460 | u054514819 | python |
p02819 | import math
a = int(input())
b = int(math.sqrt(a)) +1
for k in range(1,200000):
count = 0
for i in range(2,b):
if (a+k) % i == 0:
count +=1
if count == 0:
print(a+k)
break | import math
a = int(input())
b = int(math.sqrt(a)) +1
for k in range(200000):
count = 0
for i in range(2,b):
if (a+k) % i == 0:
count +=1
if count == 0:
print(a+k)
break | [
"call.arguments.change"
] | 623,463 | 623,464 | u224554402 | python |
p02819 | import math
a = int(input())
b = int(math.sqrt(a)) +1
for k in range(1,20000):
count = 0
for i in range(2,b):
if (a+k) % i == 0:
count +=1
if count == 0:
print(a+k)
break | import math
a = int(input())
b = int(math.sqrt(a)) +1
for k in range(200000):
count = 0
for i in range(2,b):
if (a+k) % i == 0:
count +=1
if count == 0:
print(a+k)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 623,465 | 623,464 | u224554402 | python |
p02819 | X = int(input())
prime = []
for n in range(3, X+1, 2):
lim = int(n ** 0.5)
f = True
for p in prime:
if p > lim:
break
if n % p == 0:
f = False
break
if f:
prime.append(n)
if X >= 2:
prime = [2] + prime
for n in range(X+1, X+10**5):
fo... | X = int(input())
prime = []
for n in range(3, X, 2):
lim = int(n ** 0.5)
f = True
for p in prime:
if p > lim:
break
if n % p == 0:
f = False
break
if f:
prime.append(n)
if X >= 3:
prime = [2] + prime
for n in range(X, X+10**5):
for p ... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 623,468 | 623,469 | u452337391 | python |
p02819 | import math
X = int(input())
def is_prime(x):
a = int(math.sqrt(X)) + 1#ある数が素数かどうかはO(√A)で判定できる
for i in range(2,a):
if x % i == 0:
return False
return True#xは素数
for j in range(X,10**5):
if is_prime(j):
ans = j
break
print(ans) | import math
X = int(input())
def is_prime(x):
a = int(math.sqrt(X)) + 1#ある数が素数かどうかはO(√A)で判定できる
for i in range(2,a):
if x % i == 0:
return False
return True#xは素数
for j in range(X,10**5+4):
if is_prime(j):
ans = j
break
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,470 | 623,471 | u411923565 | python |
p02819 | X=int(input())
import sys
for i in range(X,10**5+1):
T=True
for j in range(2,i):
if i%j==0:
T=False
if T==True:
print(i)
break
else:
continue | X=int(input())
import sys
for i in range(X,10**5+1000):
T=True
for j in range(2,i):
if i%j==0:
T=False
if T==True:
print(i)
break
else:
continue | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 623,492 | 623,493 | u854962015 | python |
p02819 | X=int(input())
import sys
for i in range(X,10**5+1000):
T=True
for j in range(2,i):
if i%j==0:
T=False
if T==True:
print(i)
break
else:
print(1)
continue | X=int(input())
import sys
for i in range(X,10**5+1000):
T=True
for j in range(2,i):
if i%j==0:
T=False
if T==True:
print(i)
break
else:
continue | [
"call.remove"
] | 623,494 | 623,493 | u854962015 | python |
p02819 | import bisect
def seive():
l[0]=0
l[1]=0
for i in range(2,10**5+1):
if l[i]==1:
k.append(i)
for j in range(i*i,10**5+1,i):
l[j]=0
l=[1]*(10**5+1)
k=[]
seive()
n=int(input())
d=bisect.bisect_left(k,n)
#print(d)
print(k[d])
| import bisect
def seive():
l[0]=0
l[1]=0
for i in range(2,10**6+1):
if l[i]==1:
k.append(i)
for j in range(i*i,10**6+1,i):
l[j]=0
l=[1]*(10**6+1)
k=[]
seive()
#print(len(k))
n=int(input())
d=bisect.bisect_left(k,n)
print(k[d])
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.step.change",
"assignment.value.change"
] | 623,496 | 623,497 | u396211450 | python |
p02819 | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | [
"assignment.value.change",
"identifier.change"
] | 623,498 | 623,499 | u259190728 | python |
p02819 | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 623,500 | 623,499 | u259190728 | python |
p02819 | import bisect
l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 33... | import bisect
l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 33... | [] | 623,505 | 623,506 | u054931633 | python |
p02819 | X = int(input())+1
def Sosuu_not(n):
for p in range(2, n):
if n % p == 0:
return False
else:
return True
while True:
if Sosuu_not(X) == True:
print(X)
break
X += 1
| X = int(input())
def Sosuu_not(n):
for p in range(2, n):
if n % p == 0:
return False
else:
return True
while True:
if Sosuu_not(X) == True:
print(X)
break
X += 1 | [
"expression.operation.binary.remove"
] | 623,507 | 623,508 | u688649934 | python |
p02819 | def prime(n):
limit = math.floor(math.sqrt(n))
for i in range(2,limit+1):
if n % i == 0:
return prime(n+1)
return n
X = int(input())
print(prime(X))
| import math
def prime(n):
limit = math.floor(math.sqrt(n))
for i in range(2,limit+1):
if n % i == 0:
return prime(n+1)
return n
X = int(input())
print(prime(X))
| [] | 623,515 | 623,516 | u695474809 | python |
p02819 | X=int(input())
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if X%i==0:
break
else:
print(x)
break
| X=int(input())
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if x%i==0:
break
else:
print(x)
break | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 623,518 | 623,519 | u185806788 | python |
p02819 | X=int(input())
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if x%i!=0:
print(x)
break
| X=int(input())
for x in range(X,2*X):
for i in range(2,int(x**.5)+1):
if x%i==0:
break
else:
print(x)
break | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 623,522 | 623,519 | u185806788 | python |
p02819 | def eratosthenes(n):
A = [i for i in range(2, n+1)]
P = []
i = 2
while i**2 <= n:
prime = min(A)
P.append(prime)
j = 0
while j < len(A):
if A[j] % prime == 0:
A.pop(j)
continue
j += 1
i += 1
for a in ... | from bisect import bisect_right
def eratosthenes(n):
A = [i for i in range(2, n+1)]
P = []
i = 2
while i**2 <= n:
prime = min(A)
P.append(prime)
j = 0
while j < len(A):
if A[j] % prime == 0:
A.pop(j)
continue
j += 1... | [] | 623,524 | 623,525 | u243312682 | python |
p02819 | from bisect import bisect_right
def eratosthenes(n):
A = [i for i in range(2, n+1)]
P = []
i = 2
while i**2 <= n:
prime = min(A)
P.append(prime)
j = 0
while j < len(A):
if A[j] % prime == 0:
A.pop(j)
continue
j += 1... | from bisect import bisect_right
def eratosthenes(n):
A = [i for i in range(2, n+1)]
P = []
i = 2
while i**2 <= n:
prime = min(A)
P.append(prime)
j = 0
while j < len(A):
if A[j] % prime == 0:
A.pop(j)
continue
j += 1... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 623,526 | 623,525 | u243312682 | python |
p02819 | def SieveOfEratosthenes(n):
prime = [True for i in range(10**5 + 1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, 10**5 + 1, p):
if prime[i]:
prime[i] = False
p += 1
prime[0], prime[1]= False, False
count ... | def SieveOfEratosthenes(n):
prime = [True for i in range(10**6 + 1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, 10**6 + 1, p):
if prime[i]: prime[i] = False
p += 1
prime[0], prime[1] = False, False
count = 1
while(Tr... | [
"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",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,529 | 623,530 | u112247039 | python |
p02819 | def SieveOfEratosthenes(n):
prime = [True for i in range(10**5 + 1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, 10**5 + 1, p):
if prime[i]:
prime[i] = False
p += 1
prime[0], prime[1]= False, False
count ... | def SieveOfEratosthenes(n):
prime = [True for i in range(10**6 + 1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, 10**6 + 1, p):
if prime[i]: prime[i] = False
p += 1
prime[0], prime[1] = False, False
count = 1
while(Tr... | [
"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",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"as... | 623,531 | 623,530 | u112247039 | python |
p02819 | X = int(input())
pn = []
pn_flg = [0] * 10**6
for i in range(2, 10**6):
if pn_flg[i] == 1:
continue
pn.append(i)
pn_flg[i] = 1
for j in range(i, 10**6, i):
pn_flg[j] = 1
for i in pn:
if i > X:
print(i)
exit() | X = int(input())
pn = []
pn_flg = [0] * 10**6
for i in range(2, 10**6):
if pn_flg[i] == 1:
continue
pn.append(i)
pn_flg[i] = 1
for j in range(i, 10**6, i):
pn_flg[j] = 1
for i in pn:
if i >= X:
print(i)
exit() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,537 | 623,538 | u439063038 | python |
p02819 | import sys
n = int(input())
if n == 2:
print(2)
sys.exit()
for i in range(n+1,10**6):
bol = True
for j in range(2,i):
if i%j == 0:
bol = False
if bol:
print(i)
sys.exit() | import sys
n = int(input())
if n == 2:
print(2)
sys.exit()
for i in range(n,10**6):
bol = True
for j in range(2,i):
if i%j == 0:
bol = False
if bol:
print(i)
sys.exit() | [
"expression.operation.binary.remove"
] | 623,539 | 623,540 | u626228246 | python |
p02819 | X = int(input())
i = int(n**0.5)
while i >= 2:
if X % i == 0:
X += 1
i = int(X**0.5)
else:
i -= 1
print(X) | X = int(input())
i = int(X**0.5)
while i >= 2:
if X % i == 0:
X += 1
i = int(X**0.5)
else:
i -= 1
print(X) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 623,541 | 623,542 | u498136917 | python |
p02819 | import math
x = int(input())
if x == 2:
print(3)
exit()
elif x%2 == 0:
ans = x+1
else:
ans = x
#2以外の素数は奇数であることに注意
while True:
for i in range(3, int(math.sqrt(ans))+1, 2):
if ans%i == 0:
ans += 2
break
else:
print(ans)
exit()
| import math
x = int(input())
if x == 2:
print(2)
exit()
elif x%2 == 0:
ans = x+1
else:
ans = x
#2以外の素数は奇数であることに注意
while True:
for i in range(3, int(math.sqrt(ans))+1, 2):
if ans%i == 0:
ans += 2
break
else:
print(ans)
exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 623,555 | 623,556 | u447456419 | python |
p02819 | import math
x = int(input())
if x == 2:
print(3)
elif x%2 == 0:
ans = x+1
else:
ans = x
#2以外の素数は奇数であることに注意
while True:
for i in range(3, int(math.sqrt(ans))+1, 2):
if ans%i == 0:
ans += 2
break
else:
print(ans)
exit()
| import math
x = int(input())
if x == 2:
print(2)
exit()
elif x%2 == 0:
ans = x+1
else:
ans = x
#2以外の素数は奇数であることに注意
while True:
for i in range(3, int(math.sqrt(ans))+1, 2):
if ans%i == 0:
ans += 2
break
else:
print(ans)
exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change",
"call.add"
] | 623,557 | 623,556 | u447456419 | python |
p02819 | X = int(input())
r = X
while(True):
for i in range(2, r):
if r%i == 0:
r += 1
continue
else:
break
print(r) | X = int(input())
r = X
while(True):
for i in range(2, r):
if r%i == 0:
r += 1
break
else:
break
print(r) | [
"control_flow.continue.remove",
"control_flow.break.add"
] | 623,566 | 623,567 | u072717685 | python |
p02819 | import sys
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
if is_prime(x):
print(x)
sys.exit()
for i in range(x,int(1e5)):
for j in range(2,x):
if i % j == 0:... | import sys
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
if is_prime(x):
print(x)
sys.exit()
for i in range(x,int(1e5)+100):
for j in range(2,x):
if i % j =... | [
"call.remove"
] | 623,582 | 623,583 | u518891382 | python |
p02819 | import sys
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
if is_prime(x):
print(x)
sys.exit()
for i in range(x,int(1e5)):
for j in range(2,x):
if i % j == 0:... | import sys
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
if is_prime(x):
print(x)
sys.exit()
for i in range(x,int(1e5)+100):
for j in range(2,x):
if i % j =... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 623,584 | 623,583 | u518891382 | python |
p02819 | import math
x = int(input().split()[0])
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
dat... | import math
x = int(input().split()[0])
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
dat... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,585 | 623,586 | u913153936 | python |
p02819 | import math
x = int(input().split()[0])
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
dat... | import math
x = int(input().split()[0])
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
dat... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,587 | 623,586 | u913153936 | python |
p02819 | from collections import deque
X = int(input())
N = 10**5+4
N_sq=N**(1/2)
check = deque(range(2,N+1))
search = deque([])
for n in range(N):
if len(check)<=0:
break
c = check.popleft()
search.append(c)
check = deque([ _ for _ in check if _%c != 0])
if c > N_sq:
search... | from collections import deque
X = int(input())
N = 10**5+4
N_sq=N**(1/2)
check = deque(range(2,N+1))
search = deque([])
for n in range(N):
if len(check)<=0:
break
c = check.popleft()
search.append(c)
check = deque([ _ for _ in check if _%c != 0])
if c > N_sq:
search... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 623,590 | 623,591 | u465101448 | python |
p02819 | from collections import deque
X = int(input())
N = 10**5+4
N_sq=N**(1/2)
check = deque(range(2,N+1))
search = deque([])
for n in range(N):
if len(check)<=0:
break
c = check.popleft()
search.append(c)
check = deque([ _ for _ in check if _%c != 0])
if c > N_sq:
search... | from collections import deque
X = int(input())
N = 10**5+4
N_sq=N**(1/2)
check = deque(range(2,N+1))
search = deque([])
for n in range(N):
if len(check)<=0:
break
c = check.popleft()
search.append(c)
check = deque([ _ for _ in check if _%c != 0])
if c > N_sq:
search... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 623,592 | 623,591 | u465101448 | python |
p02819 | from math import floor,sqrt
x = int(input())
if x==2 :
print(2)
elif x == 3:
print(3)
else:
pass
while True:
if all(x % i != 0 for i in range(2,int(floor(sqrt(x)))+1)) == True:
print(x)
exit()
else:
x += 1 | from math import floor,sqrt
x = int(input())
if x==2 :
print(2)
exit()
elif x == 3:
print(3)
exit()
else:
pass
while True:
if all(x % i != 0 for i in range(2,int(floor(sqrt(x)))+1)) == True:
print(x)
exit()
else:
x += 1 | [
"call.add"
] | 623,601 | 623,602 | u757274384 | python |
p02819 | X=int(input())
def is_prime(x):
if x<=1:
return False
for i in range(2,int(-(-x**0.5//1))+1):
if x%i==0:
return False
return True
p=X
while not is_prime(p):
p+=1
print(p) | X=int(input())
def is_prime(x):
if x<=1:
return False
for i in range(2,int(-(-x**0.5//1))):
if x%i==0:
return False
return True
p=X
while not is_prime(p):
p+=1
print(p) | [
"expression.operation.binary.remove"
] | 623,620 | 623,621 | u212502386 | python |
p02819 | import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.setrecursi... | import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.setrecursi... | [
"expression.operation.binary.remove"
] | 623,622 | 623,623 | u654470292 | 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(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"
] | 623,628 | 623,629 | u924828749 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.