TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
n = int(input())
h = list(map(int, input().split(" ")))
a = 'Yes'
m = 0
for i in range(1, len(h)):
    m = max(h[i], m)
    if h[i] < h[i-1] and m - h[i] > 1:
        a = 'No'
        break
print(a)


a,b,c = list(map(int, input().split(" ")))
l = a-b
if l >= c:
    print(0)
else:
    print(c-l)


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
if __name__ == '__main__':
	A,B,C = map(int, input().split())
	print(A,B,C)
	
	if (A - B - C ) >= 0:
		print('0')
	else :
		print(C - (A-B))

if __name__ == '__main__':
	A,B,C = map(int, input().split())	
	if (A - B - C ) >= 0:
		print('0')
	else :
		print(C - (A-B))


Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c=map(int,input().split())
d=a-b
if d>=c:
  print(0)
else:
  print(c-d)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

A, B, C = map(int, input().split())
print(C - (A-B) if A-B >= C else 0)

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
a,b,c = list(map(int,input().split()))
d = c-a-b

if d>0:
  print(d)
else:
  print(0)

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

a,b,c = list(map(int,input().split()))
d = c-a-b
print(d)

a,b,c = list(map(int,input().split()))
d = c-a+b

if d>0:
  print(d)
else:
  print(0)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
#c-(a-b)
print(max(-1*int(input())+int(input())+int(input()),0))

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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


Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

print(min(C,A-B))

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

print(C - min(C,A-B))

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
a,b,c =int(input())

if a=<b:
  ans=c
elif:
  ans=c-(a-b)
  if ans<0:
    ans=0
    
  
print(ans)

a,b,c =input().split()

if a=<b:
  ans=c
else:
  ans=c-(a-b)
  if ans<0:
    ans=0
    
  
print(ans)

a,b,c =int(input().split())

if a=<b:
  ans=c
else:
  ans=c-(a-b)
  if ans<0:
    ans=0
    
  
print(ans)

a,b,c =int(input())

if a=<b:
  ans=c
else:
  ans=c-(a-b)
  if ans<0:
    ans=0
    
  
print(ans)

a,b,c =int(input())

if a=<b:
  ans=c
elif:
  ans=c-(a-b)
  if ans<0:
    ans=0
    
  
print(ans)

a,b,c = map(int,input().split())
ans = 0

if a <= b:
    ans = c
else:
	ans = c-(a-b)
	if ans < 0:
		ans = 0
    
print(ans)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
# -*- coding:utf8 -*-

a,b,c = map(int,input().split())
c = 0 if c-a-b < 0 else c-a-b
print(c)

# -*- coding:utf8 -*-

a,b,c = map(int,input().split())
c = 0 if c-(a-b) < 0 else c-(a-b)
print(c)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
import sys

N = int(input())
H = list(map(int, input().split()))
ans = ("Yes")

for i in range(N-1):
  if H[i] - H[i+1] == 1:
    H[i+1] -= 1
  elif H[i] - H[i+1] >= 2:
    ans = ("No")
    print(ans)
    sys.exit()

print(ans)

A, B, C = list(map(int, input().split()))
ans = max(C-A+B, 0)
print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
# coding: utf-8
# Your code here!
n=input().split(" ")
for i in range(3):
  n[i]=int(n[i])
