TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s,t = input().split()
print(t, end=" ")
print(s)

s,t = input().split()
print(t, end="")
print(s)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
if __name__=="__main__":
    s,t=input.split()
    print(t+s)

if __name__=="__main__":
    s,t=input().split()
    print(t+s)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S, T = map(str, input().split())

ans = S + T

print(ans)

S, T = map(str, input().split())

ans = T + S

print(ans)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S = input()
T = input()

print(T + S)

S = list(map(str, input().split()))
 
print(S[1] + S[0])

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s = input()
t = input()
print(t+s)

s, t = input().split()
print(t + s)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S,T = map(str, input().split())
print('{}{}'.format(S,T))

S,T = map(str, input().split())
print('{}{}'.format(T,S))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s, t = input().split()
print(s+t)

s = input().split()
print(s[0] +s[1])

s, t = input().rstrip().split()
print(s + t)

s, t = input().rstrip().split()
print(t + s)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S, T = input().split()
print(S + T)

S, T = input().split()
print(T +S)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S,T = list(map(int,input().split()))
print(T + S)

S,T = list(input().split())
print(T + S)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s = input()
print(s.replace(" ", ""))


s = input()
print(s.repliace(' ', '')

s = input()
print(s.repliace(' ', ''))

def main(s, t):
    print(t, s, sep="")


if __name__ == "__main__":
    s, t = input().split()

    main(s, t)


Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
print(input().replace(" ", ""))


print(input()+input())

print("".join(input().split()[::-1]))


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s,t = input(),input()
print(t+s)

print("".join(input().split()[-1]))


print("".join((input().split())[::-1]))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
str_list = input().split()
str = str_list[0] + str_list[1]
print(str)

str_list = input().split()
str = str_list[1] + str_list[0]
print(str)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
# -*- coding: utf-8 -*-
a, b = input().split()
pirnt("{}{}".format(b,a))


# -*- coding: utf-8 -*-
a, b = input().split()
pirnt("{}{}".format(b,a))


# -*- coding: utf-8 -*-
a, b = input().split()
print("{}{}".format(b,a))


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):

#include <string>
using namespace std;
int main()
{
    string s, t;
    cin >> s >> t;
    cout << t+s;
}

s, t = input("").split(" ")
res = t + s
print(res)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
n = input()
m = input()
a = m+n
print(a)

n = input()    
m = n.split()
p = [i for i in m]
a = p[1]+p[0]
print(a)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S, T = map(str, input.split())
A = T[:] + S[:]
print(A)

S, T = map(str, input().split())
A = T[:] + S[:]
print(A)


Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S, T = map(str, input().split())
print(S+T)

S, T = map(str, input().split())
print(T+S)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
from sys import stdin
a,b = [x for x in stdin.readline().rstrip().split()]
print(a+b)

from sys import stdin
a,b = [x for x in stdin.readline().rstrip().split()]
print(b+a)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
lst = [x for x in input().split()]
print("".join(lst))


S, T = input().split()
print(T + S)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
S,T = input().split()
str=S+T

print(str)


S,T = input().split()
str=T+S

print(str)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
b,a = input().split()
print(''.join([a,b].strip())

b,a = input().split()
print(''.join([a,b]).strip())

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
a,b=map(str,input().split())
print(a+b)

a,b=map(str,input().split())
print(b+a)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Submission attempts (in order):
s,t=map(input().split())
print(t+s)

s,t=input().split();print(t+s)

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = map(int, input().split())
if a==0 and b==0:
    print(0, 0)
elif k>a:
    print(2)
    print(0, end=" ")
    print(abs(b-(k-a)))
elif k<a:
    print(3)
    print(a-k, b)
elif a==k:
    print(4)
    print(0, b)

a, b, k = map(int, input().split())
if a==0 and b==0:
    print(0, 0)
elif k>a:
    if b-(k-a)>0:
        print(0, b-(k-a))
    else:
        print(0, 0)
elif k<a:
    print(a-k, b)
elif a==k:
    print(0, b)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k = (int(x) for x in input().split())

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

a,b,k = (int(x) for x in input().split())

if k >= a :
  if k >= b :
    if a + b >= k :
      a1 = 0
      b1 = b - k + a
    else :
      a1 = 0
      b1 = 0
  else :
    a1 = 0
    b1 = b - k + a
else :
  a1 = a - k
  b1 = b

print(a1,b1)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
t,a,k = [x for x in list(map(int,input().split()))]
if k>=t:
  if abs(t-k) > a:
    t = 0
    a = 0
  else:
    t = 0
    a = a-abs(t-k)
   print(t,a)
else:
  t = t-k
  print(t,a)
  

t,a,k = [x for x in list(map(int,input().split()))]
if t-k < 0:
  t = 0
  k = abs(t-k)
  a = abs(a-k)
  print(t,a)
else:
  t = t-k
  print(t,a)

t,a,k = [x for x in list(map(int,input().split()))]
if k>=t:
    if k-t > a:
        t = 0
        a = 0
    else:
        a = a - (k-t)
        t = 0
    print(t,a)
else:
    t = t-k
    print(t,a)
  
  

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int, input().split())

