ZhenlongDai/ACPR huggingface dataset:
Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, N = map(int, input().split())
La =list(map(int, input().split())) 
Lb =list(map(int, input().split()))
ans = 10**10
for i in range (N):
  W = list(map(int, input().split())) 
  x = W[0]-1
  y = W[1]-1
  c = W[2]
  price = La[x] + Lb[y] -c
  if price < ans:
    ans = price
print(ans)

Failing test case input:
2 4 0
-2 6
8 4 0
1 4 2

Expected output:
-2


Actual output:
10000000000


Fixed submission (verdict: Accepted):
A, B, N = map(int, input().split())
La =list(map(int, input().split())) 
Lb =list(map(int, input().split()))
ans = min(La)+min(Lb)
for i in range (N):
  W = list(map(int, input().split())) 
  x = W[0]-1
  y = W[1]-1
  c = W[2]
  price = La[x] + Lb[y] -c
  if price < ans:
    ans = price
print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

a,b,m=map(int,input().split())
al=list(map(int,input().split()))
bl=list(map(int,input().split()))
amin=min(al)
bmin=min(bl)
minp=amin+bmin
print(amin,bmin)
for i in range(m):
    num=list(map(int,input().split()))
    price=al[num[0]-1]+bl[num[1]-1]-num[2]
    minp=min(price,minp)
print(minp)

Failing test case input:
1 1 0
10
6
1 0 0
1 1 10

Expected output:
16


Actual output:
10 6
16


Fixed submission (verdict: Accepted):

a,b,m=map(int,input().split())
al=list(map(int,input().split()))
bl=list(map(int,input().split()))
amin=min(al)
bmin=min(bl)
minp=amin+bmin
for i in range(m):
    num=list(map(int,input().split()))
    price=al[num[0]-1]+bl[num[1]-1]-num[2]
    minp=min(price,minp)
print(minp)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 100000000
for i in range(M):
    x,y,c = map(int,input().split())
    ans = min(ans,a[x-1]+b[y-1]-c)
print(ans)

Failing test case input:
2 10 0
-3 7
13 10 0
0 4 7

Expected output:
-3


Actual output:
100000000


Fixed submission (verdict: Accepted):
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 1000000000000000
for i in range(M):
    x,y,c = map(int,input().split())
    ans = min(ans,a[x-1]+b[y-1]-c)
ans = min(ans,min(a)+min(b))
print(ans)

Problem: p02748
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
min_price = max(a)+max(b)

for i in range(M):
    x,y,c = map(int,input().split())
    min_price = min(min_price,a[x-1]+b[y-1]-c)
print(min_price)

Failing test case input:
2 4 0
-2 11
13 4 2
1 4 2

Expected output:
0


Actual output:
24


Fixed submission (verdict: Accepted):
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
min_price = min(a)+min(b)

for i in range(M):
    x,y,c = map(int,input().split())
    min_price = min(min_price,a[x-1]+b[y-1]-c)
print(min_price)
Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x,y,m = map(int,input().split());an=10**9
p=list(map(int,input().split()));q=list(map(int,input().split()))
for i in range(m):
  a,b,c = map(int,input().split())
  an=min(an,p[a-1]+q[b-1]-c)
print(an)

Failing test case input:
2 4 0
1 6
8 3 0
1 2 1

Expected output:
1


Actual output:
1000000000


Fixed submission (verdict: Accepted):
x,y,m = map(int,input().split());an=10**9
p=list(map(int,input().split()));q=list(map(int,input().split()))
for i in range(m):
  a,b,c = map(int,input().split())
  an=min(an,p[a-1]+q[b-1]-c)
an=min(an,min(p)+min(q))
print(an)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,M=map(int, input().split())
As=list(map(int, input().split()))
Bs=list(map(int, input().split()))
List=[]

ans=min(As)+min(Bs)
for i in As:
  for j in Bs:
    ans=min(ans, i+j)
for l in List:
  candidate=As[l[0]-1]+Bs[l[1]-1]-l[2]
  ans = min(ans, candidate)
print(ans)

Failing test case input:
1 1 2
10
10
1 0 5
1 1 10

Expected output:
10


Actual output:
20


Fixed submission (verdict: Accepted):
A,B,M=map(int, input().split())
As=list(map(int, input().split()))
Bs=list(map(int, input().split()))
List=[]
for i in range(M):
  List.append(list(map(int, input().split())))

ans=min(As)+min(Bs)
for l in List:
  candidate=As[l[0]-1]+Bs[l[1]-1]-l[2]
  ans = min(ans, candidate)
print(ans)

Problem: p02748
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
lists = [list(map(int,input().split())) for i in range(m)]
a.sort()
b.sort()
Min = min(a) + min(b)
for i in range(m):
    Min = min(Min,a[lists[i][0] - 1] + b[lists[i][1] - 1] - lists[i][2])
print(Min)



Failing test case input:
2 3 1
3 3
3 6 3
1 2 1

Expected output:
6


Actual output:
5


Fixed submission (verdict: Accepted):
a,b,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
lists = [list(map(int,input().split())) for i in range(m)]
Min = min(a) + min(b)
for x,y,c in lists:
    Min = min(Min,a[x-1] + b[y-1] - c)
print(Min)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
ans = a[0] + b[0]
for i in range(M):
    x, y, c = map(int, input().split())
    ans = min(ans, a[x - 1] + b[y - 1] - c)
print(ans)


Failing test case input:
2 4 1
3 3
3 6 3
1 2 1

Expected output:
6


