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())
lis_h = list(map(int, input().split()))

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] -= 1
        if lis_h[i - 1] < lis_h[i - 2]:
            print("No")
            exit()
print("Yes")


N = int(input())
lis_h = list(map(int, input().split()))

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] -= 1
        if lis_h[i - 1] < lis_h[i - 2]:
            print("No")
            exit()
print("Yes")

N = int(input())
lis_h = list(map(int, input().split()))

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] += -1
        if lis_h[i - 1] < lis_h[i - 2]:
            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

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(C)
else:
    print(A - B)

A, B, C = map(int, input().split())
if A - B >= C:
    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 = [int(x) for x in inpput().split()]
print(b+c-a if b+c-a > 0 else 0)

a,b,c = [int(x) for x in input().split()]
print(b+c-a if b+c-a > 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):
a, b, c = map(int, input().split())
ans = a-b-c 
if ans>0:
    print(ans)
else :
    print(0) 
    

a, b, c = map(int, input().split())
ans = b+c-a 
if ans>0:
    print(ans)
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 = list(map(int, input().split()))
a = H[0]
for i in range(1,N-1):
    a = max(H[i], a)
    b = H[i+1]
    if a - b >= 2:
        print("No")
        break
print("Yes")

A, B, C = map(int, input().split())
print(C-(A-B) if C >= (A-B) 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):
import time

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

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

else:
    print(0)

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

if (B + C) >= A:
    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 = map(int, input().solit())
answer = c - (a- b)
print(answer)

a, b, c = map(int, input().solit())
capacity = a - b
answer = c - capacity
if answer < 0:
  answer = 0
print(answer)

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

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):
i = input()
i1 = list(map(int, i.split() ) )
i2 = i1[0] - i1[1]
i3 = i1[2] - i2
		if i3 < 0:
 				i3 = 0
		else:
 				i3 = i3

print(i3)

i = input()
6 4 3
i1 = list(map(int, i.split() ) )
i2 = i1[0] - i1[1]
i3 = i1[2] - i2
		if i3 < 0:
 				print(0)
		else:
 				print(i3)


i = input()
i1 = list(map(int, i.split() ) )
i2 = i1[0] - i1[1]
i3 = i1[2] - i2
if i3 < 0:
 print("0")
else:
 print(i3)

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

if b + c >= a:
    print(a)
else:
    print(b+c)


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

if b + c >= a:
    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 = 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):
A,B,C = map(int, input().strip())
print(C-(A-B))

A,B,C = map(int, input().split())
print(C-min(A-B, 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())

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):
A,B,C=map(int,input().split())
if C-A-B<=0:
    print("0")
else: print(C-A-B)

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

A_=input(A?)
B_=input(B?)
C_=input(C?)
s=C_-A_+B_
print(s)

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

Verdicts: Wrong Answer

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

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

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

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

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

Verdicts: Wrong Answer

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())
l = list(map(int, input().split())) 
l2 =[]
i = len(l)
for i in range(len(l):
  if l[i] > l[i-1]:
    l[i] += 1
    i += 1

i = 0
l2 = [l[i] <= l[i+1] for i in range(len(l)-1)]

if all(l2):
  print("Yes")
else:
  print("No")

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

l = c - (a - b)

if l < 0:
  print(0)
else:
  print(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):
A, B, C = map(int,input())
if A < B + C :
  print(C - (A - B))
else:
  print(0)



A, B, C = map(int,input().split())
if A < B + C :
  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 = map(int,input().split())



D = A-B


E = D-C

print(E)

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



D = A-B


E = D-C

if E>=0:
    print(E)
else:
    print("0")

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



D = C-(A-B)

if D>=0:
    print(D)
else:
    print("0")

Verdicts: Wrong Answer

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):
S = input()
N = len(S)
S = list(S)
Children = [0]*N

RL = []
LR = []
for i in range(N-1):
    if S[i] == 'R' and S[i+1] == 'L':
        RL.append(i+1)
    elif S[i] == 'L' and S[i+1] == 'R':
        LR.append(i+1)
LR.append(N)

Change = sorted(RL+LR)

Child = [LR[0]]
for i in range(1,len(LR)):
    Child.append(LR[i]-LR[i-1])

dig = [0]*len(Change)
dig[0] = Change[0]
for i in range(1,len(Change)):
    dig[i] = Change[i] - Change[i-1]

Rtype = [0]*len(RL)
for i in range(len(RL)):
    if Child[i] % 2 == 0:
        Rtype[i] = 0
    else:
        if dig[2*i]%2==0:
            Rtype[i] = 1
        if dig[2*i+1]%2==0:
            Rtype[i] = -1

