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 |
|---|---|---|---|---|---|---|---|
p02682 | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
a,b,c,k = map(int,input().split())
ans = 0
if k>0:
ans += a
k -= min(k,a)
if k>0:
k-= min(k,b)
if k>0:
d = min(c,k)
ans += -1*d
print(a... | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
a,b,c,k = map(int,input().split())
ans = 0
if k>0:
ans += min(k,a)
k -= min(k,a)
if k>0:
k-= min(k,b)
if k>0:
d = min(c,k)
ans += -1*d
... | [
"call.add",
"call.arguments.change"
] | 408,988 | 408,989 | u379142263 | python |
p02682 | import numpy as np
S = input().split()
a = int(S[0])
b = int(S[1])
c = int(S[2])
k = int(S[3])
if a < k :
if b <k -a:
print(a-(k-a-b))
else:
print(a)
else:
print(a) | import numpy as np
S = input().split()
a = int(S[0])
b = int(S[1])
c = int(S[2])
k = int(S[3])
if a < k :
if b <k -a:
print(a-(k-a-b))
else:
print(a)
else:
print(k) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 408,990 | 408,991 | u559250296 | python |
p02682 | A,B,C,K=map(int,input().split())
if K<A:
ans=K
elif A<=K and K<=A+B:
ans=A
else:
ans=2*A-K
print(ans) | A,B,C,K=map(int,input().split())
if K<A:
ans=K
elif A<=K and K<=A+B:
ans=A
else:
ans=2*A+B-K
print(ans) | [
"assignment.change"
] | 408,994 | 408,995 | u771804983 | python |
p02682 | A,B,C,K = map(int,input().split())
if A>=K:
print(K)
else:
if A+B>=K:
print(K)
else:
print(A-(K-A-B)) | A,B,C,K = map(int,input().split())
if A>=K:
print(K)
else:
if A+B>=K:
print(A)
else:
print(A-(K-A-B)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 408,996 | 408,997 | u623953567 | python |
p02682 | A,B,C,K = map(int,input().split())
if A>=K:
print(A)
else:
if A+B>=K:
print(A)
else:
print(A-(K-A-B)) | A,B,C,K = map(int,input().split())
if A>=K:
print(K)
else:
if A+B>=K:
print(A)
else:
print(A-(K-A-B)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 408,999 | 408,997 | u623953567 | python |
p02682 | A, B, C, K = map(int, input().split())
if (K < A):
print(A)
exit()
elif(K >= A):
if (K < A + B):
print(A)
exit()
elif (K >= A + B):
print(A + (-1) * (K - A - B))
| A, B, C, K = map(int, input().split())
if (K < A):
print(K)
exit()
elif(K >= A):
if (K < A + B):
print(A)
exit()
elif (K >= A + B):
print(A + (-1) * (K - A - B))
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,000 | 409,001 | u787059958 | python |
p02682 | A, B, C, K = map(int, input().split())
a = min(A, K)
b = max(K - a, 0)
b = min(b, B)
c = max(K - a - b, 0)
print(A * 1 + c * (-1)) | A, B, C, K = map(int, input().split())
a = min(A, K)
b = max(K - a, 0)
b = min(b, B)
c = max(K - a - b, 0)
print(a * 1 + c * (-1)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,012 | 409,013 | u050641473 | python |
p02682 | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from math import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // g... | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from math import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // g... | [
"call.add",
"call.arguments.add"
] | 409,014 | 409,015 | u330169562 | python |
p02682 | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from math import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // g... | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from math import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // g... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 409,016 | 409,015 | u330169562 | python |
p02682 | def solve():
A,B,C,K = map(int,input().split())
ans = 0
if A > K:
print(A)
else:
ans += A
K -= A
if B > K:
print(ans)
else:
K -= B
print(ans - K)
if __name__ == '__main__':
solve() | def solve():
A,B,C,K = map(int,input().split())
ans = 0
if A > K:
print(K)
else:
ans += A
K -= A
if B > K:
print(ans)
else:
K -= B
print(ans - K)
if __name__ == '__main__':
solve() | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,020 | 409,021 | u647999897 | python |
p02682 | a,b,c,k = map(int,input().split())
if k<=a :
print(k)
if k< a+b:
print(a)
else:
print(2*a+b-k) | a,b,c,k = map(int,input().split())
if k<=a :
print(k)
elif k< a+b:
print(a)
else:
print(2*a+b-k) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 409,028 | 409,029 | u848680818 | python |
p02682 | a,b,c,k = map(int,input().split())
if k<a :
print(k)
if k<= a+b:
print(a)
else:
print(2*a+b-k) | a,b,c,k = map(int,input().split())
if k<=a :
print(k)
elif k< a+b:
print(a)
else:
print(2*a+b-k) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 409,030 | 409,029 | u848680818 | python |
p02682 | a, b, c, k = map(int,input().split())
if a >= k:
print(a)
elif a + b >= k:
print(a)
else:
n = k - (a + b)
ans = a + -1 * n
print(ans) | a, b, c, k = map(int,input().split())
if a >= k:
print(k)
elif a + b >= k:
print(a)
else:
n = k - (a + b)
ans = a + -1 * n
print(ans) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,031 | 409,032 | u197968862 | python |
p02682 | ## B
A, B, C, K = map(int, input().split())
rt = A
K = K - A - B
if K > 0:
rt -= K
print(rt) | ## B
A, B, C, K = map(int, input().split())
rt = A if A < K else K
K = K - A - B
if K > 0:
rt -= K
print(rt) | [] | 409,037 | 409,038 | u299599133 | python |
p02682 | A, B, C, K = map(int, input().split())
count = 0
second = K-A-B
if A >= K:
count = K
else:
count = A
if second:
count -= second
print(count) | A, B, C, K = map(int, input().split())
count = 0
second = K-A-B
if A >= K:
count = K
else:
count = A
if second > 0:
count -= second
print(count) | [
"control_flow.branch.if.condition.change"
] | 409,047 | 409,048 | u161432819 | python |
p02682 | a,b,c,k = map(int, input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print(2*a - k - b) | a,b,c,k = map(int, input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print(2*a - k + b) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,053 | 409,054 | u336641513 | python |
p02682 | a,b,c,k = map(int,input().split())
ans = 0
if a>=k:
ans = a
elif a+b>=k:
ans = a
else:
ans = a - (k-a-b)
print(ans) | a,b,c,k = map(int,input().split())
ans = 0
if a>=k:
ans = k
elif a+b>=k:
ans = a
else:
ans = a - (k-a-b)
print(ans) | [
"assignment.value.change",
"identifier.change"
] | 409,059 | 409,060 | u626467464 | python |
p02682 | A, B, C, K = map(int,input().split())
if K < A:
print(K)
if A <= K < A + B:
print(A)
if A + B <= K < A + B + C:
print(2*A + B - K)
| A, B, C, K = map(int,input().split())
if K < A:
print(K)
if A <= K < A + B:
print(A)
if A + B <= K <= A + B + C:
print(2*A + B - K)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,061 | 409,062 | u699696451 | python |
p02682 | a,b,c,k=list(map(int,input().split()))
if a>k:
print(k)
elif a+b>=k and k>a:
print(a)
else:
k-=a+b
print(a-k) | a,b,c,k=list(map(int,input().split()))
if a>=k:
print(k)
elif a+b>=k and k>a:
print(a)
else:
k-=a+b
print(a-k) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,069 | 409,070 | u310381103 | python |
p02682 | a,b,c,k = list(map(int,input().split(' ')))
s = 0
s += a
k -=a
k -=b
s -= max(k , 0)
print(s ) | a,b,c,k = list(map(int,input().split(' ')))
s = 0
s += min( a , k)
k -=a
k -=b
s -= max(k , 0)
print(s) | [
"call.add",
"call.arguments.add"
] | 409,079 | 409,080 | u256110672 | python |
p02682 | a,b,c,k = list(map(int,input().split(' ')))
s = 0
s += a
k -=a
k -=b
s -= max(k , 0)
print(s) | a,b,c,k = list(map(int,input().split(' ')))
s = 0
s += min( a , k)
k -=a
k -=b
s -= max(k , 0)
print(s) | [
"call.add",
"call.arguments.add"
] | 409,081 | 409,080 | u256110672 | python |
p02682 | A,B,C,K = map(int, input().split())
s = K - A
m = 0
if s >= 0:
m += A
else:
print(K)
if s - B >= 0:
s -= B
else:
print(m)
if s - C >= 0:
print(m + (-C))
else:
print(m - s) | A,B,C,K = map(int, input().split())
s = K - A
m = 0
if s >= 0:
m += A
else:
print(K)
exit()
if s - B >= 0:
s -= B
else:
print(m)
exit()
if s - C >= 0:
print(m + (-C))
else:
print(m - s) | [
"call.add"
] | 409,087 | 409,088 | u458725980 | python |
p02682 | # ABC167 B
def main():
a, b, c, k = map(int, input().split())
total = 0
if a >= k:
print(a)
elif a+b >= k:
print(a)
else:
print(a - (k - a - b))
if __name__ == '__main__':
main() | # ABC167 B
def main():
a, b, c, k = map(int, input().split())
total = 0
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
print(a - (k - a - b))
if __name__ == '__main__':
main() | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,124 | 409,125 | u998679483 | python |
p02682 | A, B, C, K = map(int,input().split())
if k <= A:
print(K)
if A < K <= A + B:
print(A)
if A + B < K <= A + B + C:
print(2*A + B - K)
| A, B, C, K = map(int,input().split())
if K <= A:
print(K)
if A < K <= A + B:
print(A)
if A + B < K <= A + B + C:
print(2*A + B - K)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 409,126 | 409,127 | u845650912 | python |
p02682 | a,b,c,d=map(int,input().split())
h=k-a
h2=h-b
if a>k:
print(k)
else:
if h<=b:
print(a)
else:
print(a+h2*(-1)) | a,b,c,k=map(int,input().split())
h=k-a
h2=h-b
if a>k:
print(k)
else:
if h<=b:
print(a)
else:
print(a+h2*(-1)) | [
"assignment.variable.change",
"identifier.change"
] | 409,128 | 409,129 | u942356554 | python |
p02682 | A,B,C,K = map(int,input().split())
num = 0
if K <= A:
print(A)
else:
tmp1 = K-A
num = A
if tmp1 <= B:
print(A)
else:
tmp2 = tmp1-B
print(A+tmp2*(-1))
| A,B,C,K = map(int,input().split())
if K <= A:
print(K)
else:
tmp1 = K-A
num = A
if tmp1 <= B:
print(A)
else:
tmp2 = tmp1-B
print(A+tmp2*(-1)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,136 | 409,137 | u564657854 | python |
p02682 | a,b,c,k = [int(i) for i in input().split()]
if k<=a:
print(k)
elif a<k and k<=a+b:
s = a
print(s)
elif a+b<k<=a+c:
s = 2*a+b-k
print(s) | a,b,c,k = [int(i) for i in input().split()]
if k<=a:
print(k)
elif a<k and k<=a+b:
s = a
print(s)
elif a+b<k<=a+b+c:
s = 2*a+b-k
print(s) | [
"control_flow.branch.if.condition.change"
] | 409,147 | 409,148 | u260053458 | python |
p02682 | a, b, c, k = (int(x) for x in input().split())
ans = 0
if a <= k:
ans += a
k -= a
else:
ans += k
k = 0
k -= b
if k > 0:
ans -= (b - k)
print(ans) | a, b, c, k = (int(x) for x in input().split())
ans = 0
if a <= k:
ans += a
k -= a
else:
ans += k
k = 0
k -= b
if k > 0:
ans -= k
print(ans) | [] | 409,151 | 409,152 | u626529075 | python |
p02682 | def main():
abck = list(map(int, input().split()))
count = abck[3]
r = 0
r += min(abck[0], count)
count -= min(abck[0], count)
count -= min(abck[1], count)
count -= min(abck[2], count)
r -= min(abck[2], count)
print(r)
if __name__ == '__main__':
main() | def main():
abck = list(map(int, input().split()))
count = abck[3]
r = 0
r += min(abck[0], count)
count -= min(abck[0], count)
count -= min(abck[1], count)
r -= min(abck[2], count)
count -= min(abck[2], count)
print(r)
if __name__ == '__main__':
main() | [] | 409,153 | 409,154 | u382905693 | python |
p02682 | A,B,C,D = map(int,input().split())
count = 0
point = 0
if D-A <= 0:
point = A
D -= A
if D-B <= 0:
D -= B
if D-C <= 0:
point -= C
print(point)
else:
point -= D
print(point)
else:
print(point)
else:
point = D
print(po... | A,B,C,D = map(int,input().split())
count = 0
point = 0
if D-A >= 0:
point = A
D -= A
if D-B >= 0:
D -= B
if D-C >= 0:
point -= C
print(point)
else:
point -= D
print(point)
else:
print(point)
else:
point = D
print(po... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,155 | 409,156 | u917734688 | python |
p02682 | A,B,C,K = map(int,input().split())
if K <= A:
print(str(A))
else:
if K <= A + B:
print(str(A))
else:
print(str(A-(K-A-B))) | A,B,C,K = map(int,input().split())
if K <= A:
print(str(K))
else:
if K <= A + B:
print(str(A))
else:
print(str(A-(K-A-B))) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,161 | 409,162 | u830588156 | python |
p02682 | a,b,c,k=map(int,input().split())
if k<=a:
print(a)
else:
if k<=a+b:
print(a)
else:
print(2*a+b-k) | a,b,c,k=map(int,input().split())
if k<=a:
print(k)
else:
if k<=a+b:
print(a)
else:
print(2*a+b-k) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,170 | 409,171 | u048521352 | python |
p02682 | # S = input()
# N = int(input())
# A, B = map(int, input().split(' '))
# A = list(map(int, input().split(' ')))
A, B, C, K = map(int, input().split(' '))
result = 0
if A < K:
result += A
K -= A
else:
result = A
K -= A
if K > 0:
if B < K:
K -= B
else:
K -= B
if K > 0:
if C < K:
result -= C
... | # S = input()
# N = int(input())
# A, B = map(int, input().split(' '))
# A = list(map(int, input().split(' ')))
A, B, C, K = map(int, input().split(' '))
result = 0
if A < K:
result += A
K -= A
else:
result = K
K -= A
if K > 0:
if B < K:
K -= B
else:
K -= B
if K > 0:
if C < K:
result -= C
... | [
"assignment.value.change",
"identifier.change"
] | 409,172 | 409,173 | u661347997 | python |
p02682 | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgette... | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgette... | [
"call.add",
"call.arguments.add"
] | 409,184 | 409,185 | u480300350 | python |
p02682 | import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
A,B,C,K = LI()
ans = A
if A+B<=K:
ans -= K-(A+B)
print(ans)
| import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
A,B,C,K = LI()
ans = min(A,K)
if A+B<K:
ans -= K-(A+B)
print(ans)
| [
"call.add",
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,186 | 409,187 | u579699847 | python |
p02682 | A, B, C, K = map(int, input().split(" "))
ans = 0
if K - A >= 0:
ans += A
K -= A
elif K < A:
ans += A - K
K = 0
if K - B >= 0:
K -= B
elif K < B:
K = 0
if K > 0:
ans -= K
print(ans) | A, B, C, K = map(int, input().split(" "))
ans = 0
if K - A >= 0:
ans += A
K -= A
elif K < A:
ans += K
K = 0
if K - B >= 0:
K -= B
elif K < B:
K = 0
if K > 0:
ans -= K
print(ans) | [
"expression.operation.binary.remove"
] | 409,196 | 409,197 | u787131053 | python |
p02682 | A, B, C, K = map(int, input().split())
total = 0
if K <= A:
print(A)
exit()
else:
total += A
K -= A
if K <= B:
print(A)
exit()
else:
K -= B
if K <= C:
total -= K
else:
total -= C
print(total)
| A, B, C, K = map(int, input().split())
total = 0
if K <= A:
print(K)
exit()
else:
total += A
K -= A
if K <= B:
print(A)
exit()
else:
K -= B
if K <= C:
total -= K
else:
total -= C
print(total)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,202 | 409,203 | u885986895 | python |
p02682 | X=input().split(" ")
A=int(X[0])
B=int(X[1])
C=int(X[2])
K=int(X[3])
if K<=A:
print(K)
elif K<=A+B:
print(A)
else:
print(2*A-K) | X=input().split(" ")
A=int(X[0])
B=int(X[1])
C=int(X[2])
K=int(X[3])
if K<=A:
print(K)
elif K<=A+B:
print(A)
else:
print(2*A+B-K)
| [
"expression.operation.binary.add"
] | 409,212 | 409,213 | u831651889 | python |
p02682 | A,B,C,K=map(int,input().split())
ans=0
if A>=K:
ans=A
elif B>=(K-A):
ans=A
else:
ans=A-(K-A-B)
print(ans) | A,B,C,K=map(int,input().split())
ans=0
if A>=K:
ans=K
elif B>=(K-A):
ans=A
else:
ans=A-(K-A-B)
print(ans) | [
"assignment.value.change",
"identifier.change"
] | 409,220 | 409,221 | u206352909 | python |
p02682 | A,B,C,K=map(int,input().split())
ans=0
if A>=K:
ans=A
elif B>=(K-A):
ans=A
else:
ans=A-(K-A-B) | A,B,C,K=map(int,input().split())
ans=0
if A>=K:
ans=K
elif B>=(K-A):
ans=A
else:
ans=A-(K-A-B)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.add"
] | 409,222 | 409,221 | u206352909 | python |
p02682 | # -*- coding: utf-8 -*-
a, b, c, k = map(int, input().split())
max = 0
if a < k:
max = a
k -= a
if 0 < k:
k -= b
if 0 < k:
max -= k
else:
max = a
print(max)
| # -*- coding: utf-8 -*-
a, b, c, k = map(int, input().split())
max = 0
if a < k:
max = a
k -= a
if 0 < k:
k -= b
if 0 < k:
max -= k
else:
max = k
print(max)
| [
"assignment.value.change",
"identifier.change"
] | 409,227 | 409,228 | u616619529 | python |
p02682 | # -*- coding: utf-8 -*-
a, b, c, k = map(int, input().split())
max = 0
if a <= k:
max = a
k -= a
if b <= k:
k -= b
if 0 < k:
max -= k
else:
max = a
print(max)
| # -*- coding: utf-8 -*-
a, b, c, k = map(int, input().split())
max = 0
if a < k:
max = a
k -= a
if 0 < k:
k -= b
if 0 < k:
max -= k
else:
max = k
print(max)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 409,229 | 409,228 | u616619529 | python |
p02682 | import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools... | import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,230 | 409,231 | u197956883 | python |
p02682 | a, b, c, d = map(int, input().split())
goukei = 0
if a == d:
print(a)
elif d == (a+b):
print(a)
else:
goukei = (a - (d - a - b))
print(goukei)
| a, b, c, d = map(int, input().split())
goukei = 0
if a >= d:
print(d)
elif d <= (a+b):
print(a)
else:
goukei = a - (d - a - b)
print(goukei)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,234 | 409,235 | u605327527 | python |
p02682 | A,B,C,K = map(int,input().split())
ans=0
sum_AB = A+B
if K>=A:
ans += A
else:
ans+=K
print(ans)
if sum_AB<=K:
ans-=K-A-B
print(ans)
| A,B,C,K = map(int,input().split())
ans=0
sum_AB = A+B
if K>=A:
ans += A
else:
ans+=K
if sum_AB<=K:
ans-=K-A-B
print(ans)
| [
"call.remove"
] | 409,238 | 409,239 | u728095140 | python |
p02682 | mNum = map(int, input().split())
lNum = list(mNum)
weight = [1, 0, -1]
sumAns = 0
for i in range(3):
sumAns += lNum[i] * weight[i] if lNum[i] <= lNum[3] else lNum[3] * weight[i]
lNum[3] -= lNum[i]
if(lNum[i] <= 0):
break
print(sumAns) | mNum = map(int, input().split())
lNum = list(mNum)
weight = [1, 0, -1]
sumAns = 0
for i in range(3):
sumAns += lNum[i] * weight[i] if lNum[i] <= lNum[3] else lNum[3] * weight[i]
lNum[3] -= lNum[i]
if(lNum[3] <= 0):
break
print(sumAns) | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 409,248 | 409,249 | u082945913 | python |
p02682 | A, B, C, K = map(int, input().split())
sum = 0
if K >= A:
sum = A
K -= A
if K > B:
K -= B
sum -= K
print(sum)
else:
print(sum)
else:
sum = A - K
print(sum) | A, B, C, K = map(int, input().split())
sum = 0
if K >= A:
sum = A
K -= A
if K > B:
K -= B
sum -= K
print(sum)
else:
print(sum)
else:
sum = K
print(sum) | [
"expression.operation.binary.remove"
] | 409,256 | 409,257 | u766566560 | python |
p02682 | a,b,c,k=list(map(int,input().split()))
if a>=k:
print(k)
else:
if a+b>=k:
print(a)
else:
print(a-(k-c))
| a,b,c,k=list(map(int,input().split()))
if a>=k:
print(k)
else:
if a+b>=k:
print(a)
else:
print(a-(k-a-b))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,268 | 409,269 | u437351386 | python |
p02682 | A, B, C, K = map(int, input().split())
if( K <= A ):
print(K)
elif( K > A and K <= A + B):
print(A)
else:
print(A - ( K - C)) | A, B, C, K = map(int, input().split())
if( K <= A ):
print(K)
elif( K > A and K <= A + B):
print(A)
else:
print(A - ( K - (A + B))) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,272 | 409,273 | u694649864 | python |
p02682 | A, B, C, K = map(int, input().split())
num = K
score = 0
if A >= num:
score = A
else:
num -= A
score += A
if B >= num:
pass
else:
num -= B
score -= num
print(score) | A, B, C, K = map(int, input().split())
num = K
score = 0
if A >= num:
score = K
else:
num -= A
score += A
if B >= num:
pass
else:
num -= B
score -= num
print(score) | [
"assignment.value.change",
"identifier.change"
] | 409,274 | 409,275 | u567430603 | python |
p02682 | A, B, C, K = list(map(int, input().split()))
number_of_A = min(A, K)
remainder = K - number_of_A
number_of_B = min(B, remainder)
remainder = remainder - B
number_of_C = remainder
total = (number_of_A * 1) + \
(number_of_B * 0) + \
(number_of_C * -1)
print(total)
| A, B, C, K = list(map(int, input().split()))
number_of_A = min(A, K)
remainder = K - number_of_A
number_of_B = min(B, remainder)
remainder = remainder - number_of_B
number_of_C = remainder
total = (number_of_A * 1) + \
(number_of_B * 0) + \
(number_of_C * -1)
print(total)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 409,278 | 409,279 | u017624958 | python |
p02682 | def readinput():
a,b,c,k = list(map(int,input().split()))
return a,b,c,k
def main(a,b,c,k):
if(a>=k):
return a
k2=k-a
if(b>=k2):
return a
k3=k2-b
return a-k3
if __name__=='__main__':
a,b,c,k=readinput()
ans=main(a,b,c,k)
print(ans)
| def readinput():
a,b,c,k = list(map(int,input().split()))
return a,b,c,k
def main(a,b,c,k):
if(a>=k):
return k
k2=k-a
if(b>=k2):
return a
k3=k2-b
return a-k3
if __name__=='__main__':
a,b,c,k=readinput()
ans=main(a,b,c,k)
print(ans)
| [
"identifier.change",
"function.return_value.change"
] | 409,285 | 409,286 | u592547545 | python |
p02682 | a,b,c,k = map(int,input().split())
if(a>=k):
print(a)
else:
if(a+b>=k):
print(a)
else:
print(a-(k-(a+b))) | a,b,c,k = map(int,input().split())
if(a>=k):
print(k)
else:
if(a+b>=k):
print(a)
else:
print(a-(k-(a+b))) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,287 | 409,288 | u655048024 | python |
p02682 | A, B, C, K = map(int,input().split())
if K - A <= 0:
print(A * 1)
elif K - A - B <= 0:
print(A * 1)
else:
temp = K - A - B
print(A * 1 + temp * -1) | A, B, C, K = map(int,input().split())
if K - A <= 0:
print(K * 1)
elif K - A - B <= 0:
print(A * 1)
else:
temp = K - A - B
print(A * 1 + temp * -1) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,291 | 409,292 | u682523312 | python |
p02682 | #!/usr/bin/env python3
a, b, c, k = map(int, input().split())
ans = min(a, k)*1 + min(b, k-a)*0 + min(c, k-a-b)*(-1)
print(ans)
| #!/usr/bin/env python3
a, b, c, k = map(int, input().split())
ans = min(a, k)*1 + min(b, k-a)*0 + max(k-a-b,0)*(-1)
print(ans)
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 409,295 | 409,296 | u998741086 | python |
p02682 | a, b, c, k = map(int, input().split())
if a>=k:
print(a*1)
else:
if b>=k-a:
print(a*1)
else:
print(a*1 + (k-a-b)*(-1)) | a, b, c, k = map(int, input().split())
if a>=k:
print(k*1)
else:
if b>=k-a:
print(a*1)
else:
print(a*1 + (k-a-b)*(-1)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,297 | 409,298 | u520843951 | python |
p02682 | import sys
sys.setrecursionlimit(10**6)
def main(input, print):
a, b, c, k = map(int, input().split())
ans = 0
if a >= k:
print(a)
return
k -= a
if b >= k:
print(a)
return
k -= b
print(a-k)
if __name__ == '__main__':
main(sys.stdin.readline, print)
| import sys
sys.setrecursionlimit(10**6)
def main(input, print):
a, b, c, k = map(int, input().split())
ans = 0
if a >= k:
print(k)
return
k -= a
if b >= k:
print(a)
return
k -= b
print(a-k)
if __name__ == '__main__':
main(sys.stdin.readline, print)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,299 | 409,300 | u927078824 | python |
p02682 | a, b, c, k = map(int, input().split())
if a >= k:
sum = 1 * a
else:
if b >= k - a:
sum = 1 * a + 0 * (k-a)
else:
if c >= k - a - b:
sum = 1 * a + 0 * b - 1 * (k-a-b)
else:
sum = 1 * a + 0 * b - 1 * c
print(sum) | a, b, c, k = map(int, input().split())
if a >= k:
sum = 1 * k
else:
if b >= k - a:
sum = 1 * a + 0 * (k-a)
else:
if c >= k - a - b:
sum = 1 * a + 0 * b - 1 * (k-a-b)
else:
sum = 1 * a + 0 * b - 1 * c
print(sum) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 409,307 | 409,308 | u175746978 | python |
p02682 | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
A, B, C, K = map(int, readline().split())
if A + B >= K:
print(A)
else:
tmp = K - A - B
print(A-tmp)
if __name__ == "__main__":
main()
| import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
A, B, C, K = map(int, readline().split())
if A + B >= K:
print(min(A,K))
else:
tmp = K - A - B
print(A-tmp)
if __name__ == "__main__":
main()
| [
"call.add",
"call.arguments.add"
] | 409,321 | 409,322 | u125545880 | python |
p02682 | A, B, C, K = map(int, input().split())
count = 0
if K >= A:
count += A
K -= A
else:
count = A
K = 0
if K != 0:
if K>=B:
K -= B
else:
K= 0
if K != 0:
count -= K
print(count) | A, B, C, K = map(int, input().split())
count = 0
if K >= A:
count += A
K -= A
else:
count = K
K = 0
if K != 0:
if K>=B:
K -= B
else:
K= 0
if K != 0:
count -= K
print(count) | [
"assignment.value.change",
"identifier.change"
] | 409,326 | 409,327 | u446601167 | python |
p02682 | A, B, C, K = map(int, input().split())
count = 0
if K >= A:
count += A
K -= A
else:
count = A
K = 0
print(count)
if K != 0:
if K>=B:
K -= B
else:
K= 0
if K != 0:
count -= K
print(count) | A, B, C, K = map(int, input().split())
count = 0
if K >= A:
count += A
K -= A
else:
count = K
K = 0
if K != 0:
if K>=B:
K -= B
else:
K= 0
if K != 0:
count -= K
print(count) | [
"assignment.value.change",
"identifier.change",
"call.remove"
] | 409,328 | 409,327 | u446601167 | python |
p02682 |
[a,b,c,k] = [int(x) for x in input().split()]
if a >= k:
print(a)
elif a+b >= k:
print(a)
else:
print(a-(k-a-b)) |
[a,b,c,k] = [int(x) for x in input().split()]
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
print(a-(k-a-b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,331 | 409,332 | u013956357 | python |
p02682 | A, B, C, K = (int(x) for x in input().split())
total = 0
if A >= K:
total = A
elif B >= (K-A):
total = A
elif C >= (K-A-B):
total = A-(K-A-B)
print(total) | A, B, C, K = (int(x) for x in input().split())
total = 0
if A >= K:
total = K
elif B >= (K-A):
total = A
elif C >= (K-A-B):
total = A-(K-A-B)
print(total) | [
"assignment.value.change",
"identifier.change"
] | 409,339 | 409,340 | u868082223 | python |
p02682 | a,b,c,k = map(int,input().split())
ans = 0
if k <= a:
ans = k
elif k <= b+a:
ans = a
else:
ans = a - (k-c)
print(ans)
| a,b,c,k = map(int,input().split())
ans = 0
if k <= a:
ans = k
elif k <= b+a:
ans = a
else:
ans = a - (k-(a+b))
print(ans) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 409,351 | 409,352 | u829873835 | python |
p02682 | A, B, C, K = map(int, input().split())
if A + B >= K:
print(A)
else:
print(A-(K-(A+B)))
| A, B, C, K = map(int, input().split())
if A + B >= K:
print(min(A, K))
else:
print(A-(K-(A+B)))
| [
"call.add",
"call.arguments.add"
] | 409,353 | 409,354 | u133566678 | python |
p02682 | A, B, C, K = map(int,input().split())
sum = 0
n = 0
if K - A > 0:
sum = A*1
n = K - A
if B > n:
n = n - B
sum += (-1) * n
else:
sum = K*1
print(sum) | A, B, C, K = map(int,input().split())
sum = 0
n = 0
if K - A > 0:
sum = A
n = K - A
if B < n:
n = n - B
sum += (-1) * n
else:
sum = K
print(sum) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,361 | 409,362 | u321804710 | python |
p02682 | if __name__ == "__main__":
a,b,c, k = map(int, input().split())
if a >= k:
print(a)
else:
if b >=k - a:
print(a)
else:
minus = k - (a + b)
print(a - minus)
| if __name__ == "__main__":
a,b,c, k = map(int, input().split())
if a >= k:
print(k)
else:
if b >=k - a:
print(a)
else:
minus = k - (a + b)
print(a - minus)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,363 | 409,364 | u273956323 | python |
p02682 | A,B,C,K = map(int, input().split())
if A >= K:
print(A)
else:
K = K - A
if B >= K:
print(A)
else:
K = K - B
print(A-K) | A,B,C,K = map(int, input().split())
if A >= K:
print(K)
else:
K = K - A
if B >= K:
print(A)
else:
K = K - B
print(A-K)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,365 | 409,366 | u727072969 | python |
p02682 | from sys import stdin
a, b, c, k = [int(_) for _ in stdin.readline().rstrip().split()]
if a > k:
print(k)
elif a < k and a+b > k:
print(a)
else:
print(a - (k-a-b))
| from sys import stdin
a, b, c, k = [int(_) for _ in stdin.readline().rstrip().split()]
if a >= k:
print(k)
elif a < k and a+b >= k:
print(a)
else:
print(a - (k-a-b)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,374 | 409,375 | u911531682 | python |
p02682 | A,B,C,K=map(int,input().split())
if K<=A+B:
print(A)
else:
print(A-(K-A-B)) | A,B,C,K=map(int,input().split())
if K<=A+B:
print(min(A,K))
else:
print(A-(K-A-B)) | [
"call.add",
"call.arguments.add"
] | 409,376 | 409,377 | u539514977 | python |
p02682 | A, B, C, K = map(int, input().split())
if (A+B) == K:
print(A)
elif (A+B) > K:
if a > K:
print(K)
else:
print(A)
elif (A+B) < K:
print(A - (K - (A+B)))
| A, B, C, K = map(int, input().split())
if (A+B) == K:
print(A)
elif (A+B) > K:
if A > K:
print(K)
else:
print(A)
elif (A+B) < K:
print(A - (K - (A+B)))
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 409,382 | 409,383 | u838651937 | python |
p02682 | A,B,C,K = map(int,input().split())
if K <= A:
print(A * 1)
else:
c = A * 1
if K <= A + B:
pass
else:
if K <= A + B + C:
c += (K - A - B) * -1
else:
c += C * -1
print(c)
| A,B,C,K = map(int,input().split())
if K <= A:
print(K * 1)
else:
c = A * 1
if K <= A + B:
pass
else:
if K <= A + B + C:
c += (K - A - B) * -1
else:
c += C * -1
print(c)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,384 | 409,385 | u339503988 | python |
p02682 | def main():
A, B, C, D = map(int, input().split())
K = D
D -= A
if K <= 0:
print(min(A, K))
exit()
D -= B
if D <= 0:
print(A)
else:
print(A - D)
if __name__ == "__main__":
main() | def main():
A, B, C, D = map(int, input().split())
K = D
D -= A
if D <= 0:
print(min(A, K))
exit()
D -= B
if D <= 0:
print(A)
else:
print(A - D)
if __name__ == "__main__":
main() | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 409,399 | 409,400 | u707498674 | python |
p02682 | a, b, c, k = map(int, input().split())
num = 0
if k >= a:
num += a
k -= a
if k >= b:
k -= b
if k > 0:
num -= k
else:
num += a
print(num) | a, b, c, k = map(int, input().split())
num = 0
if k >= a:
num += a
k -= a
if k >= b:
k -= b
if k > 0:
num -= k
else:
num += k
print(num) | [
"identifier.change"
] | 409,403 | 409,404 | u928347588 | python |
p02682 | a,b,c,k = map(int,input().split())
if k<=a:
print(a)
else:
x = k-a
if x<=b:
print(a)
else:
print(a-(x-b)) |
a,b,c,k = map(int,input().split())
if k<=a:
print(k)
else:
x = k-a
if x<=b:
print(a)
else:
print(a-(x-b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,409 | 409,410 | u953379577 | python |
p02682 | A,B,C,A,B,C,K=map(int,input().split())
if K<=A:
print(K)
elif A<K<=A+B:
print(A)
elif A+B<K<=A+B+C:
print(2*A+B-K)
| A,B,C,K=map(int,input().split())
if K<=A:
print(K)
elif A<K<=A+B:
print(A)
elif A+B<K<=A+B+C:
print(2*A+B-K) | [] | 409,419 | 409,420 | u697422981 | python |
p02682 | A, B, C ,K = map(int, input().split())
score = 0
if A >= K :
print(A)
else:
score += A
K = K - A
if B >= K :
print(score)
else:
K = K - B
print(score - K) | A, B, C ,K = map(int, input().split())
score = 0
if A >= K :
print(K)
else:
score += A
K = K - A
if B >= K :
print(score)
else:
K = K - B
print(score - K) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,423 | 409,424 | u812891913 | python |
p02682 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"call.add",
"call.arguments.add"
] | 409,427 | 409,428 | u191874006 | python |
p02682 | a,b,c,k = map(int,input().split())
if k <= a:
print(a)
elif a < k and k <= a + b:
print(a)
elif a + b < k:
print(a - (k - a - b)) | a,b,c,k = map(int,input().split())
if k <= a:
print(k)
elif a < k and k <= a + b:
print(a)
elif a + b < k:
print(a - (k - a - b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,437 | 409,438 | u991269553 | python |
p02682 | a, b, c, k = map(int, input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
elif k < a+b+c:
print(2*a+b-k)
else:
print(a-b) | a, b, c, k = map(int, input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
elif k < a+b+c:
print(2*a+b-k)
else:
print(a-c)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,441 | 409,442 | u531427291 | python |
p02682 | A, B, C, K = map(int, input().split())
print(min(A, K)-min(K-A-B, C)) | A, B, C, K = map(int, input().split())
print(min(A, K)-min(max(0, K-A-B), C)) | [
"call.add",
"call.arguments.change"
] | 409,446 | 409,447 | u529012223 | python |
p02682 | x = list(map(int, input().split()))
a = x[0]
b = x[1]
c = x[2]
k = x[3]
if a >= k:
print(a)
else:
count = k - a
if b >= count:
print(a)
else:
count = k - a - b
ans = a - count
print(ans) | x = list(map(int, input().split()))
a = x[0]
b = x[1]
c = x[2]
k = x[3]
if a >= k:
print(k)
else:
count = k - a
if b >= count:
print(a)
else:
count = k - a - b
ans = a - count
print(ans) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,451 | 409,452 | u244423127 | python |
p02682 | import itertools
import numpy as np
A,B,C,K = map(int,input().split())
if A+B>=K:
print(A)
else:
print(A-(K-A-B)) | import itertools
import numpy as np
A,B,C,K = map(int,input().split())
if A+B>=K:
print(min(A,K))
else:
print(A-(K-A-B)) | [
"call.add",
"call.arguments.add"
] | 409,456 | 409,457 | u005317312 | python |
p02682 | import itertools
import numpy as np
A,B,C,K = map(int,input().split())
if A+B>K:
print(A)
else:
print(A-(K-A-B)) | import itertools
import numpy as np
A,B,C,K = map(int,input().split())
if A+B>=K:
print(min(A,K))
else:
print(A-(K-A-B)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 409,458 | 409,457 | u005317312 | python |
p02682 | import sys
A,B,C,K = map(int,(input().split()))
point = 0
if(K<=A):
point=A
print(point)
sys.exit()
else:
point+=A
K-=A
if(K<=B):
print(point)
sys.exit()
else:
K-=B
point-=K
print(point) | import sys
A,B,C,K = map(int,(input().split()))
point = 0
if(K<=A):
point=K
print(point)
sys.exit()
else:
point+=A
K-=A
if(K<=B):
print(point)
sys.exit()
else:
K-=B
point-=K
print(point) | [
"assignment.value.change",
"identifier.change"
] | 409,467 | 409,468 | u382407432 | python |
p02682 | A, B, C, K = map(int, input().split())
if K <= A:
print(A)
elif A < K <= A+B:
print(A)
else:
K -= (A+B)
print(A-K) | A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif A < K <= A+B:
print(A)
else:
K -= (A+B)
print(A-K) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,469 | 409,470 | u461833298 | python |
p02682 | A, B, C, K = map(int, input().split())
if K <= A:
print(A)
elif K <= (A + B):
print(A)
else:
K -= (A+B)
print(A - K) | A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif A < K <= A+B:
print(A)
else:
K -= (A+B)
print(A-K) | [
"identifier.change",
"call.arguments.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 409,471 | 409,470 | u461833298 | python |
p02682 | A, B, C, K = map(int, input().split())
total = 0
if K <= A:
total = A*1
elif A < K and K <= A+B:
total = A*1 + (K - A)*0
else:
total = A*1 + B*0 + (K - A - B)*(-1)
print(total) | A, B, C, K = map(int, input().split())
total = 0
if K <= A:
total = K*1
elif A < K and K <= A+B:
total = A*1 + (K - A)*0
else:
total = A*1 + B*0 + (K - A - B)*(-1)
print(total) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 409,474 | 409,475 | u523087093 | python |
p02682 | a, b, c, k = map(int, input().split())
for i in range(3):
if i == 0:
if k <= a:
print(k)
break
else:
k -= a
elif i == 1:
if k <= b:
print(a)
break
else:
k -= b
elif i == 2:
if k < c:
... | a, b, c, k = map(int, input().split())
for i in range(3):
if i == 0:
if k <= a:
print(k)
break
else:
k -= a
elif i == 1:
if k <= b:
print(a)
break
else:
k -= b
elif i == 2:
if k <= c:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 409,476 | 409,477 | u643679148 | python |
p02682 | a,b,c,d=[int(x) for x in input().split()]
count=a
sum=a
if count==d:
print(a)
else:
count=count+b
if count<d:
if d-count<=c:
print(sum+((d-count)*-1))
else:
print(sum+(c*-1))
else:
print(sum) | a,b,c,d=[int(x) for x in input().split()]
count=a
sum=a
if count>=d:
print(d)
else:
count=count+b
if count<d:
if d-count<=c:
print(sum+((d-count)*-1))
else:
print(sum+(c*-1))
else:
print(sum) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,493 | 409,494 | u412047585 | python |
p02682 | a,b,c,k=map(int,input().split())
if a>=k:
print(max(a,k))
elif a+b>=k:
print(a)
else:
x=k-a-b
print(a-x)
| a,b,c,k=map(int,input().split())
if a>=k:
print(min(a,k))
elif a+b>=k:
print(a)
else:
x=k-a-b
print(a-x)
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 409,495 | 409,496 | u353652911 | python |
p02682 | # coding:utf-8
a, b, c, k = map(int, input().split())
point = 0
if k <= a:
point += a
elif k > a and (k - a) <= b:
point += a
elif k > a and (k - a) > b:
point = a + (-1) * (k - a - b)
print(point)
| # coding:utf-8
a, b, c, k = map(int, input().split())
point = 0
if k <= a:
point += k
elif k > a and (k - a) <= b:
point += a
elif k > a and (k - a) > b:
point = a + (-1) * (k - a - b)
print(point)
| [
"identifier.change"
] | 409,499 | 409,500 | u167908302 | python |
p02682 | A, B, C, K = map(int, input().split())
if A + B < K:
print(A - (K - (A + B)))
else:
print(A) | A, B, C, K = map(int, input().split())
if A + B < K:
print(A - (K - (A + B)))
else:
print(min(K, A)) | [
"call.add",
"call.arguments.change"
] | 409,503 | 409,504 | u637918426 | python |
p02682 | a,b,c,k = map(int,input().split())
if k <= a:
print(k)
else:
if k>a and k <= a+b:
print(a)
else:
print(k-a)
| a,b,c,k = map(int,input().split())
if k <= a:
print(k)
else:
if k>a and k <= a+b:
print(a)
else:
print(a-(k-a-b))
| [
"call.arguments.add"
] | 409,525 | 409,526 | u550257207 | python |
p02682 | a, b, c, k = list(map(int, input().split()))
score = 0
if k >= a:
score += a
k -= a
if k >= b:
k -= b
if k >= c:
score -= c
else:
score -= k
else:
score = a
print(score)
| a, b, c, k = list(map(int, input().split()))
score = 0
if k >= a:
score += a
k -= a
if k >= b:
k -= b
if k >= c:
score -= c
else:
score -= k
else:
score += k
print(score)
| [] | 409,530 | 409,531 | u494748969 | python |
p02682 | a,b,c,k = map(int,input().split())
if a >= k:
print(a)
elif a + b >= k:
print(a)
else:
print(a-((a+b)-k)*-1) | a,b,c,k = map(int,input().split())
if a >= k:
print(k)
elif a + b >= k:
print(a)
else:
print(a-((a+b)-k)*-1) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,532 | 409,533 | u254221913 | python |
p02682 | a,b,c,k = map(int,input().split())
if a > k:
print(a)
elif a + b > k:
print(a)
else:
print(a-((a+b)-k)*-1) | a,b,c,k = map(int,input().split())
if a >= k:
print(k)
elif a + b >= k:
print(a)
else:
print(a-((a+b)-k)*-1) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 409,534 | 409,533 | u254221913 | python |
p02682 | # n = int(input())
a, b, c, k = map(int, input().split())
# l = list(map(int, input().split()))
if k <= a:
print(k)
elif a < k <= a+b:
print(a)
elif a+b < k <= a+b+c:
# print(a - (k - a))
print(a-(c - b)) | # n = int(input())
a, b, c, k = map(int, input().split())
# l = list(map(int, input().split()))
if k <= a:
print(k)
elif a < k <= a+b:
print(a)
elif a+b < k <= a+b+c:
# print(a - (k - a))
print(a-(k - a - b)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 409,546 | 409,547 | u353895424 | python |
p02682 | A, B, C, K = map(int, input().split())
if K < A:
print(K)
elif A <= K <= A + B:
print(A)
else:
print(A - (K - A)) | A, B, C, K = map(int, input().split())
if K < A:
print(K)
elif A <= K <= A + B:
print(A)
else:
print(A - (K - A - B)) | [
"expression.operation.binary.add"
] | 409,550 | 409,551 | u417096287 | python |
p02682 | a, b, c, k = map(int, input().split())
sum = 0
if k > a:
sum = a
if k-a <= b:
sum = a
else:
sum = 2*a+b-k
print(sum) | a, b, c, k = map(int, input().split())
sum = k
if k > a:
sum = a
if k-a <= b:
sum = a
else:
sum = 2*a+b-k
print(sum) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 409,554 | 409,555 | u518085378 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.