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 -*-
"""
A - Transfer
https://atcoder.jp/contests/abc136/tasks/abc136_a

"""
import sys


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


def main(args):
    A, B, C = map(int, input().split())
    ans = solve(A, B, C)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result = C - (A - B)

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

Submission status: Accepted

Solution code:
def solve():
    N, M, L = map(int, input().split())
    if N >= M+L:
        return 0
    return -(N-M-L)

print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import sys


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

Submission status: Accepted

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

s = c-(a-b)

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

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:
x=list(map(int, input().split()))
if x[1]+x[2]<x[0]:
	print(0)
else:
	print(x[1]+x[2]-x[0])

Submission status: Accepted

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

Submission status: Accepted

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

if A-B-C>=0:
  print('0')
else:
  print(-1*(A-B-C))

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement, groupby
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

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

Submission status: Accepted

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

ans = C - (A - B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    a, b, c = list(map(int,ipti().split()))
    ans = max(0, c - (a - b))
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if (A-B) < C :
    print(C+B-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:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

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:
number = input().split(" ")
A = int(number[0])
B = int(number[1])
C = int(number[2])
if A < B + C:
	print((B + C) - A)
else:
	print(0)

Submission status: Accepted

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

d = c - (a - b)

if d > 0:
    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((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:
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())

temp1 = A-B
temp2 = C - temp1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == '__main__':
    ans = main()
    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(max(0, c+b-a))

Submission status: Accepted

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

if (A-B) < C:
    i = abs((A-B)-C)

else:
    i =0

print(i)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if c >= 0:
    print(c)
else:
    print('0')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc136/tasks/abc136_a

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

Submission status: Accepted

Solution code:
import sys, 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
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B ,C = MAP()

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = input().split(" ")
n = int(a) - int(b)
x = int(c) - n


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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if b + c > a:
    print(b+c - a)
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 = (int(abc) for abc in 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 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())
box=a-b
c-=box
ans=max(c,0)
print(ans)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
box=a-b
ans=min(box,c)
print(c-ans if ans-c<=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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

Submission status: Accepted

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

Submission status: Accepted

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

X1 = B
X2 = C

move = min(A - B, C)

X1 += move
X2 -= move

print(X2)

Submission status: Accepted

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

Submission status: Accepted

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

ans = C - (A-B)

if ans > C:
    ans = C
elif ans < 0:
    ans = 0

print(ans)

Submission status: Accepted

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

limit = A - B
res = C - min(limit, C)

print(res)

Submission status: Accepted

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

limit = A - B
res = C - limit

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if 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-A+B)

Submission status: Accepted

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

d = a - b
c = c - (a - b)

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(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:
x = input().split()
A, B, C = [int(i) for i in x]
r = C-(A-B)
if r > 0:
  print(r)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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 = 0
if A-B >= C:
    print(ans)
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=map(int, input().split())
emp=a-b
if emp<c:
  print(c-emp)
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:
abc = list(map(int, input().split()))
a, b, c = abc[0], abc[1], abc[2]
result = c - (a - b)
if result >= 0:
    print(result)
else:
    print(0)

Submission status: Accepted

Solution code:
#136 a
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 = [int(i) for i in input().rstrip().split(' ')]
r = C-A+B
if r < 0:
    r = 0
print(r)

Submission status: Accepted

Solution code:
import sys
row = sys.stdin.readline
def read_ints(row):
    return list(map(int, row().split()))
  
A,B,C = read_ints(row)
print(max(0, 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 c-(a-b)>0:
    print(c-(a-b))
else:
    print(0)

Submission status: Accepted

Solution code:
# import itertools
# import math


def solve(A, B, C):
    ans = A - B - C
    if ans < 0:
        ans = abs(ans)
    else:
        ans = 0
    return ans


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

# P = []
# S = []
# for i in range(N):
#     pp, ss  = map(int, input().split())
#     P.append(pp)
#     S.append(ss)

print(solve(A, B, C))

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
numbers = input().split()
numA = int(numbers[0])
numB = int(numbers[1])
numC = int(numbers[2])
x = numB + numC - numA
if x > 0:
  print(x)
else:
  print(0)

Submission status: Accepted

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

space = A - B

print(max(0, C - space))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = A - B

if C <= x:
    res = 0
else:
    res = C - x

print(res)

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

    x = a - b - c

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

req = b + c

print((req - a) if req > a else 0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

cnt = c - a + b

if(cnt < 0):
  cnt = 0

print(cnt)

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

Submission status: Accepted

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

print(max(r, 0))

Submission status: Accepted

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

print(c - min(a-b, c))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

A,B,C=LI()

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

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:
x,y,z = map(int,input().split())
if y + z > x:
    print(z+y-x)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

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

remain1 = A - B

if C - remain1 < 0:
    print(0)
else:
    print(C-remain1)

Submission status: Accepted

Solution code:
waterA,waterB,waterC = map(int,input().split())
answer = waterB + waterC - waterA
if answer < 0:
    answer = 0

print(answer)

Submission status: Accepted

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

ans = max(0, C - (A - B))

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = c - a + b

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = C - (A - B)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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