k=0
for i in range(N):
    if i+1 in RL: 
        if Rtype[k] == -1:
            Children[i] += Child[k]//2 + 1
        else:
            Children[i] += Child[k]//2
    if i in RL: 
        if Rtype[k] == 1:
            Children[i] += Child[k]//2 + 1
        else:
            Children[i] += Child[k]//2
        k += 1

print(*Children)


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

if C-A+B < 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())
if (A-B) >= C:
	print(0)
else:
  prnt(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):
N = int(input())

count = 0

if N < 10:
    print(N)
elif N < 100:
    print(9)
elif N < 1000:
    print(9 + min(N,999) - 100 + 1)
elif N < 10000:
    print(9 + 900)
elif N < 100000:
    print(9 + 900 + min(N , 99999) - 10000 + 1)
else:
    print(90909)

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=input()
l=len(a)
a=int(a)
if a==100000:
  print(90909)
elif 99999>=a>=10000:
  print(909+a-9999)
elif 9999>=a>=1000:
  print(909)
elif 999>=a>=100:
  print(9+a-99)
elif 99>=a>=10:
  print(9)
else:
  print(a)


a,b,c=map(int,input().split())
d=a-b
print(max(0,c-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):
N = int(input())
H = map(int, input().split())
H = list(H)
res = 'Yes'
for i in range(len(H) - 1):
  for j in range(i + 1, len(H)):
    if H[i] - H[j] >= 2:
      res = 'No'
      break
  if res == 'No':
    break
print(res)


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

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())
ans = c - (a - b)
if(ans < 0):
  print(0)
else:
  print(ans)

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):
a,b,c = map(int,input().split())
e = b - a
ans = c - e
print(ans if ans > 0 else "0")


a,b,c = map(int,input().split())
e = a - b
ans = c - e
print(ans if ans > 0 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(A, B+C))

A, B, C = map(int, input().split())
if A >= B+C:
  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):
def transfer(A, B, C):
    return (B + C - A) if (B + C) > A else 0

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

(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

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):
x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if ans > 0:
  print(ans)
else:
  print(0)


x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if ans > 0:
  print(ans)
else:
  print 0


x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if c > 0:
  print(c)
else:
  print(0)


x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if c > 0:
  print(c)
else:
  print 0


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


Verdicts: 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):
a,b,c = [int(x) for x input().split()]
i = c - (a - b)
if i < 0:
  print(0)
else :
  print(i)

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

a,b,c = [int(x) for x in input().split()]
i = c - (a - b)
if i < 0:
  print(0)
else :
  print(i)

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=input()
Num = len(N)
if Num == 5:
		Ans = (int(N)-9999) + 900 + 9
elif Num == 4:
		Ans = 900 + 9
elif Num == 3:
		Ans = (int(N)-99) + 9
elif Num == 2:
		Ans = 9
elif Num == 1:
		Ans = N
elif Num == 6:
		Ans = 90000 + 900 + 9    
print(Ans)

A,B,C=map(int,input().split())
print(0 if C<A-B else 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 b+c>=a:
  print(a)
else:
  print(b+c)

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

a,b,c=map(int,input().split())
if b+c>=a:
  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):
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()))
cap=a-b
use=min(a-b,c)
ans=c-use
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 = map(int, input().split())
ans = b + c - a

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


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

if bc > a:
    bc -= a
    print(bc)
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())

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

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

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

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

s = C-(A-B)
print(s 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):
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

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):
    if H[i] - H[i+1] > 1:
        print('No')
        exit()

print('Yes')

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

print(C - min(A-B, 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):
str = input()
num = int(str)
const = len(str)
numbers = len(str)
even = 0
con = 0
a = str[even:const]
b = int(a)
if numbers%2==1:
    pass
else:
    even += 1
    numbers -= 1
    a = str[even:const]
    b = int("9"*(numbers))
while numbers > 0:
    con += (b - 10**(numbers-1) + 1)
    even += 2
    numbers -= 2
    if numbers>0:
        a = str[even:const]
        b = int("9"*(numbers))
print(con)


str = "37"
# str = input()
num = int(str)
const = len(str)
numbers = len(str)
even = 0
con = 0
a = str[even:const]
b = int(a)
if numbers%2==1:
    pass
else:
    even += 1
    numbers -= 1
    a = str[even:const]
    b = int("9"*(numbers))
while numbers > 0:
    con += (b - 10**(numbers-1) + 1)
    even += 2
    numbers -= 2
    if numbers>0:
        a = str[even:const]
        b = int("9"*(numbers))
print(con)

str = input().split(" ")

if int(str[0])-int(str[1]) >= int(str[2]):
    print(0)
else:
    print(int(str[2])-int(str[0])+int(str[1]))

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 = map(int,input().split())
if b*c-a <= 0:
  print(0)
else:
  print(b*c-a)

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

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

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 = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
youki1 = B
youki2 = C
youki21 = A-B
youki2 = youki2 - youki21

a = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
youki1 = B
youki2 = C
youki21 = A-B
youki2 = youki2 - youki21
print(youki2)a = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
print(C-(A-B))

a = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
if C-(A-B) >= 0:
    print(C-(A-B))
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(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):
A,B,C=map(int,input().split())
print((A-B)%C)

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 = map(int,input().split())
print(b+c-a,0)[b+c-a<=0:]

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

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(abs(a-b+c))

a, b, c = map(int, input())
print(abs(a-b+c))

a, b, c = map(int, input().split())
if a < b+c:
	print(abs(a-(b+c)))
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):
n = int(input())
if n == 1:
  print("Yes")
  exit()