ans=(n[2]-(n[1]-n[0])
if ans <0:
	print(0)
else:
     print(ans)
     


# coding: utf-8
# Your code here!
n=input().split(" ")
for i in range(3):
  n[i]=int(n[i])
ans=(n[2]-(n[0]-n[1]))
if ans < 0:
	print(0)
else:
     print(ans)
     


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
A,B,C=(int,input().split())
D=C-(A-B)
if D<=0:
   print(0)
else:
   print(D)


A,B,C=(int,input().split())
D=C-(A-B)
if D<=0
   print(0)
else:
   print(D)

A,B,C=map(int,input().split())
D=C-(A-B)
if D<=0:
   print(0)
else:
   print(D)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

C =- (A - B)
print(C)

A = imput()
B = imput()
C = imput()

C =- (A - B)
print(C)

A = int(input())
B = int(input())
C = int(input())

C = C - (A - B)
if C < 0:
    C = 0
print(C)

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

C = C - (A - B)
if C < 0:
    C = 0
print(C)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
n = int(input())
if n <= 9:
  print(n)
elif n <= 99:
  print(9)
elif n <= 999:
  print(9+n-100+1)
elif n <= 9999:
  print(909)
elif n <= 99999:
  print(909+n-10000+1)
else:
  print(90909)

n = list(map(int,input().split()))

if n[2]-n[0]+n[1] > 0:
  print(n[2]-n[0]+n[1])
else:
  print(0)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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


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


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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
import sys
A,B,C = map(int,input().split())
if not ( 1 <= B <= 20 and B <= A <= 20 ): sys.exit()
if not ( 1 <= C <= 20 ): sys.exit()

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

import sys
A,B,C = map(int,input().split())
if not ( 1 <= B <= 20 and B <= A <= 20 ): sys.exit()
if not ( 1 <= C <= 20 ): sys.exit()

res =  C - (A - B)
print(res) if res >= 0 else print(0) 

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
li = list(map(int,input().split()))
ans=li[2]-(li[0]-li[1])
if ans>=0:
  print(ans)
elif:
  print("0")

li = list(map(int,input().split()))
ans=li[2]-(li[0]-li[1])
if ans>=0:
    print(ans)
else:
    print("0")



Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

count = 1
answer = [0] * len(S)

n = 0
for i in range(len(S) - 1):
    if (S[i] == S[i + 1]):
        count += 1
    else:
        if (S[i + 1] == 'R'):
            
            answer[n] += count // 2
            answer[n + 1] += -(-count // 2)
            count = 1
        else:
            
            answer[i] += -(-count // 2)
            answer[i + 1] += count // 2
            count = 1
            n = i
    
    if (i == len(S) - 2):
        answer[n] += count // 2
        answer[n + 1] += -(-count // 2)

for c in answer:
    print(f"{c} ", end='')
print()


inputNum = list(map(int, input().split()))

A = inputNum[0]
B = inputNum[1]
C = inputNum[2]

if ((C - (A - B)) > 0):
    print(C - (A - B))
else:
    print(0)


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

if B + C <= A:
  result == 0
else:
  result = B+C-A

print(result)

a = int(input())
        
result =0
for i in range(1,a+1):
  if len(str(i)) % 2 == 1:
      result = result + 1

print(result)

A, B, C = input().split()
 
if B + C <= A:
  result = 0
else:
  result = B+C-A
 
print(result)

A, B, C = input().split()

a = int(A)
b = int(B)
c = int(C)
if b + c <= a:
  result = 0
else:
  result = b+c-a
 
print(result)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
 
ans = 0
 
for i in range(1,N+1):
    if len(str(i)) % 2 == 1:
        ans += 1

print(ans)

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

aa = C - (A - B)

if aa > 0:
  print(aa)
else:
  print(0)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

A, B, C = stdin.readline().rstrip().split()
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

A, B, C = map(int, input().split())
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))
for i in range(N-1,0,-1):
    if H[i]>H[i-1]:
        if H[i]>(H[i-1]-1):
            print("No")
            exit()
print("Yes")


N = int(input())
H = list(map(int, input().split()))
for i in range(N-1,0,-1):
    if H[i]>H[i-1]:
        if H[i]>(H[i]-1):
            print("No")
            exit()
print("Yes")


A, B, C = map(int, input().split())
print(C-A+B if C-A+B>0 else 0)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
lg = len(str(N))
cnt = 0
if lg == 6:
    cnt = 90909
elif lg == 5:
    cnt += N - 10000 + 1
    cnt += 909
elif lg == 4:
    cnt = 909
elif lg == 3:
    cnt += N - 100 + 1
    cnt += 9
elif lg == 2:
    cnt = 9
else:
    cnt = N
print(cnt)

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
x=int(input().split)
A=x[0]
B=x[1]
C=x[2]
if B+C-A>0:
    print(B+C-A)
else:
    print(0)


x=input().split()
A=int(x[0])
B=int(x[1])
C=int(x[2])
if B+C-A>0:
    print(B+C-A)
else:
    print(0)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
A,B,C = map(int,input().split())
print(A-B+C)

A,B,C = map(int,input().split())
if C-A+B >= 0:
  print(C-A+B)
else:
  print("0")

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):

a = int(input())
b = int(input())
c = int(input())


transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)