Actual output:
5


Fixed submission (verdict: Accepted):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
newa = sorted(a)
newb = sorted(b)
ans = newa[0] + newb[0]
for i in range(M):
    x, y, c = map(int, input().split())
    ans = min(ans, a[x - 1] + b[y - 1] - c)
print(ans)
Problem: p02748
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=10**5+10**5
for i in range(m):
    x,y,c=map(int,input().split())
    num=A[x-1]+B[y-1]-c
    ans=min(num,ans)
print(ans)

Failing test case input:
2 3 1
3 4
3 6 3
0 2 0

Expected output:
6


Actual output:
10


Fixed submission (verdict: Accepted):
a,b,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=min(A)+min(B)
for i in range(m):
    x,y,c=map(int,input().split())
    num=A[x-1]+B[y-1]-c
    ans=min(num,ans)
print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,m=map(int, input().split())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
buf=min(A)+min(B)
for i in range(m):
    x,y,c=map(int, input().split())
    cp=A[x-1]+B[y-1]-c
    if buf>=cp:
        buf==cp
print(buf)

Failing test case input:
1 1 2
10
10
1 1 5
1 1 10

Expected output:
10

Actual output:
20


Fixed submission (verdict: Accepted):
a,b,m=map(int, input().split())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
buf=min(A)+min(B)
for i in range(m):
    x,y,c=map(int, input().split())
    cp=A[x-1]+B[y-1]-c
    if buf>=cp:
        buf=cp
print(buf)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, M = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
xyc = [[int(_) for _ in input().split()] for i in range(M)]

rets = [ai+bi for ai, bi in zip(a, b)]

for x, y, c in xyc:
    rets += [a[x-1] + b[y-1] - c]
print(min(rets))

Failing test case input:
2 4 0
-2 6
8 4 1
1 4 2

Expected output:
-1


Actual output:
6


Fixed submission (verdict: Accepted):
A, B, M = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
xyc = [[int(_) for _ in input().split()] for i in range(M)]

rets = [min(a) + min(b)]

for x, y, c in xyc:
    rets += [a[x-1] + b[y-1] - c]
print(min(rets))

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,M=map(int,input().split())
vecA=list(map(int,input().split()))
vecB=list(map(int,input().split()))
matX=[input().split() for k in range(M)]
price = 10**6
for i in range(0,M):
    pricecom = int(vecA[int(matX[i][0]) -1]) + int(vecB[int(matX[i][1]) -1]) - int(matX[i][2])
    if pricecom<= price:
        price=pricecom
    else:
        pass
print(price)

Failing test case input:
2 10 0
-2 7
13 10 0
0 4 6

Expected output:
-2


Actual output:
1000000


Fixed submission (verdict: Accepted):
A,B,M=map(int,input().split())
vecA=list(map(int,input().split()))
vecB=list(map(int,input().split()))
matX=[input().split() for k in range(M)]
price = 10**6
for i in range(0,M):
    pricecom = int(vecA[int(matX[i][0]) -1]) + int(vecB[int(matX[i][1]) -1]) - int(matX[i][2])
    if pricecom<= price:
        price=pricecom
    else:
        pass
price2=int(min(vecA)) + int(min(vecB))
if price2<=price:
    price=price2
print(price)
Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
min = A[0]+B[0]
for i in range(M):
  x,y,c = [int(i) for i in input().split()]
  buf = A[x-1]+B[y-1]-c
  if buf<min:
    min = buf
print(min)

Failing test case input:
2 10 0
-5 -1
13 10 -1
0 2 7

Expected output:
-6


Actual output:
8


Fixed submission (verdict: Accepted):
A,B,M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
min = min(A)+min(B)
for i in range(M):
  x,y,c = [int(i) for i in input().split()]
  buf = A[x-1]+B[y-1]-c
  if buf<min:
    min = buf
print(min)

Problem: p02748
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def resolve():
    a, b, m = map(int, input().split())
    a_list = sorted(list(map(int, input().split())))
    b_list = sorted(list(map(int, input().split())))
    ans = min(a_list) + min(b_list)
    for _ in range(m):
        x, y, c = map(int, input().split())
        ans = min(ans, a_list[x-1]+b_list[y-1]-c)
    print(ans)
resolve()

Failing test case input:
2 4 1
6 3
3 6 3
1 2 1

Expected output:
6


Actual output:
5


Fixed submission (verdict: Accepted):
def resolve():
    a, b, m = map(int, input().split())
    a_list = list(map(int, input().split()))
    b_list = list(map(int, input().split()))
    ans = min(a_list) + min(b_list)
    for _ in range(m):
        x, y, c = map(int, input().split())
        ans = min(ans, a_list[x-1]+b_list[y-1]-c)
    print(ans)
resolve()

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
data = [list(map(int, input().split())) for _ in range(M)]

aMIN = min(a)
bMIN = min(b)

MIN = aMIN + bMIN

for k in data:
    min(MIN, a[k[0]-1]+b[k[1]-1]-k[2])


print(MIN)

Failing test case input:
1 1 2
17
10
1 0 0
1 1 4

Expected output:
23


Actual output:
27


Fixed submission (verdict: Accepted):
A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
data = [list(map(int, input().split())) for _ in range(M)]

aMIN = min(a)
bMIN = min(b)

MIN = aMIN + bMIN

for k in data:
    MIN = min(MIN, a[k[0]-1]+b[k[1]-1]-k[2])


print(MIN)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,m = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
xyc = [list(map(int,input().split())) for _ in range(m)]

