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

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    if a<=b+c:
        print(b+c-a)
    else:
        print(0)
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
a, b, c = [int(elem) for elem in 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())
K=(C-(A-B))
if(C<(A-B)):
    print("0")
else:
    print(K)

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

container1 = A - B
container2 = C - container1

print(container2 if container2 >= 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())

space = A - B

ans = C - space

ans = ans if ans >= 0 else 0

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	a,b,c = map(int,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 = 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 B+C-A>0:
    print(B+C-A)
else:
    print(0)

Submission status: Accepted

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

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

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())
print(max(0, c - a + b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]
ans = C - (A - B)
ans = ans if ans > 0 else 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(c - min(tmp, c))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

a,b,c = [int(x) for x in stdin.readline().rstrip().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 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

print(max(c - d,0))

Submission status: Accepted

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

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

ans = c - (a-b)

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
  
A = num[0]
B = num[1]
C = num[2]
ans = 0

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+b-a,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())
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()))
ans = C - (A - B)
if ans >= 0 :
	print(ans)
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())

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

else:
    print(c - a + b)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
p,q,r=map(int,input().split())
print(max(r-(p-q),0))

Submission status: Accepted

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

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

Submission status: Accepted

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

if c-a+b < 0:
    ans = 0
else:
    ans = c-a+b

print(ans)

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

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
if A<=B+C:
    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().rstrip().split())

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

a = abc[0]
b = abc[1]
c = abc[2]

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

Submission status: Accepted

Solution code:
a, b, c = list(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())

res = C - A + B
if res < 0:
    res = 0

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

if c-a+b >= 0:
    print(c-a+b)
    exit()
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:
# Transfer
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((b + c) - a)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

c_left = C - (A - B)

ans =  c_left if c_left >= 0 else 0
print(ans)

Submission status: Accepted

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

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

nokori = C - (A-B)

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

Submission status: Accepted

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

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

print(str(c))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC-136-A
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=map(int,input().split())
d=a-b
print(max(c-d,0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().split(' ')
A = int(N[0])
B = int(N[1])
C = int(N[2])
x = A -B
result = C - x
if result < 0:
    print(int('0'))
else:
    print(result)

Submission status: Accepted

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

Submission status: Accepted

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

aki = A-B
if(C>aki):
    print(C-aki)
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:
def solve():

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

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

solve()

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#N, A, B = map(int, input().split())
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(max(0, c - (a-b)))

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
a=l[0]
b=l[1]
c=l[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:
  print(0)
else:
  print(c+b-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 = [int(i) for i in input().split()]
acap = A - B
remain = C - acap
if remain < 0:
  print('0')
else:
  print(remain)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
def main():

    i = list(map(int, input().split()))
    a = i[0]
    b = i[1]
    c = i[2]

    if  not (1 <= b and b <= a and a <= 20 and 1 <= c and c <= 20):      
        return

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

    print(k)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b, c = map(int, input().split())
    print(c-min(a-b, c))
 
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b, c = map(int, input().split())
    print(c-min(a-b, c))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#Transfer
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 = map(int,input().split())
left = c - (a-b)

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

Submission status: Accepted

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

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

x = c - (a - b)

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

Submission status: Accepted

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

x = a - b
y = c - x

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

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

Submission status: Accepted

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

d = min((A - B), C)
result = C - d

print(result)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8 
 
a, b, c = map(int, raw_input().split())
if b + c <= a:
    print 0
else:
    print b + c - a

Submission status: Accepted

Solution code:
# coding: utf-8 

a, b, c = map(int, raw_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())
X = C - (A - B)
if X >= 0:
    print(X)
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())

remain = C - (A - B)

print(remain) if remain > 0 else print(0)

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 (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(0)
else:
  print(ans)

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


#容器1に残りどの位の容量があるか。
D = C-(A-B)

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

Submission status: Accepted

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

# print(a,b, c)

ans = 0

ans = max(c - (a - b), 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())
print(C-A+B if C-A+B>=0 else '0')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019-11-16 10:55:08(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    a, b, c = [int(x) for x in sys.stdin.readline().split()]
    if a - b >= c:
        ans = 0
    else:
        ans = c - (a - b)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

a = abc[0]
b = abc[1]
c = abc[2]

ans = c - (a-b)

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

Submission status: Accepted

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

print(max(n[2]-(n[0]-n[1]), 0))

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
if A[2]-(A[0]-A[1])>=0:
    print(A[2]-(A[0]-A[1]))
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())
print(max(0,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())

res = c - (a - b)

print(res if res >= 0 else 0)

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

[A,B,C] = inpl()
print(max(B+C-A,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:
#%%
import sys
def input():
    return sys.stdin.readline().rstrip()

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

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

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

# %%
# from atcoder_test import doTest
# doTest("abc136","a",main)

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

Submission status: Accepted

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

mL = C - A + B 

if mL <= 0:
    print('0')
else:
    print(mL)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(A, B, C):
    """Test Case
    >>> print_ans(6, 4, 3)
    1
    >>> print_ans(8, 3, 9)
    4
    >>> print_ans(12, 3, 7)
    0
    """
    print(max(0,C - A + B))

if __name__ == '__main__':
    A, B, C = map(int,input().rstrip().split())
    print_ans(A, B, C)

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = data[2]-(data[0]-data[1])

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
import math
import heapq
from collections import Counter

#N,K=map(int, input[].split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
#x=list(map(int, input[].split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき

A,B,C=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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):
    print(ans)
else:
    print(0)

Submission status: Accepted

Solution code:
# ABC 136: A – Transfer
a, b, c = [int(s) for s in input().split()]
print(c - (a - b) if c > a - b else 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()))
if a-b<c:
    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(0)
else:
   print(D)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!


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

Submission status: Accepted

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

Submission status: Accepted

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