h_list = [int(h) for h in input().split()]

for index in range(0,n-1):
  if h_list[index] > h_list[index+1]:
    h_list[index] = h_list[index]-1

for index in range(1, n):
  if h_list[index-1] > h_list[index]:
    print("No")
    exit()
print("Yes")

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


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):
given = int(input())
ans = 0
for i in range(given):
  current = str(i + 1)
  if len(current) & 1:
    ans += 1
  
print(ans)

given = int(input())
ans = 0
for i in range(given):
  current = str(i + 1)
  ans += len(current) & 1
print(ans)

a, b, c = [int(x) for x in input().split()]
print(c - min(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):
6 4 3

A,B,C = list(map(int,input().strip().split()))
s = A - B
a = C - s
if a >= 0:
    print(a)
elif a < 0:
    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(min(a,b+c))

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: 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 = (int(x) for x in input().split())


youki = a - b
nokori = youki-c

print(nokori)


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


youki = a - b
nokori = youki-c

if nokori < 0 :
    print(0)

else :
    print(nokori)


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


mizu = b + c
amari = mizu-a

if amari <= 0 :
    print(0)

else :
    print(amari)

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):
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())


print("{}".format(c-(a-b) if c-(a-b) < 0 else 0))

# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())

s = input()

print("{}".format(c-(a-b)))

# -*- coding: utf-8 -*-

a, b, c = map(int, input().split())
print("{}".c-(a-b))

# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())


print("{}".format(c-(a-b) if (c-(a-b)) > 0 else 0))

Verdicts: Wrong Answer

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(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):
S = input()

peaple = [0]*len(S)

l_count = 1
r_count = 1
update_r = 1

for i in range(1,len(S)):
  if S[i] == 'R' and S[i-1] == 'R':
      r_count+=1
  elif S[i] == 'L' and S[i-1] == 'R':
      add_peaple = r_count // 2
      if r_count % 2 == 0:
        peaple[i-1] += add_peaple
      else:
        peaple[i-1] += add_peaple + 1
      peaple[i] += add_peaple
      update_r = i-1
      r_count = 1
  elif S[i] == 'L' and S[i-1] == 'L':
      l_count+=1
  elif S[i] == 'R' and S[i-1] == 'L':
      add_peaple = l_count // 2
      if l_count % 2 == 0:
         peaple[update_r+1] += add_peaple
      else:
         peaple[update_r+1] += add_peaple + 1
      peaple[update_r] += add_peaple
      l_count = 1
      
add_peaple = l_count // 2
if l_count % 2 == 0:
    peaple[update_r+1] += add_peaple
else:
    peaple[update_r+1] += add_peaple + 1
peaple[update_r] += add_peaple
      
for idx, p in enumerate(peaple):
    if idx < (len(S)-1):
      print(p,end = ' ')
    else:
      print(p)

def LI():
	return [int(s) for s in input().split()]

A,B,C = LI()
      
print(C - (A-B)) if C-(A-B) > 0 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())
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)


A,B,C = map(int,input().split())
if C-A+B>0:
    print(C-A+B)
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):
a,b,c = map(int,input().split())
print(min(a+c,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=(int(x) for x in input().split())
print(A+B-C)

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

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

args = sys.argv

a = int(args[1])
b = int(args[2])
c = int(args[3])

zan = 0
if a >= b:
    zan = a - b
res = c - zan
if res <= 0:
    res = 0
print(res)


import sys

args = sys.argv

a = int(args[1])
b = int(args[2])
c = int(args[3])

zan = 0
if a >= b:
  zan = a - b
res = c - zan
if res <= 0:
  res = 0
print(res)


A = [int(x) for x in input().split()]
a = A[0]
b = A[1]
c = A[2]
zan = 0
if a >= b:
  zan = a - b
res = c - zan
if res <= 0:
  res = 0
print(res)


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()))
h[0]=h[0]-1
for i in range(1,n):
    try:
        if h[i]-1>=h[i+1]:
            h[i]=h[i]-1
    except IndexError:
        pass