a = input()
b = input()
c = input()


transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)



res = str(input())
print(res)
list = res.split(" ")

a = int(list[0])
b = int(list[1])
c = int(list[2])
transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)




res = str(input())

list = res.split(" ")

a = int(list[0])
b = int(list[1])
c = int(list[2])
transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
n = int(input())
nums = [int(i) for i in input().split()]

bool = True
for i in range(n, 0, -1):
    t = nums[i] - 1
    if t < nums[i-1]:
        bool = False

if bool:
    print("Yes")
else:
    print("No")


a, b, c = [int(input()) for _ in range(3)]

if (b + c) - a < 1:
    print(0)
else:
    print(b+c-a)

a, b, c = [int(input()) for _ in range(3)]
ans = b+c-a
if ans < 1:
    print(0)
else:
    print(ans)


a, b, c = map(int, input().split())
ans = b+c-a
if ans < 1:
    print(int(0))
else:
    print(ans)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c = map(int,input().split())
print(min(a-b,c))

a,b,c = map(int,input().split())
print(c-min(a-b,c))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
A=list(map(int,input().split()))
i=0
j=0
ask=0
while(j<N):
    while(i<N-1):
        x=A[i+1]-A[i]
        if x<-1:
            ask=1
            break
        elif x==-1:
            A[i]=A[i]-1
            break
        i=i+1
    j=j+1
    i=j
if ask==0:
    print('Yes')
else:
    print('No')


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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

if C <= A - B:
    ans = 0
else:
    ans = C - A - B

print(ans)

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

if C <= A - B:
    ans = 0
else:
    ans = C - A + B

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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


Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c = map(int, input().split())
d = b+c-a
if d<=0:
  print(0)
else:
  print(d)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

if B+C < A:
    print(B+C-A)
else:
    print(0)

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

if A-B < C:
    print(C-(A-B))
else:
    print(0)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
a, b, c = list(map(int, input().split(' ')))
print(a)
print(b)
print(c)

result = a - b
result = c - result
if result > 0:
    print(result)
else:
    print(0)


a, b, c = list(map(int, input().split(' ')))
# print(a)
# print(b)
# print(c)

result = a - b
result = c - result
if result > 0:
    print(result)
else:
    print(0)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
n = int(input())
h = [int(x) for x in input().split()]
h.reverse()
 
flag = True
 
for i in range(1, n):
    if h[i - 1] >= h[i]:
        continue
    elif h[i] == h[i - 1] + 1:
        h[i] -= 1
    else:
        flag = False
        break
 
print('Yes') if flag else print('No')

A,B,C = map(int,input().split())
 
nokori = C - (A-B)
 
if nokori < 0:
    print(0)
else:
    print(nokori)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
A, B, C = map(int, input().split())
if C - (A - B) > 0 and C - (A - B) == 0:
    print(C - (A - B))
else:
    print(0)

A, B, C = map(int, input().split())
tmp = C - A + B
if tmp > 0 or tmp == 0:
    print(tmp)
elif tmp < 0:
    print(0)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
#!/bin/python3

import os
import sys


