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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

a -= b

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
#A
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=b+c-a
if d < 0:
  d = 0
print(d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=map(int, input().split())
R=A-B
print((C-R)*(C>R))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    a, b, c = LI()
    d = max(0, c - (a - b))
    print(d)


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import *

a, b, c = map(int, stdin.readline().split())
ans = c - (a - b)
print(max(0, ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri May 15 00:48:45 2020

@author: Kanaru Sato
"""

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

Submission status: Accepted

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

Submission status: Accepted

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


print(max(c - (a-b), 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())
print(max((c-(a-b)),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:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())
  
a,b,c=i2()
if a>=b+c:
	print(0)
elif a<b+c and a>=b:
	print(c-a+b)
elif a<b:
	print(c)

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
import math
import bisect

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

Submission status: Accepted

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

def main():
    a,b,c=L()
    c=c-(a-b) if c>=a-b else 0
    print(c)

if __name__=='__main__':
    main()

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

A,B,C = inputIL()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
#  = int(input())
a, b, c  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

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

Submission status: Accepted

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

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

l = A - B

ans = C - l

if ans <= 0:
    ans = 0

print(ans)

Submission status: Accepted

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
from collections import deque


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
	
def count_str(m):
	tmp={}
	for i in range(10):
		if i in tmp:
			tmp[i]=1
		else:
			tmp[i]+=1
	return tmp

def is_prime(n):
	if n==1: return True

	for i in range(2,int(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True

a,b,c=input2()

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

Submission status: Accepted

Solution code:
def main():
    t = list(map(int, input().split()))
    ans = t[1] + t[2] - t[0]
    print(ans) if ans >= 0 else print(0)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC136A

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 = int(input())
# B = int(input())
# C = int(input())
# b = input()
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:
    print(0)
else:
    print(ans)

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

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

if __name__ == '__main__':

    ABC_136_A()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

    return


if __name__ == '__main__':
    main()
    sys.exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


solve()

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

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

Submission status: Accepted

Solution code:
# A - Transfer

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code

def resolve():
    a,b,c=pin()
    t=(c-(a-b))
    if t<0:t=0
    print(t)
#%%submit!
resolve()

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

Submission status: Accepted

Solution code:
import sys, heapq

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


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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
A,B,C = (int(x) for x in input().split())
C_residue =C-(A-B)
if 0 <=C_residue:
    print(C_residue)
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/env python3
# N = int(input())
# S = input()
A, B, C = map(int, input().split())
# A = list(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())
v = A-B
if C-v >= 0:
  print(C-v)
else:
  print(0)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    A, B, C = map(int, open(0).read().split())
    if C - (A - B) >= 0:
        print(C - (A - B))
    else:
        print(0)


main()

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

else:
    print(c+b-a)

Submission status: Accepted

Solution code:
a=-eval(input().replace(' ','-'));print((a>0)*a or 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())
d = a-b
e = c-d
if e>0:
    print(e)
else:
    print("0")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())

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

Submission status: Accepted

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

main()

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

amari = a - b

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
# map(int, input().split())
# int(input())
# input().split()
# mojiretu = ','.join(str_list)
# sorted(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Transfer

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    if B + C <= A:
        print(0)
    else:
        print((B+C)-A)
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:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = c - (a - b)
if d < 0:
  d = 0
print(d)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

mi = lambda: map(int, input().split())

a, b, c = mi()

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

Submission status: Accepted

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

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

Submission status: Accepted

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