price = min(A)+min(B)
for x,y,c in xyc:
    k = A[x-1] + B[y-1] - c 
    print(k)
    if k < price:
        price = k
        
print(price)

Failing test case input:
2 3 1
3 3
3 6 3
1 2 1

Expected output:
6


Actual output:
8
6


Fixed submission (verdict: Accepted):
a,b,m = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
xyc = [list(map(int,input().split())) for _ in range(m)]

price = min(A)+min(B)
for x,y,c in xyc:
    k = A[x-1] + B[y-1] - c 
    if k < price:
        price = k
        
print(price)
Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=float('inf')
for i,j in zip(a,b):
  ans=min(ans,i+j)
for _ in range(m):
  x,y,c=map(int,input().split())
  ans=min(ans,a[x-1]+b[y-1]-c)
print(ans)


Failing test case input:
2 4 0
0 6
8 3 0
1 2 1

Expected output:
0


Actual output:
8


Fixed submission (verdict: Accepted):
a,b,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=min(a)+min(b)
for _ in range(m):
  x,y,c=map(int,input().split())
  ans=min(ans,a[x-1]+b[y-1]-c)
print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
ans = a[0] + b[0]

for i in range(M):
    x, y, c = map(int, input().split())
    x -= 1
    y -= 1
    ans = min(ans, a[x] + b[y] - c)

print(ans)


Failing test case input:
2 4 1
3 5
3 6 3
1 2 1

Expected output:
6


Actual output:
5


Fixed submission (verdict: Accepted):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

ans = min(a) + min(b)

for i in range(M):
    x, y, c = map(int, input().split())
    x -= 1
    y -= 1
    ans = min(ans, a[x] + b[y] - c)

print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = sorted(a)
bb = sorted(b)
lis = []
mi = 10**12
for i in range(m):
  x, y, c = map(int, input().split())
  s = a[x-1]+b[y-1]-c
  mi = min(s, mi)
mii = a[0]+b[0]
ans = min(mii,mi)
print(ans)

Failing test case input:
2 4 0
3 5
3 6 0
0 2 1

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
a, b, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = sorted(a)
bb = sorted(b)
lis = []
mi = 10**12
for i in range(m):
  x, y, c = map(int, input().split())
  s = a[x-1]+b[y-1]-c
  mi = min(s, mi)
mii = aa[0]+bb[0]
ans = min(mii,mi)
print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = float('inf')
for _ in range(m):
    x, y, c = map(int, input().split())
    ans = min(ans, A[x-1] + B[y-1] - c)
print(ans)

Failing test case input:
2 2 1
3 2
3 8
2 2 2

Expected output:
5


Actual output:
8


Fixed submission (verdict: Accepted):
a, b, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = min(A) + min(B)
for _ in range(m):
    x, y, c = map(int, input().split())
    ans = min(ans, A[x-1] + B[y-1] - c)

print(ans)
Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,M = map(int,input().split())

a = list(map(int,input().split()))
b = list(map(int,input().split()))

discount = []
for i in [0]*M:
    discount.append(list(map(int,input().split())))

min_comb = min(a)+min(b)

for i in range(M):
    min_comb = min(min_comb,a[discount[i][0]-1]+b[discount[i][1]-1]-discount[i][2])
ans = 0
print(ans)

Failing test case input:
5 5 0
-8 0
12 10 -2
-1 2 1

Expected output:
-10


Actual output:
0


Fixed submission (verdict: Accepted):
A,B,M = map(int,input().split())

a = list(map(int,input().split()))
b = list(map(int,input().split()))

discount = []
for i in [0]*M:
    discount.append(list(map(int,input().split())))

min_comb = min(a)+min(b)

for i in range(M):
    min_comb = min(min_comb,a[discount[i][0]-1]+b[discount[i][1]-1]-discount[i][2])
ans = min_comb
print(ans)

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
d = [list(map(int, input().split())) for i in range(a[2])]
e = [b[0] + c[0]]
for f in d:
  e.append(b[f[0] - 1] + c[f[1] - 1] - f[2])
print(min(e))  

Failing test case input:
2 4 0
-2 6
13 4 2
1 4 2

Expected output:
0


Actual output:
11


Fixed submission (verdict: Accepted):
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
d = [list(map(int, input().split())) for i in range(a[2])]
e = [min(b) + min(c)]
for f in d:
  e.append(b[f[0] - 1] + c[f[1] - 1] - f[2])
print(min(e))

Problem: p02748
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=min(A)+min(B)
for i in range(m):
    x,y,c=map(int,input().split())
    tmp=A[x-1]+B[y-1]+c
    ans=min(ans,tmp)
print(ans)

Failing test case input:
1 1 2
10
6
1 0 0
1 1 10

Expected output:
6


Actual output:
16


Fixed submission (verdict: Accepted):
a,b,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=min(A)+min(B)
for i in range(m):
    x,y,c=map(int,input().split())
    tmp=A[x-1]+B[y-1]-c
    ans=min(ans,tmp)
print(ans)
Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
    try:
        x = list(map(int, input().split(' ')))
        n = x[0] * x[1]
        print(len(str(n)))
    except EOFError:
        break

Failing test case input:
2 1
3 -1
0101 6

Expected output:
1
1
3


Actual output:
1
2
3


Fixed submission (verdict: Accepted):
while True:
    try:
        x = list(map(int, input().split(' ')))
        n = x[0] + x[1]
        print(len(str(n)))
    except EOFError:
        break

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):