if A <= K:
    print(0, max(B - (K - A), 0)
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)


Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = [int(v) for v in input().split()]

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

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

print(a, b)

a, b, k = [int(v) for v in input().split()]

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

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

print(a, b)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
[a, b, k] = [int(x) for x in input().split()]

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

print(int(a),int(b))

[a, b, k] = [int(x) for x in input().split()]

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

print(int(a),int(b))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())
if a>k:a=a-k
if a<=k:
  a==0
  b=b+(a-k)
if a+b<=k:
  a==0
  b==0
print(a,b)

a,b,k=map(int,input().split())
if a>k:a=a-k
if a<=k:
  a==0
  b=b+(a-k)
print(a,b)

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
import os
import sys

def main():
    A , B , K = map(int , input().split())
    if K >= A :
        KK = K - A
        A = 0
        if KK >= B :
            B = 0
        else :
            B = B - KK
    else :
        A = A - K
    print (str(A) + " " + str(B))

import os
import sys

def main():
    A , B , K = map(int , input().split())
    if K >= A :
        KK = K - A
        A = 0

        if KK >= B :
            B = 0
        else :
            B = B - KK
    else :
        A = A - K
    print (str(A) + " " + str(B))

if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k = map(int,input().split())
if a == b:
    a -= (k//2 + k%2)
    b -= k//2
elif a > b:
    k -= (a-b)
    a = b - k//2 - k%2
    b -= k//2
else:
    k -= (b-a)
    b = a
    a -= (k//2 + k%2)
    b -= k//2
print(max(a,0),max(b,0))

a,b,k = map(int,input().split())
while k > 0:
  if a == b:
    k = 0
    a -= k//2 + k%2
    b -= k//2
  elif a > b:
    k -= a-b
    a = b
  elif b > a:
    k -= b-a
    b = a
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)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int, input().split())
i = 0
for i in range(K):
  i += 1
  if A >= 1:
    A -= 1
  elif B >= 1:
    B -= 1
  else:
    A += 0
    B += 0

print("高橋君：", A ,"枚、", "青木君：", B, "枚")
    

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

if A >= K:
  A = A - K
  print("高橋：",A,"青木:",B,)

elif B >= K:
  B = A + B - K
  print("高橋：",0,"青木:",B,)
    
else:
  print("高橋：",0,"青木:",0,)
  
    

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
inputted = list(map(int, input().split()))
A = inputted[0]
B = inputted[1]
K = inputted[2]

A2 = max([0, A - K])
B2 = max([0, B - max([0, K - A]))

answer = '{} {}'.format(A2, B2)

print(answer)


inputted = list(map(int, input().split()))
A = inputted[0]
B = inputted[1]
K = inputted[2]

A2 = max([0, A - K])
B2 = max([0, B - max([0, K - A])])

answer = '{} {}'.format(A2, B2)

print(answer)


Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a1 = max(a - k, 0)
if a1 >= 1:
    a2 = b
else:
    a2 = a + b - k
if a2 < 0:
    a2 = 0
print(a1, a2)


a,b,k = map(int, input().split())
a1 = max(a - k, 0)
if a1 >= 1:
    a2 = b
else:
    a2 = a + b - k
if a2 < 0:
    a2 = 0
print(a1, a2)


Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
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)

A,B,K=input().split(" ")
if K<=A:
  A -= K
  print(str(A),str(B))
else:
  A = 0
  B -= K - A
  print(str(A),str(B))
  

A,B,K=input().split(" ")
if K<=A:
  A -= K
  print(str(A)+" "+str(B))
else:
  A = 0
  B -= K - A
  print(str(A)+" "+str(B))

# coding: utf-8
# Your code here!
A,B,K=input().split(" ")
A = int(A)
B = int(B)
K = int(K)

