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

Submission status: Runtime Error

Solution code:
N = int(input())
n=N
c=0
while n>0:
  n//=10
  c+=1

print(c)
if c%2==0:
  print(int((10**c-1)/11))
else: 
  print(int(N-10**(c-1)+1+(10**(c-1)-1)/11))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n=int(input())
h=list(map(int,input().split()))
ans='Yes'
for i in range(n-1,0,-1):
    print(h[i])
    if h[i]>h[i-1]:
        continue
    elif h[i]+1==h[i-1]:
        h[i-1]-=1
    else:
        ans='No'
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
if N < 10 ** 1:
    print(N)
elif N < 10 ** 2:
    print(9)
elif N < 10 ** 3:
    print(N - 90)
elif N < 10 ** 4:
    print(909)
elif N < 10 ** 5:
    print(N - 9090)
else:
     print(90909)

Submission status: Runtime Error

Solution code:
N = int(input())
2 ans = 0
3 for i in range(1, N + 1):
4 if len(str(i)) % 2 == 1:
5 ans += 1
6 print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<string>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define repm(i, m, n) for (int i = (m); i < (n); i++)
#define rep_rev(i, n) for (int i = int (n); i >= 0; i--)
typedef long long ll;
using namespace std;

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 10:
  print(n)
  exit()
if n >= 10 and n < 100:
  print(9)
  exit()
if n >= 100 and n < 1000:
  #print(9 + (int(str(n)[-2:])) + 1)
  print(9 + (n-100) + 1)
  exit()
if n >= 1000 and n < 10000:
  print(909)
  exit()
if n >= 10000 and n < 100000:
  print(909 + (n-10000) + 1)
  exit
if n == 100000:
  print(90909)

Submission status: Runtime Error

Solution code:
n = int(input())
if n < 10:
  print(n)
  exit()
if n >= 10 and n < 100:
  print(9)

if n >= 100 and n < 1000:
  #print(9 + (int(str(n)[-2:])) + 1)
  print(9 + (n-100) + 1)
  exit()
if n >= 1000 and n < 10000:
  print(909)
  exit()
if n >= 10000 and n < 100000:
  print(909 + (n-10000) + 1)
  exit
if n == 100000:
  print(90909)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
#B＋CがAより少ないなら０
if B+C =< A:
    print(0)
else:
    print(C+B-A)

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
#場合分けが必要なのか？？

#B＋CがAより少ないなら０
if B+C =< A:
    print(0)
else:
    print(C-(A-B))

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
#場合分けが必要なのか？？

#B＋CがAより少ないなら０
if　B+C <= A:
#<=の順番すぐ間違えるやん！！
    print(0)
else:
    print(C-(A-B))

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
#場合分けが必要なのか？？

#B＋CがAより少ないなら０
if　B+C =< A:
    print(0)
else:
    print(C-(A-B))

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(x) for x in inpput().split()]
print(b+c-a if b+c-a > 0 else 0)

Submission status: Runtime Error

Solution code:
6 4 3

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
if (a+b) % 2 ==0:
  print((a + b)// 2)
else:
  print("IMPOSSIBLE")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if B >= 1 and A >= B and A <= 20 and C >= 1 and C <= 20:
    capacity = A - B
    if capacity <= C:
        remaining = C - capacity
    else:
        remaining = 0
    print(remaining)

Submission status: Runtime Error

Solution code:
N = int(input())
2 ans = 0
3 for i in range(1, N + 1):
4 if len(str(i)) % 2 == 1:
5 ans += 1
6 print(ans)

Submission status: Runtime Error

Solution code:
if N < 10:
    print(N)
elif N >= 10 and N < 100:
    print(9)
elif N >= 100 and N < 1000:
    print(N - 90)
elif N >= 1000 and N < 10000:
    print(909)
elif N >= 10000 and N < 100000:
    print(N-9090)
else:
    print(90909)

Submission status: Runtime Error

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

A=B+D

E=C-D

print(E)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input())
print(abs(a-b+c))

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int, input().split()))
for i in range(N-1,0,-1):
    if H[i]>H[i-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()))
for i in range(N-1,0,-1):
    if H[i]>H[i-1]:
        if H[i]>(H[i]-1):
            print("No")
            exit()
print("Yes")

Submission status: Runtime Error

Solution code:
N=input()
Num = len(N)
if Num == 5:
		Ans = (int(N)-9999) + 900 + 9
elif Num == 4:
		Ans = 900 + 9
elif Num == 3:
		Ans = (int(N)-99) + 9
elif Num == 2:
		Ans = 9
