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: Runtime Error

Solution code:
N = int(input())
def count(start, end):
  return end - start + 1
keta = 1
while True:
  if 10**keta > N:
    break
  else:
    keta += 1
num = 0
for k in range(1, keta+1):
  if k % 2 == 1:
    num += count(10**(k-1), min(N, 10**k-1))
print(num)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
if N > 1:
    for i in range(N-1):
        if A[i]>A[i+1]:
            A[i] -= 1
    for i in range(N-1):
        if A[i] > A[i+1]:
            print("No")
            break
    else:
        print("Yes")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
num = int(input())
row = [int(s) for s in input().split()]
row[0] -= 1
for i in range(num - 1):
  if row[i + 1] > row[i]:
    row[i + 1] -= 1

p = 0
for i in range(num - 1):
  if row[i] <= row[i + 1]:
    p += 1
    
if p == num - 1:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(raw_input())
if n < 10:
    print(n)
elif n >= 10 and n < 100:
    print(9)
elif n >=100 and n < 1000:
    print((n-100) + 10)
elif n >=1000 and n < 10000:
    print(909)
elif n >= 10000 and n < 100000:
    print((n-10000) + 910)
elif n == 100000:
    print(90909)

Submission status: Runtime Error

Solution code:

import numpy as np
from scipy import signal

N = int(input())
H = list(map(int, input().split(" ")))

H = np.array(H)

ans = 'Yes'
min_ind = signal.argrelmin(H)[0]
tmp_ind = 0
for ind in min_ind:
    
    if H[tmp_ind:ind].max() > H[ind]+1:
        ans = 'No'
        break
    tmp_ind = ind

if H[tmp_ind:-1].max() > H[-1]+1:
    ans = 'No'

print(ans)

Submission status: Runtime Error

Solution code:

import numpy as np
from scipy import signal

N = int(input())
H = list(map(int, input().split(" ")))

H = np.array(H)

ans = 'Yes'
min_ind = signal.argrelmin(H)[0]
tmp_ind = 0
for ind in min_ind:
    
    if H[tmp_ind:ind].max() > H[ind]+1:
        ans = 'No'
        break
    tmp_ind = ind

if H[tmp_ind:ind].max() > H[-1]+1:
    ans = 'No'

print(ans)

Submission status: Runtime Error

Solution code:
a = int(input())
c =0
for a in range(1,a+1):
  if ((len(str(a))% 2) == 1):
    c += 1 
print(c)

Submission status: Runtime Error

Solution code:
n = int(input())
if n == 1:
  print("Yes")
  exit()

h_list = [int(h) for h in input().split()]

for index in range(0,n-1):
  if h_list[index] > h_list[index+1]:
    h_list[index] = h_list[index]-1

for index in range(1, n):
  if h_list[index-1] > h_list[index]:
    print("No")
    exit()
print("Yes")

Submission status: Runtime Error

Solution code:
N = int(input())
def count(start, end_):
  return end_ - start + 1
keta = 1
while True:
  if 10**keta > N:
    break
  else:
    keta += 1  
num = 0
for k in range(1, keta+1):
  if k % 2 == 1:
    num += count(10**(k-1), min(N, 10**k-1))
print(num)

Submission status: Runtime Error

Solution code:
n = int(input())
h = list(map(int, input().split(" ")))
a = 'Yes'
m = 0
for i in range(1, len(h)):
    m = max(h[i], m)
    if h[i] < h[i-1] and m - h[i] > 1:
        a = 'No'
        break
print(a)

Submission status: Runtime Error

Solution code:
N = int(input())
li = list(map(int,input().split()))
li2 = []
key =[0] #key ０でおｋ　１で1下げ
cnt = 0
flg = True
if N == 1:
    ans ="Yes"
    flg = False
while flg :
    cur1 = li[cnt]
    cur2 = li[cnt+1]
    sa = cur2 - cur1
    if key[cnt] == 0:
        if sa < -1:
            ans = "No"
            flg = False
        elif sa == -1:
            key.append(1)
            cnt += 1
        else:
            key.append(0)
            cnt += 1
    else:
        if sa < 0:
            ans = "No"
            flg = False
        else:
            key.append(0)
            cnt += 1
    if cnt == len(li)-1:
        ans = "Yes"
        flg = False
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
def count(start, end):
  return end - start + 1
keta = 1
while True:
  if 10**keta > N:
    break
  else:
    keta += 1  
