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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
#ARC65C
import copy
import sys
#import math

tmp = input().split()
hoge = list(map(lambda a: int(a), tmp))
#print(hoge)
a=hoge[0]
b=hoge[1]
c=hoge[2]

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

Submission status: Accepted

Solution code:
A, B, C= list(map(int, input().split()))
rest = C-(A-B)
if rest >= 0:    
    print('{}'.format(rest))
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:
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()[:3])

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

d = a - b

result = c - d


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

result = B + C - A

if result < 0:
  result = 0

print(result)

Submission status: Accepted

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

one = a - b

ans = c - one

if c - one <= 0:
  print("0")
  exit()
print(c-one)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

nokori = a-b

ans = c - nokori
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:
  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:
import numpy as np

def main():
    a,b,c = input().split(' ')
    a = int(a)
    b = int(b)
    c = int(c)

    onemax = a
    one = b
    two = c

    yoryoku = onemax - one

    if c > yoryoku:
        print(c - yoryoku)
    else:
        print(0)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split(" ")]
b = max(a[2]-(a[0]-a[1]), 0)
print(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 - a + c) >= 0:
    print(b-a+c)
else:
    print(0)

Submission status: Accepted

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

answer = num_list[2] - (num_list[0] - num_list[1])

if answer < 0:
  answer = 0

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
result = max(c - (a - b), 0)
print("{}".format(result))

Submission status: Accepted

Solution code:
s = input().split(" ")
a = int(s[0])
b = int(s[1])
c = int(s[2])

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

# main
print(LeftC())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
decimal.getcontext().prec = 100
def sum1(pre,l,r):
    l=max(l,0)
    if(l==0):
        return pre[r]
    return pre[r] - pre[l - 1]

# n=int(raw_input())
a,b,c=map(int,raw_input().split())
if(b+c<=a):
    print 0
    exit()
print c-(a-b)
# t=1
# while(t!=0):
#     t=t-1

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def LIST(): return list(map(int, input().split()))


def main():
    A, B, C = LIST()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
emp = A - B
ans = C - emp
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:
    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())

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

Submission status: Accepted

Solution code:
[A, B, C] = [int(i) for i in 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())

sum = B+C-A

if sum < 0:
  sum = 0

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

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, raw_input().strip().split())
x = c - (a - b)

print max(0, x)

Submission status: Accepted

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

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

def fun(A,B,C):
    if C >= A - B:
        return C-(A - B)
    else:
        return 0

print(fun(A,B,C))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
max_1, water_1, water_2 = map(int, input().split(' '))

transfer = min(water_2, max_1 - water_1)
print(water_2 - transfer)
exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
kotae = c - (a - b)
if kotae > 0:
  print(kotae)
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 c-(a-b) < 0:
    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:
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:
    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:
A,B,C = map(int,input().split())
s = A - B
test = C - s
if test <=  0:
    test = 0
print(test)

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(i) for i in input().split()]
if c-(a-b)<0:
    print(0)
else:
    print(c-(a-b))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    A = list(map(int,input().split()))
    B = A[1]
    C = A[2]
    A = A[0]
    nokori = C - (A-B)
    if nokori < 0:
        print(0)
    else:
        print(nokori)

Submission status: Accepted

Solution code:

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

aki = A - B

minus = min(aki, C)



ans = C - minus

print(int(ans))

Submission status: Accepted

Solution code:
import math
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 b+c<=a:
    print("0")
else:
     print(c-a+b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=[int(i)for i in 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)
print(ans) if ans >= 0 else print(0)

Submission status: Accepted

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

r = A - B

if (r >= C):
    print(0)
else:
    print(C - r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("{}".format(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:
#!/usr/bin/env python3


def solv(A, B, C):
    return max(C - (A - B), 0)


if __name__ == '__main__':

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

    ans = solv(A, B, C)

    print(ans)

Submission status: Accepted

Solution code:
def int_multiple():
    return  [int(c) for c in input().split()]

def int_single():
    return int(input())

def str_multiple():
    return [c for c in input().split()]

def str_single():
    return input()

# start
a, b, c = int_multiple()

rest = c-(a-b)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!venv/bin/python
#from collections import defaultdict 
from itertools import combinations
from collections import defaultdict
from pprint import pprint
import math
import datetime
import sys
import fcntl
import time

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

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:
# -*- coding: utf-8 -*-
# abc136/abc136_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, B, C = i2nn()
    r = C - (A - B)
    if r < 0:
        r = 0
    print(r)
    return

main()

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
    print(max(C - (A - B), 0))


if __name__ == "__main__":
    main()

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 = (int(_) for _ 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(" "))

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

print(d)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

tmp = A-B
result = C - tmp

if result <= 0:
    result = 0

print(result)

Submission status: Accepted

Solution code:
import numpy as np

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




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def main():
    input = sys.stdin.readline
    ABC = list(map(int, input().split()))
    A = ABC[0]
    B = ABC[1]
    C = ABC[2]
    
    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 A - B >= C:
  print(0)
else:
  print(C - (A - B))

Submission status: Accepted

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

A -= B
C -= A

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

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

Submission status: Accepted

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

    print(remain)


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    input_str = input()
    splited = input_str.split(' ')
    A = int(splited[0])
    B = int(splited[1])
    C = int(splited[2])

    nokori = C - (A - B)
    if nokori >= 0:
        print(nokori)
    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())
if a-b <= c:
	print(str(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:
IN = [int(_) for _ in input().split()]
A = IN[0]
B = IN[1]
C = IN[2]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())
ret = C-(A-B)
print(ret if ret > 0 else 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:
if __name__ == '__main__':
    a, b, c = tuple([int(e) for e in input().split()])

    d = a - b
    r = max(0, c - d)

    print(r)

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 = [int(elem) for elem in input().split()]
a = min(A, B + C)
poured = a - B
print(C - poured)

Submission status: Accepted

Solution code:
A,B,C = list(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())

sa = A - B

if sa == 0:
    print(C)
elif C < sa:
    print(0)
else:
    print(C-sa)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

ans = int(0)

ans = C - (A - B)

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

Submission status: Accepted

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

tmp = a - b

ans = c - tmp

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

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

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


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

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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

tmp = c - (a - b)

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

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

Submission status: Accepted

Solution code:
A,B,C=list(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())
r = c-(a-b)
if r<0:
    print(0)
else:
    print(r)

Submission status: Accepted

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

Submission status: Accepted

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


M = ABC[0] - ABC[1]

SA = ABC[2] - M

if SA < 0:
    print("0")
else:
    print(SA)

Submission status: Accepted

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

capa = A - B

calc = C - capa

if calc < 0:
    print('0')
else:
    print(calc)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    limit, cur, inc = [int(s) for s in sys.stdin.readline().strip().split()]

    diff = limit - cur
    print(max(inc - diff, 0))


main()

Submission status: Accepted

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