Problem:


Score : 100 points

Problem Statement

We have two bottles for holding water.

Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.

Bottle 2 contains C milliliters of water.

We will transfer water from Bottle 2 to Bottle 1 as much as possible.

How much amount of water will remain in Bottle 2?

Constraints

All values in input are integers.

1 \leq B \leq A \leq 20

1 \leq C \leq 20

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the integer representing the amount of water, in milliliters, that will remain in Bottle 2.

Sample Input 1

6 4 3

Sample Output 1

1

We will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.

Sample Input 2

8 3 9

Sample Output 2

4

Sample Input 3

12 3 7

Sample Output 3

0



Sample input:
6 4 3


Sample output:
1

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

A,B,C= map(str,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(abs(min(a-b-c,0)))

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

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

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

print(ans)

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

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:
# -*- coding: utf-8 -*-
import numpy as np

def main():
    # # 整数の入力
    # a = int(input())
    # # スペース区切りの整数の入力
    # b, c = map(int, input().split())
    # # 文字列の入力
    # s = input()
    # # 出力
    # print("{} {}".format(a+b+c, s))
    A, B, C = map(int, input().split())
    print(max(C - (A-B), 0))


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
[capacity, offset, addition] = [int(num) for num in input().split()]

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

Submission status: Accepted

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

d=a-b

if c < d:
  e=0
else:
  e=c-d

print(e)

Submission status: Accepted

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

Submission status: Accepted

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

ans = C - (A - B)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
''' 
------------------------
author : iiou16
------------------------
'''

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def transfer(a,b,c):

    n = a - b
    m = c - n
    if (m < 0):
        m = 0

    print("%d" %m)

if __name__ == '__main__':
    a = list(map(int,input().split()))

    transfer(a[0],a[1],a[2])

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:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    remain = A - B
    result = max(0, C - remain)
    print(result)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split(" ")
    a = int(token[0])
    b = int(token[1])
    c = int(token[2])

    return (a, b, c)


def solve(a, b, c):


    

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


def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Submission status: Accepted

Solution code:
#input
a = list(map(int,input().split())) #input from array of integer like "1 2 3"

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

d = c - a + b

if d >= 0:
    print(d)

else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

val = A - B
answer = C - val

if answer < 0:
  answer = 0

print(answer)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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, math
from collections import deque

readline = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
import sys


A, B, C = [int(v) for v in sys.stdin.readline().split()]
r = A - B
c = max(C - r, 0)

print(c)

Submission status: Accepted

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

out = c-(a-b)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
    print( max( C - ( A - B ), 0 ) )

Submission status: Accepted

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

ans = 0

if a < b+c:
  ans = c-(a-b)

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n1, n2, n3 = [int(i) for i in input().split()]

r1 = n3 -(n1 - n2)

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

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

Submission status: Accepted

Solution code:
import sys

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

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

    print(ans)


if __name__ == '__main__' :
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split()) # 複数の数字を変数に格納

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

Submission status: Accepted

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


rest = (a - b)

print(max(c - rest, 0))

Submission status: Accepted

Solution code:
#coding : utf-8

import os
import sys

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


#print(A)
#print(B)
#print(C)


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

Submission status: Accepted

Solution code:
#A
A, B, C = map(int, input().split())
D=A-B #容器Ａの残り容量
E =min(C,D)
ans =C-E
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(e) for e in 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a, b, c = [int(i) for i in sys.stdin.readline().split()]
r = c - (a - b)
if r <= 0:
    print(0)
else:
    print(r)

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:
import sys
input = sys.stdin.readline

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




if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# チートシート
a, b, c = map(int, input().split())
tmp = a-b
if c-tmp < 0:
    print(0)
else:
    print(c-tmp)

Submission status: Accepted

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

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

Submission status: Accepted

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

dif = c-a+b


if dif >= 0:
  print(dif)
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())

x = A - B

print(max(C - x, 0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    a,b,c = map(int, sys.stdin.readline().split())
    if a >= b+c:
        print(0)
    else:
        print(c-(a-b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = (int(i) for i in 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())

result = c - (a - b)

if result < 0:
  print(0)

else:
  print(result)

Submission status: Accepted

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

noko=a-b

an=c-noko

if an<0:
    print(0)
if an>=0:
    print(an)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

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

x = C - (A - B)

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

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())
print(max(0,(B+C-A)))

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:
# an = list(map(int, input().split()))
# n, m = map(int, input().split())
# n = int(input())
a, b, c = map(int, input().split())
print(max(0, c - (a - b)))

Submission status: Accepted

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

x = c - (a - b)
if x < 0:
    x = 0

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,heapq,math,resource
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

def setrlim():
  sys.setrecursionlimit(250000)
  soft,hard = resource.getrlimit(RLIMIT_STACK)
  # setrlimit works on ubuntu (and atcoder), but not on WSL
  #resource.setrlimit(RLIMIT_STACK, (128*1024*1024,hard))

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

hoge = A-B
C -= hoge

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

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(a, b, c):
    ans = c - (a - b)
    if ans < 0:
        return 0
    return ans


if __name__ == '__main__':
    i = list(map(int, input().split()))
    a, b, c = i[0], i[1], i[2]
    print(main(a, b, c))

Submission status: Accepted

Solution code:

a, b, c  = [int(x) for x in 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())
tmp = c-(a-b)
if tmp >0 :
	print("%d" % tmp)
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(c-(a-b),0))

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
a, b, c = map(int, input().split())
ans = max(c - (a - b), 0)
print(ans)

Submission status: Accepted

Solution code:
import sys
import collections
import copy
input = sys.stdin.readline
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:
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())  # 入力


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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意


#k = int(input())
a,b,c = [int(i) for i in readline().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 - min(A-B, C))

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e9)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B,C = IL()
tmp = A-B

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache

# 1整数
# n = int(input())

# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools import lru_cache

input = sys.stdin.readline

# N個整数
a, b, c = list(map(int, input().split()))

# 1整数
# n = int(input())

# 空白区切りリスト整数
# b = list(map(int, input().split()))

# 空白区切り文字列
# t, d = input().split()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
L1, now1, now2 = map(int, input().split())

if L1-now1 > now2: print("0")
else: print(now2 - (L1-now1))

Submission status: Accepted

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

Submission status: Accepted

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

n = c-(a-b)

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

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 - min(A - B, C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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 = (int (i) for i in 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())
s=c-(a-b)
if(s<=0):
    s=0
print(s)