while 1:
    try:
        a,b = map(int,input().split())
        print(a+b)
    except:
        break

Failing test case input:
1 1
5 -1
0011 34

Expected output:
1
1
2


Actual output:
2
4
45


Fixed submission (verdict: Accepted):



while 1:
    try:
        a,b = map(int,input().split())
        su = a+b
        print(len(str(su)))
    except:
        break

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
def main():
    def inputs():
        li = []
        count = 0
        try:
            while count < 200:
                li.append(input())
                count += 1
        except EOFError:
            return li
        return li

    li = inputs()
    for x in li:
        a = x.split(" ")
        print(int(a[0]) + int(a[1]))
    return None

if __name__ == '__main__':
    main()

Failing test case input:
6 7
1 99
1000 225

Expected output:
2
3
4


Actual output:
13
100
1225


Fixed submission (verdict: Accepted):
def main():
    def inputs():
        li = []
        count = 0
        try:
            while count < 200:
                li.append(input())
                count += 1
        except EOFError:
            return li
        return li

    li = inputs()
    for x in li:
        a = x.split(" ")
        result = len(str(int(a[0]) + int(a[1])))
        print(result)
    return None

if __name__ == '__main__':
    main()

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
answers=[]
while True:
    try:
        nums=input().split()
        answers.append(len(nums[0]+nums[1]))
    except :
        break
for i in range(len(answers)):
    print(answers[i])

Failing test case input:
10 10
2 99
1000 25

Expected output:
2
3
4


Actual output:
4
3
6


Fixed submission (verdict: Accepted):
answers=[]
while True:
    try:
        nums=input().split()
        answers.append(len(str(int(nums[0])+int(nums[1]))))
    except :
        break
for i in range(len(answers)):
    print(answers[i])

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
answers=[]
while True:
    try:
        nums=input().split()
        answers.append(len(nums[0])+len(nums[1]))
    except:
        break

for i in range(len(answers)):
    print(answers[i])

Failing test case input:
-1 -1
0 -1
0111 14

Expected output:
2
2
3


Actual output:
4
3
6


Fixed submission (verdict: Accepted):
answers=[]
while True:
    try:
        nums=input().split()
        answers.append(len(str(int(nums[0])+int(nums[1]))))
    except :
        break
for i in range(len(answers)):
    print(answers[i])
Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
[print(len(str(sum(map(int, input().split()))))) for _ in range(1)]

Failing test case input:
6 7
1 99
1000 244

Expected output:
2
3
4


Actual output:
2


Fixed submission (verdict: Accepted):
import sys
[print(len(str(sum(list(map(int, i.split())))))) for i in sys.stdin]

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import sys

for line in sys.stdin:
    a, b = line.split()
    print(len(str(a + b)))

Failing test case input:
2 0
7 1
0011 4

Expected output:
1
1
2


Actual output:
2
2
5


Fixed submission (verdict: Accepted):
import sys
 
for line in sys.stdin:
    a, b = line.split()
    print(len(str(int(a) + int(b))))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
	try:
		a,b = map(int, input().split())
	except:
		break

print(len(str(a+b)))

Failing test case input:
10 10
2 3
1000 6

Expected output:
2
1
4


Actual output:
4


Fixed submission (verdict: Accepted):
while True:
    try:
        a,b = map(int,input().split())
    except:
        exit()
 
    print(len(str(a+b)))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
def main():
    a, b = map(int, input().split())
    hoge = list(str(a + b))
    print(len(hoge))

if __name__ == "__main__":
    main()

Failing test case input:
0 -1
0 0
0111 7

Expected output:
2
1
3


Actual output:
2


Fixed submission (verdict: Accepted):
import sys
def main():
    for line in sys.stdin:
        a, b = map(int, line.split())
        print(len(str(a + b)))

if __name__ == "__main__":
    main()

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
    try:
        a = int(input())
        b = int(input())
        print(len(str(a + b)))
    except:
        break


Failing test case input:
6 10
2 99
1000 25

Expected output:
2
3
4


Actual output:

Fixed submission (verdict: Accepted):
while True:
    try:
        a, b = map(int, input().split(" "))
        print(len(str(a + b)))
    except:
        break

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import fileinput

if __name__ == "__main__":
    for line in fileinput.input():
        v = line.split(" ")
        print(sum([int(i) for i in v]))

Failing test case input:
1 1
5 0
0101 6

Expected output:
1
1
3


Actual output:
2
5
107


Fixed submission (verdict: Accepted):
import fileinput

if __name__ == "__main__":
    for line in fileinput.input():
        v = line.split(" ")
        print(len(str(sum([int(i) for i in v]))))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import sys

for line in sys.stdin:
  x, y = map(int, line.split())
  print(x+y)

Failing test case input:
-11 0
0 -1
1010 0

Expected output:
3
2
4


Actual output:
-11
-1
1010


Fixed submission (verdict: Accepted):
import sys

for line in sys.stdin:
  x, y = map(int, line.split())
  print(len(str(x+y)))
Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
	try:
		value = input().split(" ")
		result = int(value[0]) * int(value[1])
		print(str(result))
	except EOFError:
		break

Failing test case input:
2 1
3 -1
0101 6

Expected output:
1
1
3


Actual output:
2
-3
606


Fixed submission (verdict: Accepted):
while True:
	try:
		value = input().split(" ")
		result = str(int(value[0]) + int(value[1]))
		print(len(result))
	except EOFError:
		break

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
try:
    while True:
        result=0
        a,b =    map(int, input().split())
        result = a + b
        print(len(result))