elif Num == 1:
		Ans = N
elif Num == 6:
		Ans = 90000 + 900 + 9    
print(Ans)

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

A = int(args[1])
B = int(args[2])
C = int(args[3])

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

Submission status: Runtime Error

Solution code:
n = int(input())
h = list(map(int, input().split()))
h[0] -= 1
flag = True
for i in range(n - 1):
    # print(i)
    if h[i] > h[i + 1]:
        flag = False
        break
    elif h[i] <= h[i + 1] - 1:
        h[i + 1] -= 1

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

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
mod = 998244353

def sub(a, b):
    return (a % mod + mod - b % mod) % mod

n, = list(map(int, input().split()))
t = 1
dd = [t]
for _ in range(n):
    t=2*t%mod
    dd.append(t)

def power(a, b):
    return dd[b]

class SegTree:
    def __init__(self, init_val, n, ide_ele, seg_func):
        self.segfunc = seg_func
        self.num = 2**(n-1).bit_length()
        self.ide_ele = ide_ele
        self.seg=[self.ide_ele]*2*self.num
        for i in range(n):
            self.seg[i+self.num-1]=init_val[i]    
        for i in range(self.num-2,-1,-1) :
            self.seg[i]=self.segfunc(self.seg[2*i+1],self.seg[2*i+2]) 
        
    def update(self, k, x):
        k += self.num-1
        self.seg[k] = x
        while k+1:
            k = (k-1)//2
            self.seg[k] = self.segfunc(self.seg[k*2+1],self.seg[k*2+2])
        
    def query(self, p, q):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfunc(res,self.seg[p])
            if q&1 == 1:
                res = self.segfunc(res,self.seg[q])
                q -= 1
            p = p//2
            q = (q-1)//2
        if p == q:
            res = self.segfunc(res,self.seg[p])
        else:
            res = self.segfunc(self.segfunc(res,self.seg[p]),self.seg[q])
        return res

def mm(a, b, c, d, n):
    return sub(power(2, b+c) + power(2, c+d) + power(2, d+a) + power(2, a+b),
                power(2, a) + power(2, b) + power(2, c) + power(2, d))

xs, ys = [], []
for _ in range(n):
    x, y = list(map(int, input().split()))
    xs.append(x)
    ys.append(y)

ini = sorted(list(range(n)), key=lambda x:xs[x])
for i, yi in enumerate(sorted(list(range(n)), key=lambda x:ys[x])):
    ys[yi] = i 
nys = [ys[i] for i in ini]

ss1 = SegTree([0] * n, n, 0, lambda x,y:x+y)
r = 0
for i, y in enumerate(nys):
    ss1.update(y, 1)
    d = ss1.query(0, y)
    c = i - d
    b = (n-1) - y - c
    a = (n-1) - b - c - d
    r = (r + mm(a, b, c, d, n)) % mod

print(sub((power(2, n) * n) % mod, (r+n)%mod))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] -= 1
        if lis_h[i - 1] < lis_h[i - 2]:
            print("No")
            exit()
print("Yes")

Submission status: Runtime Error

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

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] -= 1
        if lis_h[i - 1] < lis_h[i - 2]:
            print("No")
            exit()
print("Yes")

Submission status: Runtime Error

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

for i in range(N,1,-1):
    if lis_h[i - 1] < lis_h[i - 2]:
        lis_h[i - 2] += -1
        if lis_h[i - 1] < lis_h[i - 2]:
            print("No")
            exit()
print("Yes")

Submission status: Runtime Error

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


print(c-(a-b))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

    for i in range(1, N):
        if A[i - 1] > A[i]:
            return "No"
        else:
            A[i] -= 1
    return "Yes"
print(main())

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
 
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=int(input())
B=int(input())
C=int(input())

while B < A and C != 0 :
    B += 1
    C +=  -1
print(C)

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
C=int(input())

wile B < A and C != 0 :
    B += 1
    C -= 1
print(C)

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
C=int(input())

wile B < A and C != 0 :
    B +=1
    C -=1
print(C)

Submission status: Runtime Error

Solution code:
cap, current, rem = input.split()
cap, current, rem = int(cap), int(current), int(rem)

while current < cap and rem > 0:
  current += 1
  rem -= 1
print(rem)

Submission status: Runtime Error

Solution code:
a, b, c = input().spilt()

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