num = 0
for k in range(1, keta+1):
  if k % 2 == 1:
    num += count(10**(k-1), min(N, 10**k-1))
print(num)

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int, input().split()))
count = 0
if(N==1):
    print("Yes")
else:
    for i in range(N-1):
        if(H[i+1]-H[i]==-1):
            count +=1
            if(count==1):
                H[i]=H[i]-1
        elif(H[i]>H[i+1]):
            count +=1
    print(count)
    if(count<=1):
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
N = int(input())
def count(start, end):
	return end - start + 1
keta = 1
while True:
	if 10**keta > N:
    	break
	else:
    	keta += 1
num = 0
for k in range(1, keta+1):
	if k % 2 == 1:
		num += count(10**(k-1), min(N, 10**k-1))

print(num)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int, input().split()))
ans = "Yes"
for i in range(N - 1):
  if H[i] > H[i + 1]:
    H[i] = H[i] - 1
    if H[i] - 1 > H[i + 1]:
      ans = "No"
    else:
      H[i] = H[i] - 1

if sorted(H) != H:
  ans = "No"
print(ans)

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;
int main (){
  cin>>a>>b>>c;
  for (int i=1;i<=b;i++){
    b+=1;
    c-=1;
    if (b==c){
      break;
  }
  cout<<c<<endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
Bottle1 = int(input())
Bottle2 = int(input())
Bottle3 = int(input())
ans = (Bottle2+Bottle3)-(Bottle1)
if (ans<0):
    print(0)
else:
    print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())

def count(start, end):
  return end - start + 1

keta = 1
while True:
  if 10**keta > N:
    break
  else:
    keta += 1
      
num = 0
for k in range(1, keta+1):
  if k % 2 == 1:
    num += count(10**(k-1), min(N, 10**k-1))

print(num)

Submission status: Runtime Error

Solution code:

import sys
from collections import deque, defaultdict
import copy
import bisect
#input=sys.stdin.readline
#sys.setrecursionlimit(10 ** 9)
import math
import heapq

S = input()

RL = []
for i in range(len(S) - 1):
	if S[i] == 'R' and S[i + 1] == 'L':
		RL.append(i)
dist = [0]*len(S)
X = [0]*len(S)
for i in range(len(S)):
	if S[i] == 'R':
		loc = bisect.bisect_left(RL, i)
		dist[i] = RL[loc] - i
		X[i] = RL[loc]
	else:
		loc = bisect.bisect_left(RL, i)
		dist[i] = i - RL[loc - 1] - 1
		X[i] = RL[loc - 1] + 1

num = [0]*len(S)
for i in range(len(S)):
	if S[i] == 'R':
		num[X[i] + ((dist[i])%2)] += 1

	else:
		num[X[i] - ((dist[i])%2)] += 1


for i in range(len(S)):
	print(num[i], end='')
	print(" ", end ="")

Submission status: Runtime Error

Solution code:
N = int(input())

def count(start, end):
  return end - start + 1

keta = 1
while True:
  if 10**keta > N:
    break
  else:
  	keta += 1
      
num = 0
for k in range(1, keta+1):
  if k % 2 == 1:
    num += count(10**(k-1), min(N, 10**k-1))

print(num)

Submission status: Runtime Error

Solution code:
input_int = input().split()

if input_int[0] >= input_int[1] + input_int[2]:
    print('0')
else:
    print(input_int[2] - input_int[0] + input_int[1])

Submission status: Runtime Error

Solution code:
n = int(input())
h = [map(int, input().split())]
s = 1
for i in range(n):
  flag = 0
  for j in range(n-1-i):
    if h[j] <= h[n-1-i] + 1:
      flag += 0
    else:
      flag += 1
  if flag != 0:
    s *= 0
if s = 0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
def main():
    N = int(input())
    H = list(map(int, input().split()))

    judge = 'Yes'

    H[0] = H[0] - 1

    for i in range(1,N):
        if H[i-1] > H[i] :
            H[i-1] = H[i-1] - 1

    for i in range(1,N):
        if H[i-1] > H[i]:
            judge = 'No'
            
    print(judge)

if __name__ == '__main__' :
    main()

Submission status: Runtime Error

Solution code:
def main():
    N = int(input())
    i = 0
    while N >0:
        n = int(str(N)[-1])
        if n % 2 != 0:
            i+=1
        N -= 1
    print(i)
main()

Submission status: Runtime Error

Solution code:
n = int(input())
nums = [int(i) for i in input().split()]

bool = True
for i in range(n, 0, -1):
    t = nums[i] - 1
    if t < nums[i-1]:
        bool = False

if bool:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=b
for i in range(b):
    d+=1
    c-=1
    if d==a:
        break     
print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int,input().split()))
a = "Yes"