for i in range(n):
    try:
        if h[i]>h[i+1]:
                print("No")
                exit()
    except IndexError:
        pass
print("Yes")

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 = [int(x) for x in input().sprit()]
print(max([c-(a-b),0]))

a,b,c = [int(x) for x in input().split()]
n = c-(a-b)
print(n if n > 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):
A = map(int, input().split())
E=A[0]
B=A[1]
C=A[2]
D=C-(E-B)
print(D)

A = map(int, input().split())
A=A[0]
B=A[1]
C=A[2]
D=C-(A-B)
print(D)

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

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

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

diff = (a-b)

if c >= diff:
  print(0)
else:
  print(c-diff)

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


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=input().split()
for i in range(3):
    a[i]=int(a[i])

b=int(a[2]-a[0]+a[1])
if b>0:
    print(b):
else:
    print(0)


a=input().split()
for i in range(3):
    a[i]=int(a[i])

b=a[2]-a[0]+a[1]
if b>0:
    print(int(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 = 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):
n=int(input())
if n<10:
  print(n)
elif n<100:
  print(9)
elif n<1000:
  print(9+(n-99))
elif n<10000:
  print(909)
elif n<100000:
  print(909+(n-9999))
else:
  print(90909)

a, b, c=map(int,input().split())
d=c-(a-b)
if d>0:
  print(d)
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 = intput().split()
A,B,C = int(A),int(B),int(C)

print(C-(A-B))

A,B,C = intput().split()
A,B,C = int(A),int(B),int(C)

print(max([C-(A-B),0])

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

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):
N = int(input())
H = list(map(int, input().split()))
ok = True
for i in range(N - 2):
    if (H[i] > H[i + 1] and H[i + 1] > H[i + 2]) or H[i]-H[i+1]>1:
        ok = False
if H[-2] - H[-1] > 1:
    ok = False
if ok:
    print("Yes")
else:
    print("No")


A,B,C = map(int,input().split())
print(C-(A-B)) if C-(A-B) > 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):
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())
if b+c <= a:
    print(b+c)
else:
    print(a)

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

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,b+c-a)

n = int(input())
if n < 10:
  ans = n
elif n < 10**2:
  ans = 9
elif n < 10**3:
  h = n-99
  ans = h+9
elif n < 10**5:
  t_t = n - 9998
  ans = t_t + 909
  
print(ans)

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

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()))
ans='Yes'
for i in range(n-1,0,-1):
    print(h[i])
    if h[i]>h[i-1]:
        continue
    elif h[i]+1==h[i-1]:
        h[i-1]-=1
    else:
        ans='No'
print(ans)

a, b, c = map(int, input().split())
if b+c>a:
    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):
print(max(0,eval('-'+input().replace(' ','+')))

print(max(0,eval('-'+input().replace(*' +'))))

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().strip().split()))
ans = min(a, b + c)
print(ans)


a, b, c = list(map(int, input().strip().split()))
ans = max(c - (a - b), 0)
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())
kotae = c - (a - b)
if kotae > 0:
  print(kotae)
else:
  print(0)

a, b, c = map(int, input().split())
kotae = c - (a - b)
if kotae > 0:
  print(kotae)
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(i) for i in input().split(" ")
print(B+C-A if B+C-A>0 else 0)


A,B,C=[int(i) for i in input().split(" ")]
print(B+C-A if B+C-A>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):
a,b,c=map(int,input().split())
x=np.where(c-(a-b)>0,c-(a-b),0)

print(x)

a,b,c=int(input())
x=np.where(c-(a-b)>0,c-(a-b),0)

print(x)

import numpy as np

a,b,c=map(int,input().split())
print(np.where(c-a+b>0,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(0 if a>=(b+c) else c-a-b)

a,b,c=map(int,input().split())
print(0 if a>=(b+c) else 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):
import numpy as np

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

h = np.array(h)

for i in range(len(h)-1):
   if h[i] < h[i+1]:
       h[i+1] -= 1
np.diff(h-1, n=1)

minus = [i for i in np.diff(h-1, n=1) if i < 0]

if len(minus) > 0:
    print('No')
else:
    print('Yes')


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

c1 = b
c2 = c
cap = a - b

c1 = c1 + cap
c2 = c2 - cap

if c2 < 0:
    c2 = 0
print(c2)

Verdicts: Runtime Error

Accepted