if K<=A:
  A -= K
  print(str(A)+" "+str(B))
else:
  A = 0
  x = B - K
  if x<B:
    B -= x
  else:
    B = 0
  print(str(A)+" "+str(B))


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,K)

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)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = map(int, input().split())
x = max(0, a - k)
print(x, max(0, b + x - k))


a, b, k = map(int, input().split())
print(max(0, a - k), min(b, max(0, a + b - k)))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())
x=a-k
if x<0:
	a=0
    x=k-a
    b=b-k
    if b<0:
		b=0
print(a,b)


a,b,k=map(int,input().split())
x=a-k
if x<0:
	a=0
	x=k-a
	b=b-k
	if b<0:
		b=0
print(a,b)


a,b,k=map(int,input().split())
x=a-k
if x<0:
a=0
x=k-a
b=b-k
if b<0:
b=0
print(a,b)


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)


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int, input().split())
A = A - max(0, K - B)
B = max(B - K, 0)

print(str(A) + " " + str(B))

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

print(str(A) + " " + str(B))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, c = [int(x) for x input().split()]

ma = min(a, c)
a = a-ma
c = c-ma
ma = min(c, b)
b = b - ma
print(str(a)+" "+str(b))

a, b, c = [int(x) for x in input().split()]

ma = min(a, c)
a = a-ma
c = c-ma
ma = min(c, b)
b = b - ma
print(str(a)+" "+str(b))


Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = map(int,input().split())
if a >= k:
    ans = [a-k,b]
else:
    ans = [0,a+b-k]
print(str(ans[0]+" "+str(ans[1])))

# coding: utf-8
# Your code here!

a, b, k = map(int,input().split())
if a >= k:
    ans = [a-k,b]
elif a+b >=k:
    ans = [0,a+b-k]
else :
    ans = [0,0]
print(str(ans[0])+" "+str(ans[1]))

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=[int(x) for x in input().aplit()]

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

a,b,k=[int(x) for x in input().split()]

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


a,b,k=[int(x) for x in input().split()]

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


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B == K :
    print("0 0")
elif A > K :
    print(A-K,"",B)
else :
    for i in range(K) :
        if A != 0 :
            A -= 1
        elif B != 0 :
            B -= 1
        else :
            pass
    print(A,"",B)


in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B >= K :
    print("0 0")
else :
    if A > K :
        print(A-K,"",B)
    elif B > K - A :
        print("0",B-(K-A))
    


in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[1]

for i in range(K) :
    if A != 0 :
        A -= 1
    elif B != 0 :
        B -= 1
    else :
        pass
print(A,"",B)


in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B == K :
    print("0 0")
else :
    for i in range(K) :
        if A != 0 :
            A -= 1
        elif B != 0 :
            B -= 1
        else :
            pass
    print(A,"",B)


in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B <= K :
    print("0 0")
else :
    if A > K :
        print(A-K,"",B)
    elif B > K - A :
        print("0",B-(K-A))


Verdicts: Time Limit Exceeded

Wrong Answer

Wrong Answer

Time Limit Exceeded

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
def main():
    a,b,k = map(int,input().split())
    if a >= k:
        a-=k
    else:
        b -= (k - a)
        a = 0
        if b < 0:
            b = 0
    print(str(A)+" "+str(B))
main()

def main():
    a,b,k = map(int,input().split())
    if a >= k:
        a-=k
    else:
        b -= (k - a)
        a = 0
        if b < 0:
            b = 0
    print(str(a)+" "+str(b))
main()

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b, k=map(int, input().split())
for i in range(k):
    if a>=1:
        a-=1
    elif b>=1:
        b-=1

print(str(a)+" "+str(b)

a,b, k=map(int, input().split())
if k>=a+b:
    print("0 0")
elif k>a:
    print("0"+" "+str(b-(k-a)))
else:
    print(str(a-k)+" "+str(b))

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())

i=o
while i<k:
  if a>0:
    a=a-1
    i=i+1
  elif b>0:
    b=b-1
    i=i+1
print(a,b)
  

a, b, k = map(int,input().split())
if k >= a + b:
  print("0 0")
elif k>a:
  print ("0 "+str(a+b-k))
else:
  print(str(a-k)+" "+str(b))

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):

inputA,inputB,inputC = input().split()

if inputC >= inputA:
    if inputB > inputC-inputA:
        print(0,inputB -(inputC-inputA))
    else:
        print(0,0)