for i in range(N-1):
  if H[i]<H[i+1]:
    pass
  else:
    H[i]-=1

for i in range(N-1):
  if H[i]>H[i+1]:
    a = "No"

print(a)

Submission status: Runtime Error

Solution code:
import math
a = int(input())
if ((a > 0) & (a < 100001)):
    data_size = int (math.log10(a) + 1)
    if a == 100000:
        print(90909)
    elif data_size == 5:
        print(a - 10000 + 1 + 909)
    elif data_size == 4:
        print(909)
    elif data_size == 3:
        print(a - 100 + 1 + 9)
    elif data_size == 2:   
        print(9)
    elif data_size == 1:   
        print(a - 1 + 1)

Submission status: Runtime Error

Solution code:
i = input()
6 4 3
i1 = list(map(int, i.split() ) )
i2 = i1[0] - i1[1]
i3 = i1[2] - i2
		if i3 < 0:
 				print(0)
		else:
 				print(i3)

Submission status: Runtime Error

Solution code:
def main():
    N = int(input())
    i = 0
    while N >0:
        n = int(str(N)[-1])
        if n % 2 != 0:
            print("yes")
            i+=1
        N -= 1
    print(i)
main()

Submission status: Runtime Error

Solution code:
i = input()
i1 = list(map(int, i.split() ) )
i2 = i1[0] - i1[1]
i3 = i1[2] - i2
		if i3 < 0:
 				i3 = 0
		else:
 				i3 = i3

print(i3)

Submission status: Runtime Error

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

    print(result)
    sys.exit(2)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
N = int(input())

count = 0

if N < 10:
    print(N)
elif N < 100:
    print(9)
elif N < 1000:
    print(9 + min(N,999) - 100 + 1)
elif N < 10000:
    print(9 + 900)
elif N < 100000:
    print(9 + 900 + min(N , 99999) - 10000 + 1)
else:
    print(90909)

Submission status: Runtime Error

Solution code:
import sys

def main():
#    a = int(sys.argv[1])
#    b = int(sys.argv[2])
#    c = int(sys.argv[3])
    a, b, c = map(int, input().split())
    result = c-(a-b)
    if result < 0:
        result = 0

    print(result)
    sys.exit(2)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
#!/bin/python3

import os
import sys


if __name__ == '__main__':
    a = input().split()
    b = input().split()
    c = input().split()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(N-1):
    if H[i] - H[i+1] > 1:
        print('No')
        exit()

print('Yes')

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int, input().split()))
ok = True
for i in range(N - 2):
    if (H[i] > H[i + 1] and H[i + 1] > H[i + 2]) or H[i]-H[i+1]>1:
        ok = False
if H[-2] - H[-1] > 1:
    ok = False
if ok:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
a = int(input())
data_size = int (math.log10(a) + 1)
if a == 100000:
    print(90909)
elif data_size == 5:
    print(a - 10000 + 1 + 909)
elif data_size == 4:
    print(909)
elif data_size == 3:
    print(a - 100 + 1 + 9)
elif data_size == 2:   
    print(9)
elif data_size == 1:   
    print(a - 1 + 1)

Submission status: Runtime Error

Solution code:
a = int(input())
l = len(str(a))

ans = 0
if l % 2 == 0:
    while l >= 1:
        ans += 10 ** (l - 1) - 1
        l -= 2
else:
    ans += a - (10 ** (l - 1) - 1)
    l -= 1
    while l >= 1:
        ans += 10 ** (l - 1) - 1
        l -= 2

print(ans)

Submission status: Runtime Error

Solution code:
N=int(input())
H=list(map(int,input().split()))
count=0
if len(H)==1:
    print("Yes")
elif len(H)==2:
    if H[0]<=H[1]+1:
        print("Yes")
    else:
        print("No")
elif H[0]<=H[1]+1:
    for i in range(1,N-1):
        if H[i]<=H[i+1]:
            count+=1
            continue
        elif H[i]==H[i+1]+1:
            H[i]-=1
            if H[i]<H[i-1]:
                print("No")
                break
            else:
                count+=1
                continue
        else:
            print("No")
            break
else:
    print("No")
if count==N-2:
    print("Yes")

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

MOD = 998244353