else:
  print(b+c-a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

N = int(input())
H = [int(x) for x in input().split()]

flag = 0

for i in range(len(H) - 1):
    if H[i] > H[i+1] + 1:
        print('No')
        sys.exit()
	
    elif H[i] == H[i+1] + 1:
	flag = 1
	
    if flag == 1:
        if H[i]	> H[i+1]:
            print('No')
            sys.exit()

print('Yes')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())
s = C - (A - B)
if s > 0:
    print(s)
else:
	print(0)

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int,input.split()))
ANS = True
for i in range(1,N):
    if H[N-i] >= H[N-i-1]:
        continue
    else if (H[N-i] - H[N-i-1]) == -1:
        H[N-i-1] += 1
    else:
        ANS = False
        break
if ANS:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys

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

for i in range(N-1):
  if H[i] - H[i+1] == 1:
    H[i+1] -= 1
  elif H[i] - H[i+1] >= 2:
    ans = ("No")
    print(ans)
    sys.exit()

print(ans)

Submission status: Runtime Error

Solution code:
from sys import stdin

param = input().split()
A=param[0]
B=param[1]
C=param[2]

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

Submission status: Runtime Error

Solution code:
#include <stdio.h>

int main(){
  int a,b,c,s;
  scanf("%d %d %d",&a,&b,&c);
  s=a-b;
  
  if (s<c){
    printf("%d",c-s);
  }else{
    printf("0");
  }
  
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n=int(input())
h=list(map(int,input().split()))
a=True
for i in range(n):
  for j in range(i,n):
    if h[i]-h[j]>1:
      a=False
if a==False:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
n = int(input())
h = [int(x) for x in input().split(" ")]
 
for i in range(1, n):
  if h[-i]-h[-i-1] >= 0:
    continue  
  elif h[-i]-h[-i-1] == -1:
    h[-i-1] = h[i-1] - 1
    continue
  elif h[i]-h[-i-1] < -1:
    ans = "No"
    break
else:
  ans = "Yes"
 
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

trans_amouint = min(b - a, c)
print(c - trans_amount)

Submission status: Runtime Error

Solution code:
a, b, c = int(input())
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):
    minh = min(H[i+1:]) # i+1以降のリストをスライス
    if H[i] - minh >= 2:
        print('No')
        break
    else:
        continue
else:
    print('Yes')

"""
# よく考えたら最大だけじゃダメだった
m = H.index(max(H)) # 複数の候補がある場合は最初のインデックスを返す
print(m)
for i in range(m+1, N):
    if H[m] - H[i] >= 2:
        print('No')
        break
    else:
        continue
else:
    print('Yes')
"""

Submission status: Runtime Error

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

Submission status: Runtime Error

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

answer = C-A+B

if answer >= 0:
print(answer)

else :
print(0)

Submission status: Runtime Error

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

answer = C-A+B

if answer > 0:
print(answer)

else :
print(0)

Submission status: Runtime Error

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

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

else :
print(C-A+B)

Submission status: Runtime Error

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

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

else B+C > A:
print(C-A+B)

Submission status: Runtime Error

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

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

else B+C > A:
print(C-A+B)

Submission status: Runtime Error

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


if B+C <= A
print(0)

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

Submission status: Runtime Error

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


if B+C <= 20
print(0)

else B+C > 20
print(C-A+B)

Submission status: Runtime Error

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

if B+C <= 20
print(0)

else B+C > 20
print(C-A+B)

Submission status: Runtime Error

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

if B+C <= 20
print(0)

else B+C > 20
print(C-A+B)

Submission status: Runtime Error

Solution code:
input()

if B+C <= 20
print(0)

else B+C > 20
print(C-A+B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
print(str(c - a - b) + "ml")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
print(str((b + c) % a) + "ml")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A,B,C=input().splite()
D=A-B
if D>C:
  E=0
elif:
  E=C-D
print(E)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
from collections import deque
input = sys.stdin.readline
n = int(input())
hL = list(map(int, input().split()))
flag = 'Yes'
for i in range(n-1):
    for j in range(i+1, n) :
        if hL[i] -hL[j]>=2:
            flag = 'No'
            break
    if flag =='No':
        break
print(flag)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
h = list(map(int,input().split()))
submax = 0

for i in range(n-1):
  for j in range(i+1,n):
    if h[i] - h[j] >= 2:
      submax = 1
      break
  if submax == 1:
    break

if submax == 1:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split()) 
K = (a+b)/2
if (a+b)//2 ==1:
    print('IMPOSSIBLE')
else:
    print(int(K))

Submission status: Runtime Error

Solution code:
ans = a-b-c
if ans < 0:
    print(ans*-1)
