Problem:


Score : 100 points

Problem Statement

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?

Constraints

All values in input are integers.

1 \leq B \leq A \leq 20

1 \leq C \leq 20

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the integer representing the amount of water, in milliliters, that will remain in Bottle 2.

Sample Input 1

6 4 3

Sample Output 1

1

We will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.

Sample Input 2

8 3 9

Sample Output 2

4

Sample Input 3

12 3 7

Sample Output 3

0



Sample input:
6 4 3


Sample output:
1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = [int(v) for v in input().split(' ')]

print(max(c - a + b, 0))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

t = (b+c)-a

if t <= 0:
	t = 0

print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = input().split()
A,B,C = int(A),int(B),int(C)

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

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))

ans = abc[2] - (abc[0] - abc[1])
if ans < 0:
    print(0)
else:
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    A,B,C= map(int, input().split())
    youki1_capa = A - B
    youki2_zan = C - youki1_capa
    if youki2_zan > 0:
        print(youki2_zan)
    else:
        print(0)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = 0

d = c - (a - b)

if d < 0:
    d = 0

print(d)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
ans = C - min(A - B, C)
print(ans)

Submission status: Accepted

Solution code:
a,b,c = input().split()
a=int(a)
b=int(b)
c=int(c)

temp=c-(a-b)
if temp<0:
    temp=0


print(temp)

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
A = s[0]
B = s[1]
C = s[2]
cap = A - B
result = C - cap
if result < 0:
    result = 0
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

abc=input().split()
a,b,c=int(abc[0]),int(abc[1]),int(abc[2])
 
print(max(0,c-(a-b)))

Submission status: Accepted

Solution code:
a, b, c = (int(i) for i in input().split())
anser = a - b
ansera= c - anser
if ansera <=  0:
  print("0")
else:
  print(ansera)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C= map(int, input().split())
# N = int(input())
ans = C - (A - B)
if ans < 0:
  ans = 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
a = tmp[0]
b = tmp[1]
c = tmp[2]

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
answer = 0

for i in range(1,B+C):
    if A >= B + C:
        print(answer)
        exit()
    elif  A != B:
        B += 1
    elif A == B:
        answer = C - i+1
        print(answer)
        exit()

Submission status: Accepted

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

ans = a - b
ans = c - ans