N = int(input())
XY = [[int(x) for x in input().split()] for _ in range(N)]
XY.sort() # X ascending
X,Y = zip(*XY)
Y_rank = {x:i for i,x in enumerate(sorted(Y),1)}

def BIT_update(tree,x):
    while x <= N:
        tree[x] += 1
        x += x & (-x)

def BIT_sum(tree,x):
    ret = 0
    while x:
        ret += tree[x]
        x -= x & (-x)
    return ret

pow2 = [1]
for _ in range(N):
    pow2.append(pow2[-1] * 2 % MOD)

answer = 0
tree = [0] * (N+1)
for L,(x,y) in enumerate(XY):
    y = Y_rank[y]
    R = N - 1 - L
    D = y - 1
    U = N - 1 - D
    LD = BIT_sum(tree,y)
    BIT_update(tree,y)
    LU = L - LD
    RD = D - LD
    RU = R - RD
    # bounding box が自分自身を含むような集合を数える
    # 全体から引く
    cnt = pow2[N]
    cnt -= pow2[L]
    cnt -= pow2[R]
    cnt -= pow2[D]
    cnt -= pow2[U]
    cnt += pow2[LD]
    cnt += pow2[LU]
    cnt += pow2[RD]
    cnt += pow2[RU]
    cnt -= 1
    answer += cnt

answer %= MOD

print(answer)

Submission status: Runtime Error

Solution code:
import sys

def main():
    a = int(sys.argv[1])
    b = int(sys.argv[2])
    c = int(sys.argv[3])
    result = c-(a-b)
    if result < 0:
        result = 0

    print(result)
    sys.exit(2)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
BottleOne = int(input())
BottleTwo = int(input())
BottleThree = int(input())
ans = int((BottleThree+BottleTwo)) - int((BottleOne))
print(int(ans))

Submission status: Runtime Error

Solution code:
import sys
args = sys.argv
a = int(args[1])
b = int(args[2])
c = int(args[3])

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

restWater()

Submission status: Runtime Error

Solution code:
def main():
    A= int(input())
    B= int(input())
    C= int(input())
    output = C - A + B
    if output < 0:
        print(0)
    else:
        print(output)
main()

Submission status: Runtime Error

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

# box1 の許容容量
tmp = a - b
rest = c - tmp

print rest

Submission status: Runtime Error

Solution code:
N = input()
nlen = len(N)
cnt = 0
for i in range(1, nlen):
  if i % 2:
    cnt += (10 ** i) - (10 ** (i - 1))
N = int(N)
if nlen % 2:
  cnt += N - 10 ** (nlen - 1) + 1
print(cnt)

Submission status: Runtime Error

Solution code:
A= int(input())
B= int(input())
C= int(input())
output = C - A + B
if output < 0:
    print(0)
else:
    print(output)

Submission status: Runtime Error

Solution code:
n = int(input())
h = [int(i) for i in input().split()]

flag = 1
for i in range(len(h)-1):
    for j in range(i+1,len(h)):
        if(h[i]-h[j]>=2):
            print("No")
            flag=0
            break
    if(flag==0):
        break
            
if(flag==1):
    print("Yes")

Submission status: Runtime Error

Solution code:
def main():
    s = input()
    [a, b, c] = [int(number) for number in s.split()]

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