if __name__ == '__main__':
    a = input().split()
    b = input().split()
    c = input().split()

	result = c - (a - b)
    if result > 0:
      result = 0
    print(result)

#!/bin/python3
 
import os
import sys


a = input().split()
result = int(a[2])+int(a[1])-int(a[0])
if result < 0:
  result = 0
print(result)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
ans = 0
for i in range(1, N+1):
  if len(str(i)) % 2 == 1:
    ans += 1
print(ans)

A, B, C = list(map(int, input().split()))
ans = B + C - A
if ans < 0:
  ans = 0
print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,cmap(int,input().split())
if a-b>=c:
    print(0)
else:
    print(c-a-b)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
def main():
    n = int(input())
    h = list(map(int, input().split()))

    pre = 0
    flag = True
    for i in range(n):
        if h[i] - 1 >= pre:
            h[i] -= -1
        if h[i] < pre:
            flag = False
            break
        pre = h[i]
    
    if flag:
        print('Yes')
    else:
        print('No')
                

if __name__ == '__main__':
    main()

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

if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
input_data = input().rstrip().split(' ')
A = int(input_data[0])
B = int(input_data[1])
C = int(input_data[2])
print(C - (B - A))

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


Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
a,b,c = map(int,input())
print(min(c-(a-b),0))

a,b,c = map(int,input())
print(min(c-(a-b),0)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
H = list(map(int, input().split()))
flag = 0
No = 0

for i in range(N-1):
    diff = H[i+1]-H[i]   
    
    if diff < -1 or (diff == -1 and flag ==1):
        No = 1
    elif diff == -1 and flag == 0:
        flug = 1
    elif diff > 0:
        flug = 0    
        
if No == 0: print("Yes")
else: print("No")

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


ans = C-(A-B)
if ans<0:
  ans = 0
  
print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
a = [int(s) for s in input().split()]
b = int(a[1] - a[0])
c = a[2] - b
if int(c) < 0:
  print("0")
else:
  print(c)

a = [int(s) for s in input().split()]
b = int(a[0] - a[1])
c = a[2] - b
if int(c) < 0:
  print("0")
else:
  print(c)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

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

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


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c=(int(x) for x in input().split())
  
if b+c > a:
  print(b+c-a)
else:
  print(0)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

ans = min(0, c-abs(a-b))

print(ans)

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

ans = min(0, c-(a-b))

print(ans)

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

ans = max(0, c-(a-b))

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c = map(int, input().split())
w = (b+c)-a
if w < 1:
    w = 0
print (w)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

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

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


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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


a, b, c = map(int, input().split())
d = 0
e = c - ( a - b )
if a - b > c:
  print (d)
else:
  print (e) 

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c=map(int,input().split())
print(c-(a-b) if c>a-b else 0)

Verdicts: Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = input()
nlen = len(N)
cnt = 0
for i in range(1, nlen):
  if i % 2:
    cnt += (10 ** i) - (10 ** (i - 1))
N = int(N)
if nlen % 2:
  cnt += N - 10 ** (nlen - 1) + 1
print(cnt)

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

res = c -(a - b)
print(res if res > 0 else 0)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
sum = 0
for i in range(1,N+1):
  if len(str(i)) % 2 == 1:
    sum += 1
print(sum)

A = int(input())
B = int(input())
C = int(input())
print(max(0,B+C-A))

N = int(input())
sum = 0
for i in range[1,N+1]:
  if len(i) % 2 == 1:
    sum += 1
print(sum)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

A, B, C = map(int, input().split())
if A - B >= C:
    print(0)
else:
    print(C - A + B)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
input()
vs=list(map(int, input().split(" ")))
k = 0
for i in range(0, len(vs)-1):
	if vs[i] - vs[i+1] >= 2:
		k = 100
		break
	if vs[i] - vs[i+1] == 1:
		k += 1
		if k >= 2:
			break
	elif vs[i+1] - vs[i] >= 1:
		k = 0
if k > 1:
	print("No")
else:
	print("Yes")


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


Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
H_list = list(map(int,input().split()))
Flag = False
if N == 1:

    print("Yes")
    
else:
    for i in range(N):
        if H_list[N-1-i-1] - H_list[N-1-i] > 1:
            print("No")
            break
        elif H_list[N-1-i-1] - H_list[N-1-i] == 1:
            H_list[N-1-i-1] = H_list[N-1-i-1] -1
        else:
            continue
     
Flag = True

if Flag == True:
    print("Yes")

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

if (C - A + B) >= 0:

	C = C - (A - B)
	print(C)
else:
	print(0)
	

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):