print(max(ans,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#136
a, b, c = map(int, input().split())
print(max(0, c-(a-b)))

Submission status: Accepted

Solution code:
#coding:shift_jis
container = list(input().split(' '))
for i in range(len(container)):
    container[i] = int(container[i])
a = container[2] - (container[0] - container[1]) >= 0
b = container[2] - (container[0] - container[1])
if a:
    print(b)

else:
    print(0)

Submission status: Accepted

Solution code:
A,B,C = [int(i) for i in input().split(' ')]

1<=B<=A<=20
1<=C<=20

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def t(a, b, c):
    return c - (a - b) if (a - b) < c else 0


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(t(a, b, c))

Submission status: Accepted

Solution code:
num = [int(e) for e in input().split()]

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

I = B+C         #全部の水の量
L = C-(A-B)     #Cの残りの水の量

if I <= A:
    C = 0
    print(C)
else:
    print(L)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
x = a - b
if c - x > 0:
    print(c - x)
elif c - x <= 0:
    print(0)

Submission status: Accepted

Solution code:
numbers =input().rstrip().split(" ")
A =int(numbers[0])
B =int(numbers[1])
C =int(numbers[2])
rest =C-(A-B)
if rest<0:
  rest=0
print(rest)

Submission status: Accepted

Solution code:
def solve():
    a,b,c = map(int, input().split())
    return max(c-(a-b),0)

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
d = n[2] - (n[0] - n[1])
if d > 0:
  print(d)
else:
  print(0)

Submission status: Accepted

Solution code:
A,B,C = [int(x) for x in input().split()]
ans = max(C-(A-B),0)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0,C+B-A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = [int(x) for x in input().split()]
    print(max(0,c-(a-b)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().rsplit())
cap = a - b
use = min(c, cap)
print(c - use)

Submission status: Accepted

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

Submission status: Accepted

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

res = C-(A-B)

if res >= 0:
    print(res)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C =(int(x) for x in input().split())
if A -B >= C:
  print(0)
else:
  print(C-A+B)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

x = min(C,A-B)
answer = C-x
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=input().split()
a=int(A)
b=int(B)
c=int(C)
x=c-(a-b)
if x>0:
  print(x)
else:
  print(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
print(max(0,C-A+B))

Submission status: Accepted

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

print(D)

Submission status: Accepted

Solution code:
#1行に入力が複数の場合
a, b, c = map(int, input().split())
#容器1に入れることができる水の量
can_ad_a = a - b
#aに追加で注げる水の量は
#「aに入れることができる水の量」、「cに入っている水の量」のうち小さい値
#「aに入れた水の量」を「c」から引けば「cに残る水の量」
#min(value, value)で最小値を取得
print(c - min(can_ad_a, c))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

print(max(0, C-A+B))

Submission status: Accepted

Solution code:
abc = input().split()

ans = int(abc[2]) - (int(abc[0]) - int(abc[1]))
if ans < 0:
    ans = 0
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=a-b

if c-d<=0:
  print(0)
else:
  print(c-d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ret = c - (a - b)
if ret < 0:
  ret = 0

print(ret)

Submission status: Accepted

Solution code:
a , b , c = map(int , input().split())
d = b + c - a

if d < 0:
    d = 0

print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# C-(A-B)
a, b, c = map(int, input().split())
ans = c-a+b
if ans < 0:
    ans = 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))

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

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

Submission status: Accepted

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

Submission status: Accepted

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

D=A-B

E=C-D

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
D = A - B
result = C - D

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''A - Transfer
https://atcoder.jp/contests/abc136/tasks/abc136_a

>>> main(6, 4, 3)
1
>>> main(8, 3, 9)
4
>>> main(12, 3, 7)
0
'''


def main(a, b, c):
    print(max(c - (a - b), 0))


if __name__ == '__main__':
    a, b, c = map(int, input().split(' '))
    main(a, b, c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if B >= 1 and A >= B and A <= 20 and C >= 1 and C <= 20:
    capacity = A - B
    if capacity <= C:
        remaining = C - capacity
    else:
        remaining = 0
    print(remaining)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
A,B,C=map(int,input().split())
if C<=A-B:
  print(0)
else:
  print(C-(A-B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print(c - min(a - b, c))


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
left_capacity = a-b
left_in_c = c - left_capacity
if left_in_c <=0:
  left_in_c = 0
  
print(left_in_c)

Submission status: Accepted

Solution code:
def main():

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c =(int(x) for x in input().split())
if a-b >= c:
  print(0)
elif a-b < c:
  print(c-(a-b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]

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

Submission status: Accepted

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

ans = C - (A - B)

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

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
print(max([0, B+C-A]))

Submission status: Accepted

Solution code:
#coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
wc = input().split(" ")

A = int(wc[0])
B = int(wc[1])
C = int(wc[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0, c-a+b))

Submission status: Accepted

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

print(max(0, c - (a-b)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=input().split()

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

Submission status: Accepted

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

hairu = a - b
nokori = c - hairu

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
cap=a-b
use=min(a-b,c)
ans=c-use
print(ans)

Submission status: Accepted

Solution code:
lis = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split(" "))

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

Submission status: Accepted

Solution code:
print(max(0,eval('-'+input().replace(' ','+'))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
print(max(c - (a - b), 0))

Submission status: Accepted

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

print(0 if c < a-b else c-(a -b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABC = list(map(int, input().split()))
empty = ABC[0] - ABC[1]
margin = ABC[2] - empty
if margin < 0:
    print(0)
else:
    print(margin)

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split(" "))
d = c - (a - b)
if d < 0:
  d = 0
print(d)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, open(0).read().split())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

ans = B+C-A

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

Submission status: Accepted

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

if a-b < c:
  print(c-(a-b))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
s[0]=int(s[0])
s[1]=int(s[1])
s[2]=int(s[2])
a=0
if s[0]-s[1]>s[2]:
  print(0)
else:
  print(s[2]-s[0]+s[1])

Submission status: Accepted

Solution code:
def solve():
    A, B, C = list(map(int, input().split()))
    if A  < B + C: # 容器2の水が容器1に全て入り切らない場合
        C = C - (A - B)
    else:
        C = 0

    print(str(C))

solve()

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

Solution code:
def p_a():
    a, b, c = map(int, input().split())
    print(max(0, b + c - a))
    
p_a()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    able = A - B
    result = C - able
    if result >= 0:
        print(result)
    else:
        print(0)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
A,B,C = list(map(int,input().split()))
aki = A - B
if aki >= C:
  print(0)
else:
  print(C-aki)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=[int(i) for i in input().split()]
ans=n[2]-(n[0]-n[1])
if(ans<0):
  ans=0
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
A,B,C = map(int,input().split())
 
if C>(A-B):
    print(C-(A-B))
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = [int(i) for i in input().split()]
    ans = c - (a - b)
    if ans < 0:
        print(0)
    else:
        print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = [int(x) for x in input().split()]
d = c - (a - b)
print(d if d >= 0 else 0)

Submission status: Accepted

Solution code:
print(max(0,eval("-"+input().replace(" ",'+'))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
answer = C - (A - B)
if answer <= 0:
    answer = 0
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
cap, current, rem = input().split()
cap, current, rem = int(cap), int(current), int(rem)
 
while current < cap and rem > 0:
  current += 1
  rem -= 1
print(rem)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]

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

Submission status: Accepted

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

ans = c - (a - b)

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

Submission status: Accepted

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

print(max(0, c - (a - b)))

Submission status: Accepted

Solution code:
ABC=input()
ABC=ABC.split(" ")
A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])

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

Submission status: Accepted

Solution code:
A,B,C = list(map(int, input().split()))

#容器 1 には水を A ミリリットルまで入れることができ、水が Bミリリットル入っています。
#容器 2には水が Cミリリットル入っています。
#容器 2から容器 1に入るだけ水を移します。
#容器 2の中には何ミリリットルの水が残るでしょうか。

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c =map(int,input().split())
c = c - (a-b)
if (c < 0):
    c = 0

print(c)

Submission status: Accepted

Solution code:
# ABC136 A-Transfer
a,b,c = map(int,input().split())
print(c-(a-b) if c-(a-b) >= 0 else 0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())
if B >= 1 and A >= B and A <= 20 and C >= 1 and C <= 20:
    capacity = A - B
    if capacity <= C:
        remaining = C - capacity
    else:
        remaining = 0
    print(remaining)

Submission status: Accepted

Solution code:
MI = lambda : map(int,input().split())
a,b,c = MI()
print(c-min(a-b,c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
rest = a - b
ans = c - rest
if ans < 0:
  ans = 0
print(ans)

Submission status: Accepted

Solution code:
array = list(map(int, input().split()))

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

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

print(ans)

Submission status: Accepted

Solution code:
ABC = list(map(int, input().split()))

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

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