else:
    print(inputA-inputC,inputB)



inputA= int(input())
inputB =map(str,input())

print(inputB.count('ABC'))


inputA,inputB,inputC = map(int, input().split())

if inputC >= inputA:
    if inputB > inputC-inputA:
        print(0,inputB -(inputC-inputA))
    else:
        print(0,0)
else:
    print(inputA-inputC,inputB)



Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A,B,K = map(int, input().split())

if A >= K:
    A -= K
elif A <= K:
    B = max(0, K - A)
    A = 0

print(A, B)


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

if A >= K:
    A -= K
elif A <= K:
    B = max(0, B - (K - A))
    A = 0

print(A, B)




Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
takahashi,aoki,count = map(int,input().split())
if count >= takahashi:
	aoki = aoki - count + takahashi
	takahashi = 0
else:
	takahashi = takahashi - count
aoki = (aoki < 0) and 0
print(takahashi,aoki)


takahashi,aoki,count = map(int,input().split())
if count >= takahashi:
	aoki = aoki - count + takahashi
	takahashi = 0
else:
	takahashi = takahashi - count
if aoki < 0:
	aoki = 0
print(takahashi,aoki)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k =map(int,input().split())

if a <= k:
  print(k-a,b)
elif a<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 a<k<=a+b:
  print(k-a,b-(k-a))
else:
  print(0,0)

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A,B,K=map(int,input().split())
A_print=A
B_print=B
if(K>=A+B):
  A_print=0
  B_print=0
elif(K>=A):
  A_print=0
  B_print=K-A
else:
  A_print=A-K
  B_print=B
print(A_print,B_print)

A,B,K=map(int,input().split())
A_print=A
B_print=B
if(K>=A+B):
  A_print=0
  B_print=0
elif(K>=A):
  A_print=0
  B_print=B-(K-A)
else:
  A_print=A-K
  B_print=B
print(A_print,B_print)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A = int(input())
B = int(input())
K = int(input())

result = K - (A+B)

if (result <=0):
  print(0)
else:
  print(result)

ABK = input()
A = int(ABK[0])
B = int(ABK[1])
K = int(ABK[2])

if (K >= A):
  print(str(K-A) + " " + str(K-A-B))
else:
  print(str(K-A) + " " + str(B))

ABK = input().split()
A = int(ABK[0])
B = int(ABK[1])
K = int(ABK[2])
 
if (K >= A):
  print(str(K-A) + " " + str(K-A-B))
else:
  print(str(K-A) + " " + str(B))

A_B_K = input()

A = int(A_B_K[0])
B = int(A_B_K[1])
K = int(A_B_K[2])
 
result = K - (A+B)
 
if (result <=0):
  print(0)
else:
  print(result)

ABK = input().split()
A = int(ABK[0])
B = int(ABK[1])
K = int(ABK[2])

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

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

print(str(A) + " " + str(B))

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
import sys
from collections import defaultdict

def load(vtype=int):
    return vtype(input().strip())

def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]

def exit():
    import sys
    sys.exit(0)

a, b, k = load_list()

print(a+b-k)

import sys
from collections import defaultdict

def load(vtype=int):
    return vtype(input().strip())

def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]

def exit():
    import sys
    sys.exit(0)

a, b, k = load_list()

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


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = [int(i) for i in input().split()]
maxs = (0, a - k)


print(str(maxs) + " " + str(b - maxs))

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

if a < k:
  a1 = k - a
  a2 = b - a1 if b > a1 else 0
  print('0 ' + str(a2))
        
else:
  print(str(a-k) + ' ' + str(b))

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
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)


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)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int,input().split())
if A >= K:
  r = A - K + B
else:
  r = B - (K - A)
r = 0 if r < 0 else r
print(r)

A, B, K = map(int,input().split())
r1 = A
r2 = B
if A >= K:
  r1 = A - K
elif B > (K - A):
  r1 = 0
  r2 = r2 - (K - A)
else:
  r1 = 0
  r2 = 0
print(r1, r2)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
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 +b-k)
else:
  if a+b>k:
    print(a+b-k)
  else:
    print(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)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())
takahasi = k-a
if takahasi < 0:
  print(0,end=' ')
else:
  print(takahasi)
s = a+b
if s - k < 0:
  print(0)
else:
  print(s-k)


a,b,k=map(int,input().split())
takahasi = k-a
if takahasi < 0:
  print(0,end=' ')
else:
  print(takahasi)