except:
    pass

Failing test case input:
0 1
5 1
0011 6

Expected output:
1
1
2


Actual output:

Fixed submission (verdict: Accepted):
try:
    while True:
        a,b = map(int, input().split())
        print(len(str(a+b)))
except:
    pass

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
def main():
    while True:
        try:
            a, b = (int(x) for x in input().split())
            print(len(str(a+b)))
        except EOFError:
            break


Failing test case input:
2 -1
1 1
0010 7

Expected output:
1
1
2


Actual output:

Fixed submission (verdict: Accepted):
def main():
    while True:
        try:
            a, b = (int(x) for x in input().split())
            print(len(str(a+b)))
        except EOFError:
            break
main()

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
 a,b=map(int,input().split())
 digit=(a+b)
 digit2=str(digit)
 print(len(digit2))
 break

Failing test case input:
6 7
1 99
1000 34

Expected output:
2
3
4


Actual output:
2


Fixed submission (verdict: Accepted):
try:
 while True:
  a,b=map(int,input().split())
  digit=(a+b)
  digit2=str(digit)
  print(len(digit2))
except:
   pass

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
try:
    s=[input() for x in range(200)]
    for i in range(len(s)):
        print(len(str(int(s[i].split(' ')[0])+int(s[i].split(' ')[1]))))
except EOFError:
    pass

Failing test case input:
6 7
1 99
1000 34

Expected output:
2
3
4


Actual output:

Fixed submission (verdict: Accepted):
try:
    s=[]
    while True:
        t = input()
        s.append(t)
except EOFError:
    for i in range(len(s)):
        print(len(str(int(s[i].split(' ')[0])+int(s[i].split(' ')[1]))))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
    try:
        a, b = (int(x) for x in input().split())
        print(a + b)
    except:
        break;


Failing test case input:
0 0
3 0
1101 6

Expected output:
1
1
4


Actual output:
0
3
1107


Fixed submission (verdict: Accepted):
while True:
    try:
        a, b = (int(x) for x in input().split())
        print(len(str(a + b)))
    except:
        break;
Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):


def get_input():
    
    while True:
        try:
            yield "".join(input())
        except EOFError:
            break
                     
if __name__=="__main__":
    array = list(get_input())
    for i in range(len(array)):
        
        temp = array[i].split()
        
        a = int(temp[0])
        b = int(temp[1])

 
                
        ans = a + b
        
        print(ans)

Failing test case input:
2 0
5 1
1010 3

Expected output:
1
1
4


Actual output:
2
6
1013


Fixed submission (verdict: Accepted):


def get_input():
    
    while True:
        try:
            yield "".join(input())
        except EOFError:
            break
                     
if __name__=="__main__":
    array = list(get_input())
    for i in range(len(array)):
        
        temp = array[i].split()
        
        a = int(temp[0])
        b = int(temp[1])
                        
        ans = a + b
        
        print(len(str(ans)))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
    try:
        a, b = map(int, input().split())
        print(len(list(a+b)))
    except:
        break


Failing test case input:
10 10
2 36
1000 6

Expected output:
2
2
4


Actual output:

Fixed submission (verdict: Accepted):
while True:
    try:
        print(len(str(sum(list(map(int, input().split()))))))
    except:
        break

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import sys

tokens = []
for line in sys.stdin.readlines():
    tokens.append(list(map(int, line.strip().split())))

for i in range(len(tokens)):
    print(tokens[i][0] + tokens[i][1])

Failing test case input:
4 7
1 99
1000 999

Expected output:
2
3
4


Actual output:
11
100
1999


Fixed submission (verdict: Accepted):
import sys

while True:
    line = sys.stdin.readline()
    if not line:
        break
    token = list(map(int, line.strip().split()))
    print(len(str(token[0] + token[1])))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import sys

while True:
    line = sys.stdin.readline()
    if line == '':
        break
    token = list(map(int, line.strip().split()))
    print(token[0] + token[1])

Failing test case input:
2 0
8 1
1011 3

Expected output:
1
1
4


Actual output:
2
9
1014


Fixed submission (verdict: Accepted):
import sys

while True:
    line = sys.stdin.readline()
    if not line:
        break
    token = list(map(int, line.strip().split()))
    print(len(str(token[0] + token[1])))

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
while True:
	try:
		a,b = map(int,input().split(" "))
		print(a+b)
	except: break 

Failing test case input:
0 1
5 2
0011 4

Expected output:
1
1
2


Actual output:
1
7
15


Fixed submission (verdict: Accepted):
while True:
	try:
		a,b = map(int,input().split(" "))
		print(len(str(a+b)))
	except: break
Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
try:
    while 1:
        print(len(str(sum((input().split())))))
except Exception:
    pass

Failing test case input:
4 7
1 99
1000 999

Expected output:
2
3
4


Actual output:

Fixed submission (verdict: Accepted):
try:
    while 1:
        print(len(str(sum(map(int, input().split())))))
except Exception:
    pass

Problem: p00002
Buggy submission (Python3, verdict: Wrong Answer):
import sys

for line in sys.stdin:
    a, b = map(str, line.split())
    print(len(a+b))

Failing test case input:
2 0
7 1
0011 4

Expected output:
1
1
2


Actual output:
2
2
5


Fixed submission (verdict: Accepted):
import sys

for line in sys.stdin:
    a, b = map(int, line.split())
    print(len(str(a+b)))
Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int,input().split()))
A = a[0]
B = a[1]
K = a[2]
taka = A
aoki = B
if K < A:
    aoki = B
    taka = A - K
