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())
print(max(C-(A-B), 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) ) <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(0)
else:
    print(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:
#--Transfer

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(C-(A-B) if (A-B) < C 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:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
print(max(0,c-(a-b)))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
bottle1, water, bottle2 = map(int, input().split())
empty = bottle1 - water
if empty <= bottle2:
  print(bottle2 - empty)
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 = list(map(int,input().split()))
if C-(A-B) > 0:
    print(C-(A-B))
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

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


# def main():

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())
    residual = a - b
    res = c - residual
    if res < 0: print(0)
    else: print(res)
if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

diff = A - B
C = C - diff
if C < 0:
    C = 0

print(C)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(max(a[2]-(a[0]-a[1]),0))

Submission status: Accepted

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

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

X = C-(A-B)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    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())
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()))
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())

t = C - (A - B)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

tmp = a-b

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

Submission status: Accepted

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

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

Submission status: Accepted

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

b = a[2] + a[1] - a[0]

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

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

Submission status: Accepted

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

eq= b+c
eq2= a-b
eq3= c-eq2

if eq < a:
	print('0')
else :
	print(eq3)

Submission status: Accepted

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

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

ans=(C-(A-B))

ans=max(0,ans)
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())
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 = list(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)
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-(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(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())

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

Submission status: Accepted

Solution code:

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

out = C - (A-B)

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

Submission status: Accepted

Solution code:

import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

out = C - (A-B)

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

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

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

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 = list(map(int,input().split()))
if A[2] > A[0]-A[1]:
    print(A[2] - (A[0]-A[1]))
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:
def q1():
    A, B, C = (int(i) for i in input().split())
    ans = C-(A-B)
    if ans < 0:
        ans = 0
    print(ans)

    
if __name__ == '__main__':
    q1()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

rest = A - B
remain = max(0, C - rest)

print(remain)

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 = [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())
print(c - min(c, a - b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

a_ = a - b

transfer = min(a_, c)

print(c - transfer)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    print(max(0, C - A + B))

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

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

print(max(B+C-A, 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 a>(b+c):
    print(0)
else:
    print(b+c-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())
print(0 if c-(a-b)<0 else 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(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:
# ABC 136: A – Transfer
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())
print(max(0,B + C - A))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, c = map(int, readline().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)
  
else:
  print(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= input().split()
x,y,z=(int(a),int(b),int(c))
if x-y >= z:
    print(0)
else:
    ans = z-(x-y)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

(A, B, C) = [int(n) for n in input().split()]

print(max(C - (A - B), 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:
#!/usr/bin/env python3
A,B,C = [int(s) for s in input().split()]

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

a, b, c = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  a,b,c = map(int,input().split())
  print(c - (a - b) if c-(a-b)>=0 else 0)
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

print(x)

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()))
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:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    sum = a[2] - (a[0] - a[1])
    
    if sum < 0:
        sum =0

    print(sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# デバッグ用
GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)

#本体ここから

#S = input()
#N = int(input())
#S, T = input().split()
A, B, C = map(int, input().split())
#W = [input() for _ in range(N)]
#A = list(map(int, input().split()))

#GBN_DEBUG = True

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

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

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

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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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


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


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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import math
import os
import random
import re
import sys

if __name__ == '__main__':
    a, b, c = list(map(int, input().rstrip().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)>0:
  print(C-(A-B))
else:
  print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
cap = A - B
print(max(0, C-cap))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

remain = c - a + b

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

Submission status: Accepted

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

tmp = a-b

if c - tmp < 0:
    print(0)
else:
    print(c-tmp)

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
a,b,c  = map(int,input().split())

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

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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