if __name__ == '__main__':20
    """
    main()

Submission status: Runtime Error

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

ab = l[0] - l[1]
cab = l[2] - ab

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

Submission status: Runtime Error

Solution code:
n = int(input())
if n <= 9:
  print(n)
elif n <= 99:
  print(9)
elif n <= 999:
  print(9+n-100+1)
elif n <= 9999:
  print(909)
elif n <= 99999:
  print(909+n-10000+1)
else:
  print(90909)

Submission status: Runtime Error

Solution code:
def main():
    output = C - A + B
    if output < 0:
        print(0)
    else:
        print(output)

main()

Submission status: Runtime Error

Solution code:
def main():
    output = C - A + B
    if output < 0:
        print(0)
    else:
        print(output)
 
main()

Submission status: Runtime Error

Solution code:
N = int(input())
count = 0
N +=1
for i in range(1, N):
    if len(str(i)) % 2 != 0:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
if n<10:
    print(n)
elif n<100:
    print(9)
elif n<1000:
    print(n-(99-9))
elif n<10000:
    print(999-(99-9))
elif n<100000:
    print(n-(9999-999)-(99-9))
elif n==100000:
    print(99999-(9999-999)-(99-9))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a = int(input())
b = int(input())
c = int(input())


transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)

Submission status: Runtime Error

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

ABgap = A - B
remain = max(0, C - ABgap)

print(remain)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <algorithm>
#include<stdio.h>
#include<functional>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long ll;
int N, A[200000];
int main() {
    int a,b,c,x;
    cin >> a>> b>>c;
    x=c-(a-b);
    if (x<=0){x=0;}

    cout << x<< endl;
    return 0;

}

Submission status: Runtime Error

Solution code:
n = int(input())

count = 0
for i in range(1, n + 1):
    s = len(str(i))
    if s%2 == 1:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Submission status: Runtime Error

Solution code:
a=$1-$2,ans=$3-a{print ans}

Submission status: Runtime Error

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: Runtime Error

Solution code:
a = input()
b = input()
c = input()


transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)

Submission status: Runtime Error

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


if a == b:
    num1 = a
else:
    num1 = a - b

if c =< num1:
    print(0)
else:
    print(c - num1)

Submission status: Runtime Error

Solution code:
import math
 
N = int(input())
 
count = 0
for i in range(1, N+1):
  if math.floor(math.log10(i)) % 2 == 0:
    count += 1
print(count)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
left_in_c = c - (a -b )
if left_in_c < 0
	left_in_c = 0 
print("{}".format(left_in_c));

Submission status: Runtime Error

Solution code:
A, B, C = stdin.readline().rstrip().split()
ans = C-(A-B)
if ans > 0:
  print(ans)
else:
  print(0)

Submission status: Runtime Error

Solution code:
output = C -(A-B)
if output < 0:
    return 0
return output

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b, c = [int(input()) for _ in range(3)]
ans = b+c-a
if ans < 1:
    print(0)
else:
    print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
l=len(a)
a=int(a)
if a==100000:
  print(90909)
elif 99999>=a>=10000:
  print(909+a-9999)
elif 9999>=a>=1000:
  print(909)
elif 999>=a>=100:
  print(9+a-99)
elif 99>=a>=10:
  print(9)
else:
  print(a)

Submission status: Runtime Error

Solution code:
int main() {

	int a, b;
	int c;
	cin >> a >> b;
	cin >> c;

	if ((c-(a-b))>0) {

		cout << c - (a - b) << endl;
	}
	else if ((c - (a - b)) <= 0) {

		cout << 0 << endl;
	}
}

Submission status: Runtime Error

Solution code:
a, b, c = [int(input()) for _ in range(3)]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys
import numpy as np
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき
def main():
    A,B,C=map(int, input().split())
    x=C-(A-B)
    if x>=0:
        print(int(x))
    else:
        print(0)

if __name__=='__main__':
    main()

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
left_in_c = c - (a -b )
left_in_c = 0 if left_in_c < 0
print("{}".format(left_in_c));

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

amount = C - (A - B)
print(amount)

Submission status: Runtime Error

Solution code:
import sys
import numpy as np
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき
def main():
    A,B,C=map(int, input().split())
    x=C-(A-B)
    if x<=0:
        print(0)
    else:
        print(x)

if __name__=='__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = [int(i) for i in input().split(" ")]
b = max((a[2]-(a[0]-a[1]), 0)
print(b)

Submission status: Runtime Error

Solution code:
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <functional>
#include <cmath>
#include <cstring>
using namespace std;
#define sci(n) scanf("%lld", &(n))
#define scd(n) scanf("%Ld", &(n))
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> pll;
int main(void)
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	LL a, b, c;
	cin >> a >> b >> c;
	LL ans = a - b;
	cout << max(0LL,c - a + b);
	return 0;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;
int main(void){
    int a,b,c,d;
    cin >> a >> b >> c;
    d=c-(a-b);
    if(d>0){
        cout << d << endl;
    }else{
        cout << 0 << endl;
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

print(c-(a-b))

Submission status: Runtime Error

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

print(c-(a-b))a

Submission status: Runtime Error

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

main()

Submission status: Runtime Error

Solution code:
nokori = a - b
ans = c - nokori
if ans < 0:
    ans = 0
print(ans)

Submission status: Runtime Error

Solution code:
-a+(b+c)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = a

if a > b+c:
  ans = b+c

print(ans)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cmath>

int main(void){
  int a, b, c;
  std::cin >> a >> b >> c;
  std::cout << std::max(0, c-(a-b)) << std::endl;
  return 0;
}

Submission status: Runtime Error

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

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