elif K>=(A+B):
    pass
else:
    taka = 0
    b = K - A
    aoki = B - b
print(str(taka)+" "+str(aoki))

Failing test case input:
223869749260 13514692621 1010010100011

Expected output:
0 0


Actual output:
223869749260 13514692621


Fixed submission (verdict: Accepted):
a = list(map(int,input().split()))
A = a[0]
B = a[1]
K = a[2]
taka = A
aoki = B
if K < A:
    aoki = B
    taka = A - K
elif K>=(A+B):
    taka = 0
    aoki = 0
else:
    
    taka = 0
    b = K - A
    aoki = B - b
print(str(taka)+" "+str(aoki))

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    a, b, k = list(map(int,input().split()))

    a = a - k
    if a < 0:
        b = b + a
        a = 0
    print(a, b)

if __name__ == '__main__':
    main()

Failing test case input:
8901212864 933260677 1110110100001

Expected output:
0 0


Actual output:
0 -1100275626460


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    a, b, k = list(map(int,input().split()))

    a = a - k
    if a < 0:
        b = b + a
        a = 0
        b = max(0, b)
    print(a, b)

if __name__ == '__main__':
    main()

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, k = map(int, input().split())
if k <= a:
    print(a-k, b)
else:
    if a+b > k:
        print(0, 0)
    else:
        print(0, a+b-k)


Failing test case input:
498881727339 92988479429 1000000100000

Expected output:
0 0


Actual output:
0 -408129893232


Fixed submission (verdict: Accepted):
a, b, k = map(int, input().split())
if k <= a:
    print(a-k, b)
else:
    if a+b <= k:
        print(0, 0)
    else:
        print(0, a+b-k)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def solve():
    A, B, K = map(int, input().split())
    ans = []
    if A + B == K:
        ans = [0, 0]
    elif A + B < K:
        ans = [0, 0]
    elif K <= A:
        ans = [A-K, B]
    elif A < K <= B:
        ans = [0, B+A-K]
    elif K == 0:
        ans = [A, B]
    print(*ans)


solve()

Failing test case input:
9875757521 933260677 0010110110000

Expected output:
0 698908198


Actual output:

Fixed submission (verdict: Accepted):
def solve():
    A, B, K = map(int, input().split())
    ans = []
    if A + B <= K:
        ans = [0, 0]
    elif K <= A:
        ans = [A-K, B]
    elif K <= A + B:
        ans = [0, B+A-K]
    print(*ans)
solve()

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
d = a - c
if a > c:
 print(d,b)
else:
 print(0,b+a-c)

Failing test case input:
0 -1 2

Expected output:
0 0


Actual output:
0 -3


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
d = a - c
if a > c:
 print(d,b)
elif 0 > b-c+a:
 print(0,0)
else:
 print(0,b+a-c)
Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,k=map(int,input().split())

if a>k:
    print(a-k,b)

elif a+b>k>a:
    print(0,a+b-k)

else:
    print(0,0)

Failing test case input:
2 3 2

Expected output:
0 3


Actual output:
0 0


Fixed submission (verdict: Accepted):
a,b,k=map(int,input().split())

if a>=k:
    print(a-k,b)

elif a+b>=k>a:
    print(0,a+b-k)

else:
    print(0,0)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, k = map(int, input().split())
if a < k:
    b -= k-a
    a = 0
else:
    a -= k
print(a, b)

Failing test case input:
223869749260 13514692621 1011010101111

Expected output:
0 0


Actual output:
0 -773625659230


Fixed submission (verdict: Accepted):
a, b, k = map(int, input().split())
if a < k <= a+b:
    b -= k-a
    a = 0
elif a >= k:
    a -= k
else:
    a = 0
    b = 0
print(a, b)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, k = map(int, input().split())


print(max(0, a - k), min(b, a + b - k))

Failing test case input:
250272688906 9468746842 1010010100011

Expected output:
0 0


Actual output:
0 -750268664263


Fixed submission (verdict: Accepted):
a, b, k = map(int, input().split())


print(max(0, a - k), max(0, min(b, a + b - k)))

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,K = list(map(int,input().split()))
if A - K >=0:
    print(A-K,B)
else:
    tmp = K-A
    print(0,B-tmp)

Failing test case input:
24844196728 933260677 1010110100001

Expected output:
0 0


Actual output:
0 -984332642596


Fixed submission (verdict: Accepted):
A,B,K = list(map(int,input().split()))
if A - K >=0:
    print(A-K,B)
else:
    tmp = K-A
    if B-tmp>=0:
        print(0,B-tmp)
    else:
        print(0,0)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, K = map(int, input().split())







if A >= K:
    A -= K
elif A+B >= K:
    A = 0
    B -= K-A
    if B < 0:
        B = 0
else:
    A = 0
    B = 0

print(A, B)


Failing test case input:
2 3 3

Expected output:
0 2

Actual output:
0 0


Fixed submission (verdict: Accepted):
A, B, K = map(int, input().split())







if A >= K:
    A -= K
elif A+B >= K:
    B -= K-A
    A = 0
    if B < 0:
        B = 0
elif A+B < K:
    A = 0
    B = 0

print(A, B)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, K = map(int, input().split())

if A >= K:
    print(A - K, B)
else:
    print(0, A + B - K)


Failing test case input:
9957043226 933260677 1110010100001

Expected output:
0 0


Actual output:
0 -1099119796098