s = a+b
if s - k < 0
  print(0)
else:
  print(s-k)

a,b,k=map(int,input().split())
if a >= k:
  a -= k
else:
  b=max(b-(k-a),0)
  a=0
print("{} {}".format(a,b))


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
if (a + b) > k:
    if a < k:
        b = b - (k - a)
        a = 0
    else:
        a = k - a
else:
    a, b = 0, 0

print(a, b)

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

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

print(a, b)

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
def main():
    a, b, k = map(int, input().split())
    if k >= a+b:
        print(0, 0)
    elif a>k:
        print(a, b)
    else:
        print(k-a)
        b = b - (k - a)
        a = 0
        print(a, b)


# if __name__ == '__main__':
main()


def main():
    a, b, k = map(int, input().split())
    if k >= a+b:
        print(0, 0)
    elif a>=k:
        print(a-k, b)
    else:
        b = b - (k - a)
        a = 0
        print(a, b)


# if __name__ == '__main__':
main()


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A,B,K = map(int, input().split())
print(max(A-K,0),max(B-max(A-K,0),0))

A,B,K=map(int, input().split())
print(max(A-K,0),max(B+min(A-K,0),0))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int, input().split())

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

print('{0} {1}'.format(A, B))
	


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

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

print('{0} {1}'.format(A, B))
	


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
In = input().split(" ")
T = int(In[0])
A = int(In[1])
K = int(In[2])
 
if K>=T+A:
  print("0 0")
else:
	if (K > T):
  		print("0 {0}".format(A-(K-T)))
	elif (T > K):
  		print("{0} {1}".format(T-K, A))
	else:
  		for i in range(K):
    		if T >= 1:
     			 T -= 1
    		else:
    			if A >= 1:
      				A -= 1
    			else:
      				break
  		print("{0} {1}".format(T, A))

In = input().split(" ")
T = int(In[0])
A = int(In[1])
K = int(In[2])
 
if K <= T:
  print("{0} {1}".format(T-K,A))
elif K <= T+A:
  print("0 {0}".format(A-(K-T)))
else:
  print("0 0")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A, B, K = map(int, input().split())


if K<=A:
    print(A-K, B)
elif K<=A+B:
    print(0, B)
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)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
A,B,K = input().split()

for i in range(K):
    if A != 0:
        A -= 1
    elif B != 0:
        B -= 1
    else:
        pass

print(A+" "+B)

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

if A <= K :
    K -= A
    A = 0
    if B <= K :
        K -= B
        B = 0
    else:
        B -= K
else:
    A -= K

print("{} {}".format(A,B))

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = map(int,input().split())

for i in range k:
  if a > 0:
    a = a - 1
  elif b > 0
  	b = b - 1

print(a, b)

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

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

print(a, b)

Verdicts: Runtime Error

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())
c=max(a-k,0)
d=max(b-(a-c),0)
print(c,d)

a,b,k=map(int,input().split())
c=max(a-k,0)
k=a-c
d=max(b-k,0)
print(c,d)


a,b,k=map(int,input().split())
c=max(a-k,0)
k-=a-c
d=max(b-k,0)
print(c,d)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a, b, k = map(int, input().split())

if a >= k:
    a = a-k
else:
    b = b-(k-a)
    a = 0
print("{} {}".format(a,min(0,b)))

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

if a >= k:
    a = a-k
else:
    b = b-(k-a)
    a = 0
print("{} {}".format(a,max(0,b)))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
def solve():
    A, B, K = map(int, input().split())
    ans = []
    if A+B <= K:
        ans = [0, 0]
    if A >= K:
        ans =[A-K, B]
    if A<K<=B:
        ans = [0, B+A-K]
    if K == 0:
        ans = [A, B]
    if A-K < 0:
        ans = [0, B+A-K]
    if A-K == 0:
        ans = [0, B]
    print(*ans)

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()


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,c=map(int,input().split())
if a >= c:
  a = a-c
else:
  a = 0
  b = b - a- c
print(a,b)

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)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has A cookies, and Aoki has B cookies. Takahashi will do the following action K times:    * If Takahashi has one or more cookies, eat one of his cookies.   * Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.   * If they both have no cookies, do nothing.  In the end, how many cookies will Takahashi and Aoki have, respectively?

Submission attempts (in order):
a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
elif:
  print(0,max(b+a-k,0))

a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
else:
  print(0,max(b+a-k,0))

Verdicts: Runtime Error

Accepted