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 9
values |
|---|---|---|---|---|---|---|---|
p02817
|
s, t = map(str, input().split())
print(s+t)
|
s, t = map(str, input().split())
print(t+s)
|
[
"expression.operation.binary.remove"
] | 620,288
| 620,289
|
u595716769
|
python
|
p02817
|
a,b=map(str,input().split())
print(a,end="")
print(b)
|
a,b=map(str,input().split())
print(b,end="")
print(a)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 620,292
| 620,293
|
u777028980
|
python
|
p02817
|
#A
s, t = list(map(str,input().split()))
print(''.join(s+t))
|
#A
s, t = list(map(str,input().split()))
print(''.join(t+s))
|
[
"expression.operation.binary.remove"
] | 620,302
| 620,303
|
u386170566
|
python
|
p02817
|
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
S, T = input().split()
print(S + T)
|
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
S, T = input().split()
print(T + S)
|
[
"expression.operation.binary.remove"
] | 620,306
| 620,307
|
u588341295
|
python
|
p02817
|
S, T = map(str, input.split())
A = T[:] + S[:]
print(A)
|
S, T = map(str, input().split())
A = T[:] + S[:]
print(A)
|
[
"call.add"
] | 620,310
| 620,311
|
u984276646
|
python
|
p02818
|
a, b, k = map(int, input().split())
takahasi = max(0, a - k)
aoki = max(0, b - (k - a))
print(takahasi, aoki)
|
a, b, k = map(int, input().split())
takahasi = max(0, a - k)
aoki = max(0, b - max(0, k - a))
print(takahasi, aoki)
|
[
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 620,330
| 620,331
|
u833963136
|
python
|
p02818
|
A, B, K = map(int, input().split())
if K<=A:
print(A-K, B)
elif A<K<=B:
print(0, B-(K-A))
else:
print(0,0)
"""
for k in range(K):
if A>0 and B!=0:
A+=-1
elif A==0 and B>0:
B+=-1
elif A==0 & B==0:
break
print(A, B)
"""
|
A, B, K = map(int, input().split())
if K<=A:
print(A-K, B)
elif A<K<=(A+B):
print(0, B-(K-A))
else:
print(0,0)
"""
for k in range(K):
if A>0 and B!=0:
A+=-1
elif A==0 and B>0:
B+=-1
elif A==0 & B==0:
break
print(A, B)
"""
|
[
"control_flow.branch.if.condition.change"
] | 620,332
| 620,333
|
u378691508
|
python
|
p02818
|
a, b, k = map(int, input().split())
if k <= a: print(a - k, b)
elif 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 k <= a + b: print(0, a + b - k)
else: print(0, 0)
|
[
"control_flow.branch.if.condition.change"
] | 620,336
| 620,337
|
u658915215
|
python
|
p02818
|
A, B, K = list(map(int, input().split()))
a = max(A - K, 0)
b = max(B - (K - A), 0)
print(a, b)
|
A, B, K = list(map(int, input().split()))
a = max(A - K, 0)
b = max(B - max((K - A), 0), 0)
print(a, b)
|
[
"call.add",
"call.arguments.add"
] | 620,338
| 620,339
|
u364774090
|
python
|
p02818
|
A, B, K = list(map(lambda x: int(x), input().split(" ")))
if A >= K:
print(str(A - K) + " " + str(B))
elif A + B >= K:
print("0 " + str(B - K))
else:
print("0 0")
|
A, B, K = list(map(lambda x: int(x), input().split(" ")))
if A >= K:
print(str(A - K) + " " + str(B))
elif A + B >= K:
print("0 " + str(A + B - K))
else:
print("0 0")
|
[
"expression.operation.binary.add"
] | 620,344
| 620,345
|
u739843002
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a>=k:
print(a-k,b)
elif a<k and b>=k:
print(0,b-(k-a))
else:
print(0,0)
|
a, b, k = map(int, input().split())
if a>=k:
print(a-k,b)
elif a<k and a+b>k:
print(0,b-(k-a))
else:
print(0,0)
|
[
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 620,356
| 620,357
|
u736479342
|
python
|
p02818
|
a,b,k=map(int,input().split())
print(a-k,b) if a>=k else print(0-b-k+a) if k<=a+b else print(0,0)
|
a,b,k=map(int,input().split())
print(a-k,b) if a>=k else print(0,b-k+a) if k<=a+b else print(0,0)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 620,358
| 620,359
|
u388297793
|
python
|
p02818
|
def resolve():
A, B, K = list(map(int, input().split()))
taka = max(A-K, 0)
ao = B-(K-A) if K > A else B
print(taka, ao)
if '__main__' == __name__:
resolve()
|
def resolve():
A, B, K = list(map(int, input().split()))
taka = max(A-K, 0)
ao = max(B-(K-A), 0) if K > A else B
print(taka, ao)
if '__main__' == __name__:
resolve()
|
[
"call.add",
"call.arguments.add"
] | 620,367
| 620,368
|
u106797249
|
python
|
p02818
|
def resolve():
A, B, K = list(map(int, input().split()))
taka = max(A-K, 0)
ao = B-(K-A) if K > A else 0
print(taka, ao)
if '__main__' == __name__:
resolve()
|
def resolve():
A, B, K = list(map(int, input().split()))
taka = max(A-K, 0)
ao = max(B-(K-A), 0) if K > A else B
print(taka, ao)
if '__main__' == __name__:
resolve()
|
[
"call.add",
"call.arguments.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 620,369
| 620,368
|
u106797249
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A >= K:
print(A - K, B)
if A < K and (A + B) >= K:
print(0, (B - (K - A)))
else:
print(0, 0)
|
A, B, K = map(int, input().split())
if A >= K:
print(A - K, B)
elif A < K and (A + B) >= K:
print(0, (B - (K - A)))
else:
print(0, 0)
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 620,370
| 620,371
|
u627691992
|
python
|
p02818
|
a, b, k = map(int, input().split())
print(0 if a < k else a - k, b + (a - k) if a < k else b)
|
a, b, k = map(int, input().split())
print(0 if a < k else a - k, max(0, b + (a - k)) if a < k else b)
|
[
"call.add",
"call.arguments.change"
] | 620,373
| 620,374
|
u279266699
|
python
|
p02818
|
A, B, K = map(int, input().split())
A_after = 0
B_after = 0
if A - K >= 0:
A_after = A - K
elif A + B - K >= 0:
B_after = B - (K - A)
print(A_after, B_after)
|
A, B, K = map(int, input().split())
A_after = 0
B_after = 0
if A - K >= 0:
A_after = A - K
B_after = B
elif A + B - K >= 0:
B_after = B - (K - A)
print(A_after, B_after)
|
[
"assignment.add"
] | 620,381
| 620,382
|
u630467326
|
python
|
p02818
|
a, b, k = map(int, input().split())
a = a-k
if a < 0:
b += k
print(max(a, 0), max(b, 0))
|
a, b, k = map(int, input().split())
a = a-k
if a < 0:
b += a
print(max(a, 0), max(b, 0))
|
[
"identifier.change"
] | 620,383
| 620,384
|
u729627789
|
python
|
p02818
|
A, B, K = [int(s) for s in input().split(' ')]
print(max(0, A - K), max(0, (B - (K - A))))
|
A, B, K = [int(s) for s in input().split(' ')]
print(max(0, A - K), max(0, (B - max(0, K - A))))
|
[
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 620,387
| 620,388
|
u099450021
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
if a+b<k:
print(0,0)
else:
print(0,a+b-k)
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
elif a+b<k:
print(0,0)
else:
print(0,a+b-k)
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 620,393
| 620,394
|
u430726059
|
python
|
p02818
|
A, B, K = map(int, input().split())
a = max(0, A - K)
if K - A > 0:
b = max(0, B - K + A)
print(a, b)
|
A, B, K = map(int, input().split())
a = max(0, A - K)
b = B
if K - A > 0:
b = max(0, B - K + A)
print(a, b)
|
[
"assignment.add"
] | 620,402
| 620,403
|
u271469978
|
python
|
p02818
|
a,b,k = map(int, input().split())
m = k if a > k else a
a -= m
b -= k-m
print(f'{a} {b}')
|
a,b,k = map(int, input().split())
m = k if a > k else a
a -= m
b -= min(k-m, b)
print(f'{a} {b}')
|
[
"call.add",
"call.arguments.add"
] | 620,408
| 620,409
|
u127873832
|
python
|
p02818
|
def greedyTakahashi(a, b, k):
a -= k
if a < 0:
return (0, b+a) if b+a > 0 else (0, 0)
else :
return (a, b)
def main():
a, b, k = map(int, input().split())
print(greedyTakahashi(a, b, k))
if __name__ == '__main__':
main()
|
def greedyTakahashi(a, b, k):
a -= k
if a < 0:
return (0, b+a) if b+a > 0 else (0, 0)
else :
return (a, b)
def main():
a, b, k = map(int, input().split())
print(*greedyTakahashi(a, b, k))
if __name__ == '__main__':
main()
|
[
"call.arguments.change"
] | 620,410
| 620,411
|
u488934106
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>k:
print(a-k,b)
elif a+b>k:
print(0,a-(k-a))
else:
print(0,0)
|
a,b,k=map(int,input().split())
if a>k:
print(a-k,b)
elif a+b>k:
print(0,b-(k-a))
else:
print(0,0)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 620,414
| 620,415
|
u674934587
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k:a-=k
else:
b=max(b-k-a,0)
a=0
print(a,b)
|
a,b,k=map(int,input().split())
if a>=k:a-=k
else:
b=max(b-k+a,0)
a=0
print(a,b)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 620,416
| 620,417
|
u730769327
|
python
|
p02818
|
a, b, k = map(int, input().split())
after_a = max(0, a - k)
if after_a == 0:
k -= a
after_b = max(0, b - k)
print(after_a, after_b)
|
a, b, k = map(int, input().split())
after_a = max(0, a - k)
after_b = b
if after_a == 0:
k -= a
after_b = max(0, b - k)
print(after_a, after_b)
|
[
"assignment.add"
] | 620,418
| 620,419
|
u941644149
|
python
|
p02818
|
A,B,K = map(int,input().split())
if A <= K:
K -= A
A = 0
print(K)
else:
A -= K
K = 0
if B <= K:
K -= B
B = 0
else:
B -= K
K = 0
print(A,B)
|
A,B,K = map(int,input().split())
if A <= K:
K -= A
A = 0
else:
A -= K
K = 0
if B <= K:
K -= B
B = 0
else:
B -= K
K = 0
print(A,B)
|
[
"call.remove"
] | 620,440
| 620,441
|
u967484343
|
python
|
p02818
|
A, B, K = map(int, input().split())
if K <= A:
print(K - A, B)
elif K >= A + B:
print(0, 0)
else:
print(0, A + B - K)
|
A, B, K = map(int, input().split())
if K <= A:
print(A - K, B)
elif K >= A + B:
print(0, 0)
else:
print(0, A + B - K)
|
[
"expression.operation.binary.remove"
] | 620,448
| 620,449
|
u573900545
|
python
|
p02818
|
A, B, K = map(int, input().split())
if K <= A:
a = A - K
b = B
else:
a = 0
b = B - (K-A)
print(a, b)
|
A, B, K = map(int, input().split())
if K <= A:
a = A - K
b = B
else:
a = 0
b = max(0, B - (K-A))
print(a, b)
|
[
"call.add",
"call.arguments.change"
] | 620,450
| 620,451
|
u439063038
|
python
|
p02818
|
a,b,k = map(int,input().split())
if a >= k:
ans1 = k
ans2 = b
if a < k:
if (a+b) <= k:
ans1 = 0
ans2 = 0
else:
ans1 = 0
ans2 = b-(k-a)
print(ans1,ans2)
|
a,b,k = map(int,input().split())
if a >= k:
ans1 = a-k
ans2 = b
if a < k:
if (a+b) <= k:
ans1 = 0
ans2 = 0
else:
ans1 = 0
ans2 = b-(k-a)
print(ans1,ans2)
|
[
"assignment.change"
] | 620,458
| 620,459
|
u273242084
|
python
|
p02818
|
a,b,k = map(int,input().split())
if a+b < k:print(0,0)
if a > k:print(a-k,b)
if a < k:print(0,a+b-k)
|
a,b,k = map(int,input().split())
if a+b < k:print(0,0)
elif a > k:print(a-k,b)
elif a <= k:print(0,a+b-k)
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,460
| 620,461
|
u273242084
|
python
|
p02818
|
A,B,K = list(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 = list(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"
] | 620,462
| 620,463
|
u759412327
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a >= k:
if b-(k-a) > 0:
print(0, b-(k-a))
else:
print(0, 0)
else:
print(a-k, b)
|
a, b, k = map(int, input().split())
if a <= k:
if b-(k-a) > 0:
print(0, b-(k-a))
else:
print(0, 0)
else:
print(a-k, b)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,468
| 620,469
|
u720124072
|
python
|
p02818
|
a, b, k = map(int, input().split())
print(max(a-k, 0), max(b-(k-a), 0))
|
a, b, k = map(int, input().split())
print(max(a-k, 0), max(b-max((k-a), 0), 0))
|
[
"call.add",
"call.arguments.add"
] | 620,470
| 620,471
|
u038136206
|
python
|
p02818
|
a,b,k = map(int,input().split())
if a+b <= k:
print("0 0")
exit()
if a <= k:
a = 0
b = b - k + a
print(a,b)
else:
print(a-k,b)
|
a,b,k = map(int,input().split())
if a+b <= k:
print("0 0")
exit()
if a <= k:
b = b - k + a
a = 0
print(a,b)
else:
print(a-k,b)
|
[
"assignment.remove",
"assignment.add"
] | 620,480
| 620,481
|
u496511996
|
python
|
p02818
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif A < K <= B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif K <= A + B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 620,482
| 620,483
|
u968166680
|
python
|
p02818
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif A < K <= B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif K <= A + B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 620,482
| 620,484
|
u968166680
|
python
|
p02818
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif A < K <= B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
A, B, K = map(int, readline().split())
if K <= A:
print(A - K, B)
elif A < K <= A + B:
print(0, A + B - K)
else:
print(0, 0)
return
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 620,482
| 620,485
|
u968166680
|
python
|
p02818
|
a,b,k=map(int,input().split())
if k<=a:
print(a-k,b)
elif a<=k<=b:
print(0,b-(k-a))
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,b-(k-a))
else:
print(0,0)
|
[
"control_flow.branch.if.condition.change"
] | 620,490
| 620,491
|
u217303170
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A > K:
A -= K
elif A < K < A + B:
B -= K - A
A = 0
elif A + B <= K:
A = B = 0
print(A, B)
|
A, B, K = map(int, input().split())
if A >= K:
A -= K
elif A < K < A + B:
B -= K - A
A = 0
elif A + B <= K:
A = B = 0
print(A, B)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,497
| 620,496
|
u855665975
|
python
|
p02818
|
a,b,c = map(int, input().split())
print(max(0,a-c),max(0,max(0,c-a)))
|
a,b,c = map(int, input().split())
print(max(0,a-c),max(0, b - max(0,c-a)))
|
[
"expression.operation.binary.add"
] | 620,500
| 620,501
|
u403436880
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k.b)
elif a+b>=k:
print(0,a+b-k)
else:
print(0,0)
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
elif a+b>=k:
print(0,a+b-k)
else:
print(0,0)
|
[
"misc.typo",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 620,502
| 620,503
|
u492910842
|
python
|
p02818
|
a, b, k = map(int, input().split())
if a < k:
a = 0
k -= a
b = max(b - k, 0)
else:
a -= k
print(a, b)
|
a, b, k = map(int, input().split())
if a < k:
k -= a
a = 0
b = max(b - k, 0)
else:
a -= k
print(a, b)
|
[
"assignment.remove",
"assignment.add"
] | 620,518
| 620,519
|
u201660334
|
python
|
p02818
|
import sys
def S(): return sys.stdin.readline().rstrip()
A,B,K = map(int,S().split())
if K <= A:
print(K-A,B)
elif K >= A+B:
print(0,0)
else:
print(0,B-K+A)
|
import sys
def S(): return sys.stdin.readline().rstrip()
A,B,K = map(int,S().split())
if K <= A:
print(A-K,B)
elif K >= A+B:
print(0,0)
else:
print(0,B-K+A)
|
[
"expression.operation.binary.remove"
] | 620,520
| 620,521
|
u119148115
|
python
|
p02818
|
a,b,k=(map(int, input().split()))
if a>k:
print(a-k,b)
else:
if a+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:
if a+b>k:
print(0,a+b-k)
else:
print(0,0)
|
[
"expression.operation.binary.add"
] | 620,524
| 620,525
|
u075303794
|
python
|
p02818
|
a,b,k = map(int, input().split())
if k <= a: print(k-a, b)
elif k-a <= b: print(0, b-k+a)
else: print(0, 0)
|
a,b,k = map(int, input().split())
if k <= a: print(a-k, b)
elif k-a <= b: print(0, b-k+a)
else: print(0, 0)
|
[
"expression.operation.binary.remove"
] | 620,531
| 620,532
|
u666964944
|
python
|
p02818
|
A, B, K = map(int, input().split())
if K <= A:
print(A - K, B)
elif A < K <= B:
print(0, B - (K - A))
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, B - (K - A))
else:
print(0, 0)
|
[
"control_flow.branch.if.condition.change"
] | 620,535
| 620,536
|
u724687935
|
python
|
p02818
|
a,b,k=map(int,input().split())
if k<a:
print(a-k,b)
elif a<=k and k<b:
print(0,b-k)
else:
print(0,0)
|
a,b,k=map(int,input().split())
if k<a:
print(a-k,b)
elif a<=k and k<a+b:
print(0,b-k+a)
else:
print(0,0)
|
[
"control_flow.branch.if.condition.change"
] | 620,541
| 620,542
|
u957957759
|
python
|
p02818
|
a,b,k=list(map(int,input().split()))
if k<=a:
print(str(a-k)+" "+str(b))
elif a<k<=b:
print(str(0)+" "+str(a+b-k))
else:
print(str(0)+" "+str(0))
|
a,b,k=list(map(int,input().split()))
if k<=a:
print(str(a-k)+" "+str(b))
elif a<k<=a+b:
print(str(0)+" "+str(a+b-k))
else:
print(str(0)+" "+str(0))
|
[
"control_flow.branch.if.condition.change"
] | 620,548
| 620,549
|
u437351386
|
python
|
p02818
|
A,B,K=map(int,input(),split())
if A>=K:
print(A-K,B)
elif K>A and A+B>=K:
print(0,B-K+A)
else:
print(0,0)
|
A,B,K=map(int,input().split())
if A>=K:
print(A-K,B)
elif K>A and A+B>=K:
print(0,B-K+A)
else:
print(0,0)
|
[
"assignment.value.change",
"call.arguments.change"
] | 620,550
| 620,551
|
u185806788
|
python
|
p02818
|
A,B,K=map(int,input(),spliT())
if A>=K:
print(A-K,B)
elif K>A and A+B>=K:
print(0,B-K+A)
else:
print(0,0)
|
A,B,K=map(int,input().split())
if A>=K:
print(A-K,B)
elif K>A and A+B>=K:
print(0,B-K+A)
else:
print(0,0)
|
[] | 620,552
| 620,551
|
u185806788
|
python
|
p02818
|
a, b, k = map(int, input().split())
if k <= a:
a -= k
elif a < k <= a + b:
a = 0
b -= k - a
else:
a = 0
b = 0
print('{} {}'.format(a, b))
|
a, b, k = map(int, input().split())
if k <= a:
a -= k
elif a < k <= a + b:
temp = a
a = 0
b -= k - temp
else:
a = 0
b = 0
print('{} {}'.format(a, b))
|
[
"identifier.change",
"expression.operation.binary.change"
] | 620,555
| 620,556
|
u288335507
|
python
|
p02818
|
a,b,c=map(int,input().split())
if a>c:
print(a-c,b)
elif a<=c and b<=(a-c):
print(0,0)
else:
print(0,b-(c-a))
|
a,b,c=map(int,input().split())
if a>c:
print(a-c,b)
elif a<=c and b<=(c-a):
print(0,0)
else:
print(0,b-(c-a))
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 620,565
| 620,566
|
u115877451
|
python
|
p02818
|
import sys
a,b,k = map(int, sys.stdin.readline().split())
a, b = max(0, a-k), b- max((k-a), 0)
print(a, b)
|
import sys
a,b,k = map(int, sys.stdin.readline().split())
a, b = max(0, a-k), max(0, b- max((k-a), 0))
print(a, b)
|
[
"call.add",
"call.arguments.change"
] | 620,600
| 620,601
|
u401452016
|
python
|
p02818
|
import sys
import decimal # 10進法に変換，正確な計算
def input():
return sys.stdin.readline().strip()
def main():
a, b, k = map(int, input().split())
if k <= a:
print(a-k)
return
elif k <= a + b:
print(0,b-k+a)
return
print(0,0)
main()
|
import sys
import decimal # 10進法に変換，正確な計算
def input():
return sys.stdin.readline().strip()
def main():
a, b, k = map(int, input().split())
if k <= a:
print(a-k, b)
return
elif k <= a + b:
print(0, b-k+a)
return
print(0, 0)
main()
|
[
"call.arguments.add"
] | 620,612
| 620,613
|
u946346344
|
python
|
p02818
|
A, B, K = map(int, input().split())
print(max(0, A-K), max(0, B-max(0, A-K)))
|
A, B, K = map(int, input().split())
print(max(0, A-K), max(0, B-max(0, K-A)))
|
[
"expression.operation.binary.remove"
] | 620,625
| 620,626
|
u600261652
|
python
|
p02818
|
A,B,K = list(map(int,input().split(" ")))
if A >= K:
print(A-k, B)
elif A + B >= K:
print(0, A+B-K)
else:
print("0 0")
|
A,B,K = list(map(int,input().split(" ")))
if A >= K:
print(A-K, B)
elif A + B >= K:
print(0, A+B-K)
else:
print("0 0")
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 620,633
| 620,634
|
u258325541
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A >= K:
print(A-K, B)
elif B >= K:
print(0, B-(K-A))
else:
print(0,0)
|
A, B, K = map(int, input().split())
if A >= K:
print(A-K, B)
elif B >= (K-A):
print(0, B-(K-A))
else:
print(0,0)
|
[
"control_flow.branch.if.condition.change"
] | 620,637
| 620,638
|
u189516107
|
python
|
p02818
|
A,B,K=map(int,input().split())
if K<A:
ans1=A-K
else:
ans1=0
ans2=max(A+B-K,0)
print(ans1,ans2)
|
A,B,K=map(int,input().split())
if K<A:
ans1=A-K
ans2=B
else:
ans1=0
ans2=max(A+B-K,0)
print(ans1,ans2)
|
[
"assignment.add"
] | 620,659
| 620,660
|
u212502386
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k: print(a-k,b)
elif b>k: print(0,a+b-k)
else: print(0,0)
|
a,b,k=map(int,input().split())
if a>=k: print(a-k,b)
elif a+b>=k: print(0,a+b-k)
else: print(0,0)
|
[
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 620,671
| 620,672
|
u131881594
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k: print(a-k,b)
elif b>=k: print(0,a+b-k)
else: print(0,0)
|
a,b,k=map(int,input().split())
if a>=k: print(a-k,b)
elif a+b>=k: print(0,a+b-k)
else: print(0,0)
|
[
"control_flow.branch.if.condition.change"
] | 620,673
| 620,672
|
u131881594
|
python
|
p02818
|
a,b,k = [int(x) for x in input().split()]
if a >= k:
print(a-k,b)
else:
print(0,a+b-k)
|
a,b,k = [int(x) for x in input().split()]
if a > k:
print(a-k,b)
else:
print(0,max(0,a+b-k))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 620,674
| 620,675
|
u924828749
|
python
|
p02818
|
a,b,k = [int(x) for x in input().split()]
if a > k:
print(a-k,b)
else:
print(0,a+b-k)
|
a,b,k = [int(x) for x in input().split()]
if a > k:
print(a-k,b)
else:
print(0,max(0,a+b-k))
|
[
"call.arguments.add",
"call.arguments.change"
] | 620,676
| 620,675
|
u924828749
|
python
|
p02818
|
#!/usr/bin/env python3
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
else:
print(0,b-k+a)
|
#!/usr/bin/env python3
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"
] | 620,683
| 620,684
|
u310245677
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a+b<=k:
print(0,0)
elif a<=k<a+b:
print(0,b-(k-a))
else:
print(a-k+b,b)
|
a,b,k=map(int,input().split())
if a+b<=k:
print(0,0)
elif a<=k<a+b:
print(0,b-(k-a))
else:
print(a-k,b)
|
[
"expression.operation.binary.remove"
] | 620,685
| 620,686
|
u800058906
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A >= K:
ans_a = K - A
ans_b = B
elif A < K and A + B >= K:
K = K - A
ans_a = 0
ans_b = B - K
else:
ans_a = 0
ans_b = 0
print(str(ans_a) + " " + str(ans_b))
|
A, B, K = map(int, input().split())
if A >= K:
ans_a = A - K
ans_b = B
elif A < K and A + B >= K:
K = K - A
ans_a = 0
ans_b = B - K
else:
ans_a = 0
ans_b = 0
print(str(ans_a) + " " + str(ans_b))
|
[
"expression.operation.binary.remove"
] | 620,689
| 620,690
|
u159144188
|
python
|
p02818
|
T,A,K = map(int,input().split())
sta = T + A - K
if sta <= 0:
print("0 0")
elif sta >= A:
print(str(T-sta +A) +" "+str(A))
else:
print("0 " + str(sta))
|
T,A,K = map(int,input().split())
sta = T + A - K
if sta <= 0:
print("0 0")
elif sta >= A:
print(str(T-K) +" "+str(A))
else:
print("0 " + str(sta))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 620,707
| 620,708
|
u773686010
|
python
|
p02818
|
A,B,K = map(int,input().split())
if A+B < K:
print(0,0)
exit()
elif A - K < 0:
B = B + A - K
A = 0
elif A - K <= 0:
A = A - K
print(A,B)
|
A,B,K = map(int,input().split())
if A+B < K:
print(0,0)
exit()
elif A - K < 0:
B = B + A - K
A = 0
elif A - K >= 0:
A = A - K
print(A,B)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,729
| 620,730
|
u460129720
|
python
|
p02818
|
a,b,k=map(int,input().split())
print(a-k,b) if k-a<=0 else print(0,b-k) if b-(k-a)>=0 else print(0,0)
|
a,b,k=map(int,input().split())
print(a-k,b) if k-a<=0 else print(0,b-(k-a)) if b-(k-a)>=0 else print(0,0)
|
[
"call.arguments.change"
] | 620,735
| 620,736
|
u607563136
|
python
|
p02818
|
A,B,K = map(int,input().split())
if B >= A:
B -= K-A
A = 0
else:
A -= K
if A <= 0 and B <= 0:
print(0,0)
else:
print(A,B)
|
A,B,K = map(int,input().split())
if K >= A:
B -= K-A
A = 0
else:
A -= K
if A <= 0 and B <= 0:
print(0,0)
else:
print(A,B)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 620,737
| 620,738
|
u848535504
|
python
|
p02818
|
A,B,K = map(int,input().split())
if B >= A:
B -= K-A
A = 0
else:
A -= K
if A < 0 and B < 0:
print(0,0)
else:
print(A,B)
|
A,B,K = map(int,input().split())
if K >= A:
B -= K-A
A = 0
else:
A -= K
if A <= 0 and B <= 0:
print(0,0)
else:
print(A,B)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 620,739
| 620,738
|
u848535504
|
python
|
p02818
|
a, b, k = map(int,input().split())
if (k >= a + b):
print(0, 0)
elif (k >= a):
print(0, k - a)
else:
print(a - k, b)
|
a, b, k = map(int,input().split())
if (k >= a + b):
print(0, 0)
elif (k >= a):
print(0, b - (k - a))
else:
print(a - k, b)
|
[
"call.arguments.change"
] | 620,744
| 620,745
|
u625864724
|
python
|
p02818
|
A,B,K=map(int,input().split())
if A>=K:
print (A-K, B)
elif A+B>=K:
print(0, B+A-K)
else:
print(O, O)
|
A,B,K=map(int,input().split())
if A>=K:
print (A-K, B)
elif A+B>=K:
print(0, B+A-K)
else:
print(0, 0)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 620,756
| 620,757
|
u443060157
|
python
|
p02818
|
A,B,K=map(int,input().split())
if A>=K:
print (A-K,B)
elif A+B>=K:
print(0,B+A-K)
else:
print(O,O)
|
A,B,K=map(int,input().split())
if A>=K:
print (A-K, B)
elif A+B>=K:
print(0, B+A-K)
else:
print(0, 0)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 620,758
| 620,757
|
u443060157
|
python
|
p02818
|
A,B,K = map(int, open(0).read().split())
if K <= A:
print(K-A,B)
elif K >= A + B:
print(0,0)
else:
print(0,B-K+A)
|
A,B,K = map(int, open(0).read().split())
if K <= A:
print(A-K,B)
elif K >= A + B:
print(0,0)
else:
print(0,B-K+A)
|
[
"expression.operation.binary.remove"
] | 620,761
| 620,762
|
u093041722
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A <= K:
answer_A = 0
answer_B = B - (K - A)
elif A > K:
answer_A = A - K
answer_B = B
print(answer_A, answer_B)
|
A, B, K = map(int, input().split())
if A <= K:
answer_A = 0
answer_B = max(0, B - (K - A))
elif A > K:
answer_A = A - K
answer_B = B
print(answer_A, answer_B)
|
[
"call.add",
"call.arguments.change"
] | 620,765
| 620,766
|
u523087093
|
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"
] | 620,767
| 620,768
|
u249987458
|
python
|
p02818
|
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
a, b, k = inpm()
ta = a - k
ao = b
if(ta < 0):
ao = b - ta
ta = 0
if(ao < 0):
ao = 0
print(str(ta) + ' ' + str(ao))
|
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
a, b, k = inpm()
ta = a - k
ao = b
if(ta < 0):
ao = b + ta
ta = 0
if(ao < 0):
ao = 0
print(str(ta) + ' ' + str(ao))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 620,771
| 620,772
|
u773580152
|
python
|
p02818
|
a,b,k=map(int,input().split())
if k<=a:
print(str(a-k)+' '+str(b))
else:
print(str(0)+' '+str(b-(k-a)))
|
a,b,k=map(int,input().split())
if k<=a:
print(str(a-k)+' '+str(b))
else:
print(str(0)+' '+str(max(0,b-(k-a))))
|
[
"call.add",
"call.arguments.change"
] | 620,782
| 620,783
|
u516554284
|
python
|
p02818
|
#coding:utf-8
a,b,k = map(int,input().split())
m = min(a,k)
a -= m
k -= m
b -= k
print (a,b)
|
a,b,k = map(int,input().split())
m = min(a,k)
a -= m
k -= m
b -= k
print (a,max(b,0))
|
[
"call.add",
"call.arguments.add"
] | 620,837
| 620,838
|
u709304134
|
python
|
p02818
|
#coding:utf-8
a,b,k = map(int,input().split())
m = min(a,k)
a -= m
k -= m
b -= k
print (a,b)
|
#coding:utf-8
a,b,k = map(int,input().split())
m = min(a,k)
a -= m
k -= m
b -= k
print (a,max(b,0))
|
[
"call.add",
"call.arguments.add",
"call.arguments.change"
] | 620,837
| 620,839
|
u709304134
|
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, min(b-k+a, b)))
|
[
"call.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add"
] | 620,840
| 620,841
|
u280552586
|
python
|
p02818
|
a, b, k = map(int, input().split())
print(max(0, a - k), end = ' ')
print(max(0, b - (k - a)))
|
a, b, k = map(int, input().split())
print(max(0, a - k), end = ' ')
print(max(0, b - max(k - a, 0)))
|
[
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 620,862
| 620,863
|
u642883360
|
python
|
p02818
|
a, b, k = map(int, input().split())
print(max(0, a-k), b - max(0, k-a))
|
a, b, k = map(int, input().split())
print(max(0, a-k), max(0, b - max(0, k-a)))
|
[
"call.arguments.add",
"call.arguments.change"
] | 620,866
| 620,867
|
u580920947
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A-K>=0:
print(A-K,B)
else:
print(0,B-(abs(A-K)))
|
A, B, K = map(int, input().split())
if A-K>=0:
print(A-K,B)
else:
print(0,max(0,B-(abs(A-K))))
|
[
"call.arguments.add",
"call.arguments.change"
] | 620,888
| 620,889
|
u190873802
|
python
|
p02818
|
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
a, b, k = map(int, input().split())
if a >= k:
print(a - k, b)
elif a < k <= b:
print(0, a + b - k)
else:
print(0, 0)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
a, b, k = map(int, input().split())
if a >= k:
print(a - k, b)
elif a < k <= a + b:
print(0, a + b - k)
else:
print(0, 0)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
[
"control_flow.branch.if.condition.change"
] | 620,890
| 620,891
|
u390727364
|
python
|
p02818
|
A, B, K = map(int,input().split())
a = 0
b = 0
if K <= A:
a = A - K
elif A < K <= A + B:
a = 0
b = B + A - K
print(str(a) + ' ' + str(b))
|
A, B, K = map(int,input().split())
a = 0
b = 0
if K <= A:
a = A - K
b = B
elif A < K <= A + B:
b = B + A - K
print(str(a) + ' ' + str(b))
|
[
"assignment.add",
"assignment.remove"
] | 620,892
| 620,893
|
u533713111
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>k:
print(a-k,b)
elif b>k:
print(0,b-a+k)
else:
print(0,0)
|
a,b,k=map(int,input().split())
if a>k:
print(a-k,b)
elif b>k-a:
print(0,b-k+a)
else:
print(0,0)
|
[
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 620,894
| 620,895
|
u629350026
|
python
|
p02818
|
a, b, k = map(int, input().split())
if k < a:
print(k - a, b)
else:
r = k - a
print(0, 0 if b - r <= 0 else b-r)
|
a, b, k = map(int, input().split())
if k < a:
print(a - k, b)
else:
r = k - a
print(0, 0 if b - r <= 0 else b-r)
|
[
"expression.operation.binary.remove"
] | 620,896
| 620,897
|
u391589398
|
python
|
p02818
|
def main():
import sys
input = sys.stdin.readline
A, B, K = map(int, input().split())
if A >= K:
print(A-K, B)
else:
print(0, B+A-K)
if __name__ == "__main__":
main()
|
def main():
import sys
input = sys.stdin.readline
A, B, K = map(int, input().split())
if A >= K:
print(A-K, B)
else:
print(0, max(0, B+A-K))
if __name__ == "__main__":
main()
|
[
"call.arguments.add",
"call.arguments.change"
] | 620,904
| 620,905
|
u239917977
|
python
|
p02818
|
a, b, k = list(map(int, input().split()))
if a <= k:
k -= a
a = 0
else:
a -= k
if b <= k:
k -= b
b = 0
else:
b -= k
print(a, b)
|
a, b, k = list(map(int, input().split()))
if a <= k:
k -= a
a = 0
else:
a -= k
k = 0
if b <= k:
k -= b
b = 0
else:
b -= k
print(a, b)
|
[
"assignment.add"
] | 620,927
| 620,928
|
u646412443
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
elif a<k and b-k+a>=0:
print(0,b-k)
else:
print(0,0)
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
elif a<k and b-k+a>=0:
print(0,b-k+a)
else:
print(0,0)
|
[
"expression.operation.binary.add"
] | 620,936
| 620,937
|
u932868243
|
python
|
p02818
|
A,K,B=map(int,input().split())
if K>=A+B:
print(0,0)
elif A<=K<A+B:
print(0,A+B-K)
else:
print(A-K,B)
|
A,B,K=map(int,input().split())
if K>=A+B:
print(0,0)
elif A<=K<A+B:
print(0,A+B-K)
else:
print(A-K,B)
|
[] | 620,943
| 620,944
|
u172966990
|
python
|
p02818
|
A, B, K = map(int, input().split())
if A <= K <= A + B:
print(0, B - (K - A))
elif K < A:
print(K - A, B)
else:
print(0, 0)
|
A, B, K = map(int, input().split())
if A <= K <= A + B:
print(0, B - (K - A))
elif K < A:
print(A - K, B)
else:
print(0, 0)
|
[
"expression.operation.binary.remove"
] | 620,949
| 620,950
|
u174181999
|
python
|
p02818
|
# B - Greedy Takahashi
A, B, K = map(int, input().split())
if A <= K:
B = B - (K - A)
A = 0
else:
A = A - K
print(A, B)
|
# B - Greedy Takahashi
A, B, K = map(int, input().split())
if A <= K:
B = B - min(B, K - A)
A = 0
else:
A = A - K
print(A, B)
|
[
"call.add",
"call.arguments.add"
] | 620,951
| 620,952
|
u537892680
|
python
|
p02818
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
if b>=(k-a):
print(0,b-k+a)
else:
print(0,0)
|
a,b,k=map(int,input().split())
if a>=k:
print(a-k,b)
elif b>=(k-a):
print(0,b-k+a)
else:
print(0,0)
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 620,953
| 620,954
|
u694467277
|
python
|
p02818
|
a,b,k = map(int,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 = map(int,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"
] | 620,964
| 620,965
|
u973108807
|
python
|
p02818
|
a,b,k = map(int,input().split())
ans1 = a-k
if ans1 <= 0:
ans2 = b - abs(ans1)
if ans2 < 0:
ans2 = 0
ans1 = 0
print(ans1, ans2)
else:
print(ans1, ans2)
|
a,b,k = map(int,input().split())
ans1 = a-k
if ans1 <= 0:
ans2 = b - abs(ans1)
if ans2 < 0:
ans2 = 0
ans1 = 0
print(ans1, ans2)
else:
print(ans1, b)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 620,966
| 620,967
|
u772062359
|
python
|
p02818
|
a,b,k=map(int,input().split())
if k<=a:
print(a-k,b)
elif a<=k<b:
print(0,b-(k-a))
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,b-(k-a))
else:
print(0,0)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,969
| 620,970
|
u236536206
|
python
|
p02818
|
a,b,k=map(int,input().split())
if k<=a:
print(a-k,b)
elif a<k<=b:
print(0,b-(k-a))
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,b-(k-a))
else:
print(0,0)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 620,971
| 620,970
|
u236536206
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.