else:
    print(0)

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:
list_ = input().split()
remain_quant = int(list_[0] - list_[1])
if remain_quant >= int(list_[2]):
  print(0)
else:
  print(int(list_[2] - remain_quant)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

N = int(input())
H = []
H = input().split(" ")
for i in range(N):
    H[i] = int(H[i])

ochinchin = True
for i in range(1, N):
    if H[i]<H[i-1]:
        H[i-1] -= 1
        if H[i]<H[i-1]:
            ochinchin = False
            break
        elif i >= 2:
            if H[i-1]<H[i-2]:
                ochinchin = False
                break

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

Submission status: Runtime Error

Solution code:
n = int(input())
h_lis = list(map(int,input().split()))
for i in range(n-1):
  if h_lis[i]-h_lis[i+1] == 1:
    h_lis[i] -= 1
  else:
    pass
    

for i in range(n-1):
  if h_lis[i]-h_lis[i+1] > 0:
    print('No')
    break
else:
  print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())




list_a=np.arange(1, N+1)
list_b =[]




for i in list_a:
    if  len(str(i))%2 !=0:
        list_b.append(i)

print(len(list_b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
odd = []
for i in range(1, n + 1):
    if len(str(i)) % 2 == 1:
        odd.append(i)
print(len(odd))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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 = int(input())
B = int(input())
C = int(input())
print(C - (A + B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
num = input().split()
a = num[0]
b = num[1]
c = num[2]
ans = b + c - a
if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C=map(input().strip())
print(C-A+B)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
print(max(0,c-b+a))

Submission status: Runtime Error

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

n = input()

N = 10

child_data = [[1]*len(n)]
for j in range(1, len(n)+1):
    child_fin = [0]*len(n)
    for i in range(len(n)):
        if n[i] == "L":
            child_fin[i-1] += child_data[j-1][i]
        else:
            child_fin[i+1] += child_data[j-1][i]
    child_data.append(child_fin)
    if child_fin in child_data[:-1]:
        child_last = child_data[-(j%2+1)]
        break

output = " ".join(map(str, child_last))
print(output)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input("A")
b=input("B")
c=input("C")
i=int(a)-int(b)
j=int(c)-int(i)
if j > 0:
    print(j)
else:
    print('0')

Submission status: Runtime Error

Solution code:
a=input("a")
b=input("b")
i=int(a)-int(b)
c=input("c")
j=int(c)-int(i)
if j > 0:
    print(j)
else:
    print('0')

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

Solution code:
import sys
result = int(sys.argv[2]) + int(sys.argv[3]) - int(sys.argv[1])
if result < 0:
    result = 0
print(result)

Submission status: Runtime Error

Solution code:
import sys
result = sys.argv[1] + sys.argv[2] - sys.argv[0]
if result < 0:
    result = 0;
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split())) 
l2 =[]
i = len(l)
for i in range(len(l):
  if l[i] > l[i-1]:
    l[i] += 1
    i += 1

i = 0
l2 = [l[i] <= l[i+1] for i in range(len(l)-1)]

if all(l2):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import time

A = int(input())
B = int(input())
C = int(input())

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

else:
    print(0)

Submission status: Runtime Error

Solution code:
s = input()
sl = len(s)
dp = {}
ct = [0] * sl
for x in range(sl):
    dp[(0, x)] = x - 1 if s[x] == 'L' else x + 1
for i in range(32):
    for j in range(sl):
        dp[(i + 1, j)] = dp[(i, dp[(i, j)])]
for x in range(sl): ct[dp[(32, x)]] += 1
print(' '.join([str(ct[x]) for x in range(sl)]))

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

a = int(args[1])
b = int(args[2])
c = int(args[3])

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

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

a = int(args[1])
b = int(args[2])
c = int(args[3])

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

Submission status: Runtime Error

Solution code:
n=int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
sum = 0
for i in range[1,N+1]:
  if len(i) % 2 == 1:
    sum += 1
print(sum)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x=int(input().split)
A=x[0]
B=x[1]
C=x[2]
if B+C-A>0:
    print(B+C-A)
else:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

c_final = c - ( a - b )

if c_final <= 0:
  print("0")
  
else:
  print(c_final)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())


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

print(ans)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())

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

Submission status: Runtime Error

Solution code:
A = int(input())
B =  int(input())
C = int(input())

if B != C:
	surplus = A - B
	result = C - surplus 
	print(result)
else:
	print(0)

Submission status: Runtime Error

Solution code:
A = input()
B = input()
C = input()


if B != C {
	surplus = A - B
	result = C - surplus 
	print(result)
} else { 
	 print(0)
}