#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>


#include <deque>
#include <stack>
#include <map>
#include <set>




using namespace std;
#define All(v) (v).begin(),(v).end()
const long long mod = 1000000007;
const long long inf = mod*mod;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
signed main(){
    int a,b,c;
    cin >> a >> b >> c;
    cout << max(c - a + b, 0) << endl;
}

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

a,b,c = map(int,input().split())
if a > c :
    print(c)
else:
    print(c-a)

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
n = int(input())
h = list(map(int,input().split()))
submax = 0

for i in range(n-1):
  for j in range(i+1,n):
    if h[i] - h[j] >= 2:
      submax = 1
      break
  if submax == 1:
    break

if submax == 1:
  print("No")
else:
  print("Yes")

a,b,c = map(int,input().split())
yoyuu = a-b
nokori = c- yoyuu

if nokori < 0:
  print(0)
else:
  print(nokori)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
def divisors(n) -> list:
  res = []
  for i in range(1, int(n ** 0.5) + 1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  
  return res

print(divisors(10))

# [1, 10, 2, 5]

print(divisors(1))

# [1]


def divisors(n) -> list:
  res = []
  for i in range(1, int(n ** 0.5) + 1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  
  return res

print(divisors(10))

# [1, 10, 2, 5]

print(divisors(1))

# [1]

a,b,c=map(int, input().split())  
if(c-(a-b)>0):
    print(c-(a-b))
else:
    print("0")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
A = list(map(int,input().split()))
print(A[2] - (A[1]-A[2]))

A = list(map(int,input().split()))
print(A[2] - (A[1]-A[2])

A = list(map(int,input().split()))
if A[2] > A[0]-A[1]:
    print(A[2] - (A[0]-A[1]))
else:
    print(0)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

a,b,c = map(int,input().split())
ans = c-(a-b)
if ans <0:
  print("0")
else:
  print(ans)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
list_ = input().split()
remain_quant = int(list_[0] - list_[1])
if remain_quant >= int(list_[2]):
  print(0)
else:
  print(int(list_[2] - remain_quant)

list_ = input().split()
remain_quant = int(list_[0]) - int(list_[1])
if remain_quant >= int(list_[2]):
  print(0)
else:
  print(int(list_[2]) - remain_quant)

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

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

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

Verdicts: Runtime Error

Accepted
Problem: We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2?

Submission attempts (in order):
N = int(input())
li = list(map(int,input().split()))
li2 = []
key =[0] 
cnt = 0
flg = True
if N == 1:
    ans ="Yes"
    flg = False
while flg :
    cur1 = li[cnt]
    cur2 = li[cnt+1]
    sa = cur2 - cur1
    if key[cnt] == 0:
        if sa < -1:
            ans = "No"
            flg = False
        elif sa == -1:
            key.append(1)
            cnt += 1
        else:
            key.append(0)
            cnt += 1
    else:
        if sa < 0:
            ans = "No"
            flg = False
        else:
            key.append(0)
            cnt += 1
    if cnt == len(li)-1:
        ans = "Yes"
        flg = False
print(ans)

A,B,C = map(int,input().split())
A2 = A-B
if A2 >= C:
    ans =0
else:
    ans = C - A2
print(ans)

Verdicts: Runtime Error

Accepted