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:
def main():
    a, b, c = [int(x) for x in input().split()]
    ans = c - (a -b)
    print(ans if ans > 0 else 0)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
s = input().rstrip().split(' ')
x = int(s[2])+int(s[1])-int(s[0])
if x > 0:
  print(x)
else:
  print("0")

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

# A=max, B=current, C=2のcurrent
#容器2に残る量を出力する

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
abc = [int(i) for i in input().split()]
d =  abc[2] - (abc[0] - abc[1]) 
print(d if d > 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())
tmp = C - A + B
if tmp > 0 or tmp == 0:
    print(tmp)
elif tmp < 0:
    print(0)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
https://atcoder.jp/contests/abc136/tasks/abc136_a
"""

import numpy as np


def calc(A: int, B: int, C: int) -> int:
    irerareru = clamp(A - B, 0, C)
    return C - irerareru


def clamp(value: int, min_: int, max_: int) -> int:
    return min(max_, max(min_, value))


def load_input_as_int_array() -> np.ndarray:
    return np.array([int(v) for v in input().split(" ")])


def main() -> None:
    A, B, C = load_input_as_int_array()
    result = calc(A, B, C)
    print(result)


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import defaultdict, deque
import math
from math import factorial
import fractions
import re

BIGNUM = 10 ** 9 + 7

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

    remain = A - B
    result = max([0, C - remain])

    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

gap = A - B
if C > gap:
    print(C-gap)
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())
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())
R = c - (a - b)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
values = input().split(' ')
answer = int(values[2]) - (int(values[0]) - int(values[1]))
if(answer < 0):
  print('0')
else:
  print(str(answer))

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

A = list(map(int,input().split()))
remain = 0

if A[2] - (A[0] - A[1]) <= 0:
	print(remain)
else:
	remain = A[2] - (A[0] - A[1])
	print(remain)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    A, B, C = list(map(int, input().split()))
    print(main(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())

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n=input().split(" ")
for i in range(3):
  n[i]=int(n[i])
ans=(n[2]-(n[0]-n[1]))
if ans < 0:
	print(0)
else:
     print(ans)

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

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

Submission status: Accepted

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

d = a - b
ans = max(0, c- d)
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:
abc = list(map(int, input().split(' ')))
a = abc[0]
b = abc[1]
c = abc[2]
r = max(0, c - (a - b))
print(r)

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

sum = 0

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
max, first , second = list(map(int, input().split()))

if max >= first + second:
    print(0)
else:
    print(first + second - max)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき


res = c[2]-(c[0]-c[1])

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
_ = -a+b+c
print(_ if _ >= 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:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
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
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)
if d<0:
  d=0
print(d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
  a, b, c = map(int, input().split())
  c = c - (a - b) if c >= a - b else 0
  print('{}'.format(c))


if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

sub = a - b
result = 0
if sub < c:
    result = c - sub

print(result)

Submission status: Accepted

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

x = a
y = c

space = a - b
if(space == c):
    y = 0

if(space > c):
    y = 0

if(space < c):
    y = c - space

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

sub = a-b

if sub >= c:
    result = 0
elif sub < c:
    result = c - sub
    
print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

total = c-a+b

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# Transfer
A = list(map(int, input().split()))

b = A[0] - A[1]  # bの残
c = A[2] - b
if c >= 0:
    pass
else:
    c = 0

print(c)

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:
import sys

input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
a = input().split( )
num = int(a[2]) - (int(a[0]) - int(a[1]))

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

Submission status: Accepted

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

Submission status: Accepted

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

x = a - b
z = c - x

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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_max,a_in,b_in = map(int,(input().split()))
a = a_max - a_in
ans = b_in - a
if ans < 0:
  ans = 0
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

a, b, c = map(int, open(0).read().split()) 

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
emp = lst[0] - lst[1]
ans = lst[2] - emp
if ans < 0:
  ans = 0
  

print(ans)

Submission status: Accepted

Solution code:
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

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

Submission status: Accepted

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

j = i[2] - (i[0] - i[1])
if j < 0:
  j = 0

print(j)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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:
# -*- coding: utf-8 -*-

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

# solve & output
print(C - (A - B) if (A - B) < C else 0)

Submission status: Accepted

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

print(re)

Submission status: Accepted

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

if n2 >= 0:
    print(n2)
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:
import sys

a,b,c= [ int(x) for x in sys.stdin.readline().split() ]
r= a-b
print( max(c-r,0) )

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:
import numpy as np

I=input()
L=np.array(I.split(),dtype=np.int32)

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

diff=A-B


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

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

Submission status: Accepted

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

out = C - (A -B)

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

Submission status: Accepted

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

Submission status: Accepted

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

one = a - b

if one > c :
    ret = 0
else:
    ret = c - one

print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


A, B, C = inpl()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

one = a - b
two = c

if two-one < 0:
    ans = 0
else:
    ans = two-one
print(ans)

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

Submission status: Accepted

Solution code:
S = input()

S = list(map(int, S.split()))

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

D = C-(A-B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

input = input().split()

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

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

Submission status: Accepted

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

if c >= can_charge:
    print(c - can_charge)
if c < can_charge:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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


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

Submission status: Accepted

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

ans = 0

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

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

answer = i[2] + i[1] - i[0]
answer = max(answer, 0)
print(answer)

Submission status: Accepted

Solution code:

l = list(map(int,input().split()))
diff = l[0] - l[1]
if diff == 0:
        print(l[2])
else:
        res = l[2] - diff
        print(max(0,res))

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

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

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

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
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 > 0:
    a = a - b
else:
    a = a - a

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if 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:
# -*- coding: utf-8 -*-
def main():
    A,B,C = map(int,input().split())
    D = C-(A-B)
    if D < 0:
        print(0)
        return
    print(D)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

def solve(a, b, c):
    ans = c - (a - b)
    return ans if ans >= 0 else 0


if __name__ == '__main__':
    a, b, c = map(int, sys.stdin.readline().strip().split(" "))
    print solve(a, b, c)

Submission status: Accepted

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

# 容器1の残り空き容量
remaining = A - B

if C > remaining:
    print(C - remaining)
else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc136/tasks/abc136_a
a,b,c = map(int,input().split())

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
def input(): return sys.stdin.readline().strip()
def gcd(x, y): return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y): return (x * y) // gcd(x, y)
MOD = 10 **9 + 7

# N = int(input())
# S = input()
A, B, C = map(int, input().split())
# 横
# L = [int(x) for x in input().split()]
# 縦
# A = [int(input()) for _ in range(N)]
# 多次元
# L = [[int(x) for x in input().split()] for _ in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

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

C = C - (A - B)

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

nokori = A-B
amari = C-nokori
if amari < 0:
    print(0)
    exit()  
print(C-nokori)

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

aki = a - b

nokori = c - aki

if nokori <= 0:
    nokori = 0

print(nokori)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


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


# In[ ]:


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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
A,B,C=map(int, input().split())

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