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 atc_136a(input_v: str) -> int:
    ABC = input_v.split(" ")
    A = int(ABC[0])
    B = int(ABC[1])
    C = int(ABC[2])

    D = C - (A - B)

    if D < 0:
        return 0
    else:
        return D

abc = input()
print(atc_136a(abc))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 数値を取得
max_c1,wat_c1,wat_c2 = map(int,input().split())

# 容器2の残量を出力
able_wat = max_c1 - wat_c1
remain_c2 = max(wat_c2 - able_wat,0)
print(remain_c2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Transfer


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

# A madehairu B haitteru Ciretai

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 136_a
A, B, C = map(int, input().split())
if (A >= B) & (1 <= A & A <= 20) & (1 <= B & B <= 20) & (1 <= C & C <= 20):
    case1_rest = A - B
    if case1_rest < C:
        case2 = C - case1_rest
    elif case1_rest >= C:
        case2 = 0
    print(case2)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 1.値を正しく取得
a, b, c = (int(x) for x in input().split())

# 2.正しく処理
mizu = b + c
amari = mizu-a

if amari <= 0 :
    print(0)

else :
    print(amari)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

result = C - (A - B)

if result < 0:
    result = 0

print(result)

Submission status: Accepted

Solution code:
water1_limit, water1, water2 = map(int, input().split())

in_water2 = water2 - (water1_limit - water1)
in_water2 = max(0, in_water2)
print(in_water2)

Submission status: Accepted

Solution code:
# 容器2に残る水の量を求める

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

# 問題：
#     水を入れる容器が 2つあります。
#     容器 1には水を A ミリリットルまで入れることができ、
#     水が B ミリリットル入っています。
#     容器 2 には水が C ミリリットル入っています。
#     容器 2 から容器 1 に入るだけ水を移します。
#     容器 2 の中には何ミリリットルの水が残るでしょうか。

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = a - b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
問題：
    水を入れる容器が 2つあります。
    容器 1には水を A ミリリットルまで入れることができ、
    水が B ミリリットル入っています。
    容器 2 には水が C ミリリットル入っています。
    容器 2 から容器 1 に入るだけ水を移します。
    容器 2 の中には何ミリリットルの水が残るでしょうか。
'''

'''
制約：
    入力は全て整数である。
    1 ≤ B ≤ A ≤ 20
    1 ≤ C ≤ 20
'''

# 標準入力から A, B, C の値を取得する
a, b, c = map(int, input().split())

# 容器2の水の量を計算して出力する
result = c - (a - b)

if result > 0:
    print(result)
else:
    print(0)    # 水は残ってないので、0 を出力する

Submission status: Accepted

Solution code:
quantity_a, filled_a, filled_b = map(int, input().split())

sum_a_b = filled_a + filled_b

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

Submission status: Accepted

Solution code:
import sys

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


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

    x = A - B

    print(max(0, C - x))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    t = min(A - B, C)
    ans = C - t

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

    ans = C - (A - B)

    print(max(ans, 0))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    a, b, c = Input()
    x = a - b
    use = min(c, x)
    ans = c -use
    print(ans)


main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())
ireru=a-b#cが入れる量
if (c-ireru<0):
    print(0)
else:
    print(c-ireru)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(0) if (a-b) >= c 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:
#! python3
#  solve_136A.py

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

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
s=x-y
if(s>z):
    print(0)
else:
    print(z-s)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ans = C - (A - B)

if ans < 0:
    ans = 0

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(s) for s in input().split()]
b = int(a[0] - a[1])
c = a[2] - b
if int(c) < 0:
  print("0")
else:
  print(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:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = c-(a-b)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    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())
print(0 if c + b <= a else c - (a - b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = input().split(" ")

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

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

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

    L = C - (A - B)

    if L <+ 0:
        ans = 0

    else:
        ans = L

    print(ans)


if __name__ == "__main__":
    main()

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 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
#a-bまで水を入れることができる
if a-b<=c:
  print(c-a+b)
else:
  print(0)

Submission status: Accepted

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

b += move
c -= move

print(c)

Submission status: Accepted

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

a = min(b + c, a)
c = b + c - a

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=C-(A-B)

if ans>=0:
    print(ans)
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:
# abc136_a.py
# https://atcoder.jp/contests/abc136/tasks/abc136_a

# A - Transfer /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 水を入れる容器が 2つあります。
# 容器 1には水を A ミリリットルまで入れることができ、水が Bミリリットル入っています。
# 容器 2には水が Cミリリットル入っています。
# 容器 2から容器 1に入るだけ水を移します。
# 容器 2の中には何ミリリットルの水が残るでしょうか。

# 制約
#     入力は全て整数である。
#     1≤B≤A≤20
#     1≤C≤20

# 入力
# 入力は以下の形式で標準入力から与えられる。
# A B C

# 出力
# ミリリットル単位で容器 2の中に残る水の量を整数で出力せよ。

# 入力例 1
# 6 4 3

# 出力例 1
# 1

# 容器 2から容器 1 に 2 ミリリットルの水を移すことになるので、容器 2 には 1ミリリットルの水が残ります。

# 入力例 2
# 8 3 9

# 出力例 2
# 4

# 入力例 3
# 12 3 7

# 出力例 3
# 0


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    A, B, C = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(M):
    #     valueses.append(list(map(int, lines[i+1].split())))

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

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['6 4 3']
        lines_export = [1]
    if pattern == 2:
        lines_input = ['8 3 9']
        lines_export = [4]
    if pattern == 3:
        lines_input = ['12 3 7']
        lines_export = [0]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

A,B,C = map(int,readline().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())
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(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())
d = a - b
print(max(0, c - d))

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
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
answer=0
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[2]+a[1]-a[0])
else:
    print('0')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().rstrip()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
A,B,C = map(int,input().split())
if not ( 1 <= B <= 20 and B <= A <= 20 ): sys.exit()
if not ( 1 <= C <= 20 ): sys.exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = c - (a - b)

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