Fixed submission (verdict: Accepted):
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)
Problem: p02818
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c=map(int,input().split())
if a >= c:
  a = a-c
else:
  a = 0
  b = b - a- c
print(a,b)

Failing test case input:
250272688906 5812721198 1010010100011

Expected output:
0 0


Actual output:
0 -1004197378813


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
if a >= c:
  a = a-c
else:
  b = b + a -c 
  a = 0
if b < 0:
  b = 0
print(a,b)

Problem: p02818
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
a, b, k = map(int, input().split())

if b == 0:
    if a-k >= 0:
        print(a-k, 0)
    else:
        print(0, 0)
    sys.exit()
elif a == 0:
    if b-k >= 0:
        print(0, b-k)
    else:
        print(0, 0)
    sys.exit()
    
if a <= k:
    print(0, b -(k-a))
else:
    print(a-k, b)

Failing test case input:
250272688906 9468746842 1010010100011

Expected output:
0 0


Actual output:
0 -750268664263


Fixed submission (verdict: Accepted):
import sys
a, b, k = map(int, input().split())

if b == 0:
    if a-k >= 0:
        print(a-k, 0)
    else:
        print(0, 0)
    sys.exit()
elif a == 0:
    if b-k >= 0:
        print(0, b-k)
    else:
        print(0, 0)
    sys.exit()
elif a + b <= k:
    print(0, 0)
    sys.exit()
    
if a <= k:
    print(0, b -(k -a))
else:
    print(a-k, b)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,K = input().split(" ")
A = int(A)
B = int(B)
K = int(K)

if K>=A:
  A = 0
  K -=A
  if K>=B:
    B = 0
  else:
    B -=K
else:
  A -=K
print(A,B)

Failing test case input:
9875757521 933260677 0010110110000

Expected output:
0 698908198


Actual output:
0 0


Fixed submission (verdict: Accepted):
A,B,K = input().split(" ")
A = int(A)
B = int(B)
K = int(K)

if K>=A:
  K -=A
  A = 0
  if K>=B:
    B = 0
  else:
    B -=K
else:
  A -=K
print(A,B)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('b1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    A, B, K = read_int_list()
    a = A - K
    if a < 0:
      a = 0
    b = B - abs(A - K)
    print(a, b)


main()


Failing test case input:
204065 73650225 0000000111100

Expected output:
92965 73650225


Actual output:
92965 73557260


Fixed submission (verdict: Accepted):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('b1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    A, B, K = read_int_list()
    a = A - K
    if a < 0:
      a = 0

    b = B - abs(A - K)
    if b < 0:
      b = 0
    if A > K:
      b = B

    if A == 0 and B == 0:
      a = b = 0
    print(a, b)


main()
Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,K = list(map(int, input().split()))

if(A<=K):
  print(0, end=" ")
  print(B-K+A)
elif(A+B>=K):
  print(A-K, end=" ")
  print(B)
else:
  print(0, end=" ")
  print(0)

Failing test case input:
0 0 1

Expected output:
0 0


Actual output:
0 -1


Fixed submission (verdict: Accepted):
A,B,K = list(map(int, input().split()))
 
if(A+B>=K and A<=K):
  print(0, end=" ")
  print(B-K+A)
elif(A+B>=K):
  print(A-K, end=" ")
  print(B)
else:
  print(0, end=" ")
  print(0)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

stra, strb, strk = input().split()
a = int(stra)
b = int(strb)
k = int(strk)
if a >= k :
  a = a - k
else:
  a = 0
  b = b - (a - k)
  if b < 0:
    b = 0
print("{} {}".format(a, b))


Failing test case input:
4188594464 581054487 0010110110001

Expected output:
0 0


Actual output:
0 10691164488


Fixed submission (verdict: Accepted):

stra, strb, strk = input().split()
a = int(stra)
b = int(strb)
k = int(strk)
if a >= k :
  a = a - k
  k = 0
else:
  k = k - a
  a = 0


  if b >= k:
    b = b - k
  else:
    b = 0

print("{} {}".format(a, b))

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
else:
    print(0, b-(k-a))

Failing test case input:
0 0 1

Expected output:
0 0


Actual output:
0 -1


Fixed submission (verdict: Accepted):
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)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



A, B, K = map(int, input().split())


res = [str(s) for s in [max(0, A - K), max(0, B - (K - A))]]


print(' '.join(res))

Failing test case input:
498881727339 49011419508 0000000100000

Expected output:
498881627339 49011419508


Actual output:
498881627339 547893046847


Fixed submission (verdict: Accepted):



A, B, K = map(int, input().split())


resA = max(0, A - K)
resB = max(0, B - max(0, K - A))


print(resA, resB)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, K = map(int, input().split())

if A >= K:
  A -= K
else:
  B -= (K-A)
  A = 0

print(A, B)

Failing test case input:
46282745761 933260677 1010010100011

Expected output:
0 0


Actual output:
0 -962794093573


Fixed submission (verdict: Accepted):
A, B, K = map(int, input().split())

if A >= K:
  A -= K
else:
  B -= (K-A)
  A = 0
if B < 0:
  B = 0
print(A, B)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
9875757521 933260677 0010110110000

Expected output:
0 698908198


Actual output:
0 -19052606844


Fixed submission (verdict: Accepted):
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)
Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


a, b, k = map(int, input().split())

if k <= a:
    a = a - k
elif a < k and k <= (a + b):
    b = k - a
    a = 0
elif (a + b) < k:
    a = 0
    b = 0

print(a, b)

Failing test case input:
2 3 3

Expected output:
0 2

Actual output:
0 1


Fixed submission (verdict: Accepted):


a, b, k = map(int, input().split())

if k <= a:
    a = a - k
elif a < k and k <= (a + b):
    b = b - (k - a)
    a = 0
elif (a + b) < k:
    a = 0
    b = 0

print(a, b)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    a, b, k = map(int, input().split())
    if k <= a:
        a -= k
    else:
        b -= k - a
        a = 0
    print(a, b)


if __name__ == '__main__':
    main()


Failing test case input:
0 -1 2

Expected output:
0 0


Actual output:
0 -3


Fixed submission (verdict: Accepted):
def main():
    a, b, k = map(int, input().split())

    if a == b == 0:
        print(0, 0)
        return

    if k <= a:
        a -= k
    else:
        if k - a <= b:
            b -= k - a
        else:
            b = 0
        a = 0

    print(a, b)


if __name__ == '__main__':
    main()

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, K = map(int, input().split())


if A + B <= K:
	print(0, 0)
elif A <= K:
	print(0, B - (K - A))
else:
	print(K - A, B)

Failing test case input:
498881727339 86551688904 0000001100000

Expected output:
498880627339 86551688904


Actual output:
-498880627339 86551688904


Fixed submission (verdict: Accepted):
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)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,k = map(int,input().split())
a -= min(a,k)
k = k -a if k - a> 0 else 0
b -= min(b, k)
print(a,b)

Failing test case input:
18064166595 581054487 0010110110001

Expected output:
7954056594 581054487


Actual output:
7954056594 0


Fixed submission (verdict: Accepted):
a,b,k = map(int,input().split())
ta = a - min(a,k) 
k -= (a - ta)
b -= min(b, k)
print(ta,b)

Problem: p02818
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
a, b, k = map(int, input().split())

if b == 0:
    if a-k >= 0:
        print(a-k, 0)
    else:
        print(0, 0)
    sys.exit()
elif a == 0:
    if b-k >= 0:
        print(0, b-k)
    else:
        print(0, 0)
    sys.exit()
    
if a >= k:
    print(0, b -(k-a))
else:
    print(k-a, b)

Failing test case input:
13071060683 933260677 1010110100001

Expected output:
0 0


Actual output:
997039039318 933260677


Fixed submission (verdict: Accepted):
import sys
a, b, k = map(int, input().split())

if b == 0:
    if a-k >= 0:
        print(a-k, 0)
    else:
        print(0, 0)
    sys.exit()
elif a == 0:
    if b-k >= 0:
        print(0, b-k)
    else:
        print(0, 0)
    sys.exit()
elif a + b <= k:
    print(0, 0)
    sys.exit()
    
if a <= k:
    print(0, b -(k -a))
else:
    print(a-k, b)
Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, K = map(int, input().split())

if A - K >= 0:
  A = A - K
  print(A, B)
else:
  B = B - (K - A)
  A = 0
  print(A, B)

Failing test case input:
223869749260 13514692621 1010010101011

Expected output:
0 0


Actual output:
0 -772625659130


Fixed submission (verdict: Accepted):
A, B, K = map(int, input().split())

if A - K >= 0:
  A = A - K
  print(A, B)
else:
  if B - (K - A) >= 0:
    B = B - (K - A)
    A = 0
    print(A, B)
  else:
    A = 0
    B = 0
    print(A, B)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=[int(i) for i in input().split()]
if a[2]==0:
    print(a[0],a[1])
if a[0]+a[1]<=a[2]:
    print(0,0)
elif a[0]<=a[2]:
    print(0,a[1]-(a[2]-a[0]))
elif a[0]>a[2]:
    print(a[2]-a[0],a[1])

Failing test case input:
498881727339 49011419508 0000001100000

Expected output:
498880627339 49011419508


Actual output:
-498880627339 49011419508


Fixed submission (verdict: Accepted):
a=[int(i) for i in input().split()]
if a[0]+a[1]<=a[2]:
    print(0,0)
else:
    if a[0]<=a[2]:
        print(0,a[1]-(a[2]-a[0]))
    elif a[0]>a[2]:
        print(a[0]-a[2],a[1])

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, k = map(int, input().split())

if a+b <= k:
    print(0, 0)
elif a <= k:
    print(0, b-(k-a))
else:
    print(k-a, b)


Failing test case input:
488984103352 28853843669 0000010100000

Expected output:
488974003352 28853843669


Actual output:
-488974003352 28853843669


Fixed submission (verdict: Accepted):
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)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,k=map(int,input().split())
if(a>=k):
  print(a-k,b)
else:
  print(0,b-k+a)

Failing test case input:
223869749260 13514692621 1011010101111

Expected output:
0 0


Actual output:
0 -773625659230


Fixed submission (verdict: Accepted):
a,b,k=map(int,input().split())
if(a>=k):
  print(a-k,b)
elif(b-k+a>=0):
  print(0,b-k+a)
else:
  print(0,0)

Problem: p02818
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, B, K = map(int, input().split())

    taka = max(0, A - K)
    aoki = min(A + B - K, B)
    print(taka, aoki)


main()


Failing test case input:
46282745761 3894888655 1010010100011

Expected output:
0 0


Actual output:
0 -959832465595


Fixed submission (verdict: Accepted):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, B, K = map(int, input().split())

    taka = max(0, A - K)
    aoki = 0 if min(A + B - K, B) < 0 else min(A + B - K, B)
    print(taka, aoki)


main()