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: Wrong Answer

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

print(a + b < c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c-a+b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

f1 = a - b
f2 = c - f1

print(f2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# 2.正しく処理
youki = a - b
nokori = youki-c

if nokori < 0 :
    print(0)

else :
    print(nokori)

Submission status: Wrong Answer

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

# 2.正しく処理
youki = a - b
nokori = youki-c

print(nokori)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ab = a - b
cab = c - ab

if cab >= 0:
    print(0)

if cab < 0:
    print(cab)

Submission status: Wrong Answer

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

ab = a - b
cab = c - ab

if cab >= 0:
    print(0)

Submission status: Wrong Answer

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

d = a - b

if c <= d:
  print(b+c)
elif c > d:
  print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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


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


main()

Submission status: Wrong Answer

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


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

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


print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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


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


print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#! python3
#  solve_136A.py

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

print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0

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

Submission status: Wrong Answer

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

cnt = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

def main():
    a, b, c = map(int, input().split())
    print(c - (a - b))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print (c-(a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print( C - (A - B))

Submission status: Wrong Answer

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

print(c - a + b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cup_1 = A - B
cup_2 = C - cup_1
print(cup_2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while b <= a:
    c -= 1
    b += 1

print(c)

Submission status: Wrong Answer

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

while b < a:
    c -= 1
    b += 1

print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print((lambda x:(x[1]+x[2]-x[0]))(list(map(int,input().split()))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C - (A - B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c - ( a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C - (A - B))

Submission status: Wrong Answer

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

print(B+C-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C - (A - B))

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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()
    print(c-(a-b))
#%%submit!
resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

else:
    print(c-(b-a))

Submission status: Wrong Answer

Solution code:

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

else:
    print(c-(b-a))

Submission status: Wrong Answer

Solution code:
print(-eval(input().replace(' ','-')))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c-a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

print(c-(a-b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
bottle1, water, bottle2 = map(int, input().split())
empty = bottle1 - water
print(bottle2 - empty)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C-(A-B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    s = input()
    ans = [0]*len(s)
    start = -1
    center = -1
    end = -1
    for i in range(len(s)):

        if i == 0:
            start = i
        elif s[i-1] == "L" and s[i] == "R":
            start = i
        if s[i] == "R" and s[i+1] == "L":
            center = i
        if i == len(s)-1:
            end = i
        elif s[i] == "L" and s[i+1] == "R":
            end = i

        if 0 <= start <= center <= end:
            if (end-start) % 2 == 1:
                ans[center] = (end-start+1) // 2
                ans[center+1] = (end-start+1) // 2
            else:
                if (end-center) > (center-start+1):
                    if (end-center) % 2 == 1:
                        ans[center] = center-start+1
                        ans[center+1] = end-center
                    else:
                        ans[center+1] = center-start+1
                        ans[center] = end-center
                else:
                    if (center-start+1)%2 == 0:
                        ans[center] = end-center
                        ans[center+1] = center-start+1
                    else:
                        ans[center+1] = end-center
                        ans[center] = center-start+1

    print(" ".join(map(str, ans)))
resolve()

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(round(c-a+b))

Submission status: Wrong Answer

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

print(c-a+b)

Submission status: Wrong Answer

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

print(float(c-a+b))

Submission status: Wrong Answer

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

print(float(c-a-b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(C - (A - B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(B+C-A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

left = a - b
print(c - left)

Submission status: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, c = map(int, readline().split())
  print(c-(a-b))
  
  
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
s = list(input())
def move_children(RL, li):
    newli = li.copy()
    for n, rl in enumerate(RL):
        if rl == "R":
            newli[n]-=li[n]
            newli[n+1]+=li[n]
        elif rl=="L":
            newli[n]-=li[n]
            newli[n-1]+=li[n]
    return newli
nextli = [1 for i in range(len(s))]
 
for f in range(10**3):
    nextli=move_children(s,nextli)
print(" ".join(map(str,nextli)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    print(a[2] - (a[0]-a[1]))

Submission status: Wrong Answer

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

print(c-a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
s = input()
n = len(s)
a = [0 for i in range(n)]
ct = 0

if s[0] == "R":
    ct += 1

for i in range(1, n):
    if s[i] == "R":
        ct += 1
    else:
        a[i-1] += math.ceil(ct/2)
        a[i] += math.floor(ct/2)
        ct = 0

ct = 0

if s[n-1] == "L":
    ct += 1

for i in range(n-2, -1, -1):
    if s[i] == "L":
        ct += 1
    else:
        a[i] += math.floor(ct/2)
        a[i+1] += math.ceil(ct/2)
        ct = 0

print(*a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
cap = A - B
print(C-cap)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

tmp = a-b

print(c-tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = C - (A - B)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = abs((A-B)-C)

print(i)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(C - (A - B))

Submission status: Wrong Answer

Solution code:
s = input()

children = [1 for i in range(len(s))]
moved_1 = []
moved_2 = []

for i in range(10**100):
    tem = children.copy()
    for index in range(len(s)):
        if s[index] == "L":
            children[index - 1] += tem[index]
            children[index] -= tem[index]
        elif s[index] == "R":
            children[index + 1] += tem[index]
            children[index] -= tem[index]
    #print(children) 
    #print(moved_1)
    #print(moved_2)
    if moved_2 == children or moved_1 == children:
        if i % 2 == 0:
            print(moved_1)
        else:
            print(children)
        break
    else:
        moved_2 = moved_1.copy()
        moved_1 = children.copy()

Submission status: Wrong Answer

Solution code:
def divisors(n) -> list:
    res = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            res.append(i)
            if i != n // i:
                res.append(n // i)
    #res = sorted(res)
    return res

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def divisors(n) -> list:
  res = []
  for i in range(1, int(n ** 0.5) + 1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  #res = sorted(res)
  return res

print(divisors(10))
# 出力
# [1, 10, 2, 5]

print(divisors(1))
# 出力
# [1]

Submission status: Wrong Answer

Solution code:
def divisors(n) -> list:
  res = []
  for i in range(1, int(n ** 0.5) + 1):
    if n % i == 0:
      res.append(i)
      if i != n // i:
        res.append(n // i)
  # sorted(res)
  return res

print(divisors(10))
# 出力
# [1, 10, 2, 5]

print(divisors(1))
# 出力
# [1]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(C-A+B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = B+C-A
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

peaple = [0]*len(S)

l_count = 1
r_count = 1
update_r = 1

for i in range(1,len(S)):
  if S[i] == 'R' and S[i-1] == 'R':
      r_count+=1
  elif S[i] == 'L' and S[i-1] == 'R':
      add_peaple = r_count // 2
      if r_count % 2 == 0:
        peaple[i-1] += add_peaple
      else:
        peaple[i-1] += add_peaple + 1
      peaple[i] += add_peaple
      update_r = i-1
      r_count = 1
  elif S[i] == 'L' and S[i-1] == 'L':
      l_count+=1
  elif S[i] == 'R' and S[i-1] == 'L':
      add_peaple = l_count // 2
      if l_count % 2 == 0:
         peaple[update_r+1] += add_peaple
      else:
         peaple[update_r+1] += add_peaple + 1
      peaple[update_r] += add_peaple
      l_count = 1
      
add_peaple = l_count // 2
if l_count % 2 == 0:
    peaple[update_r+1] += add_peaple
else:
    peaple[update_r+1] += add_peaple + 1
peaple[update_r] += add_peaple
      
for idx, p in enumerate(peaple):
    if idx < (len(S)-1):
      print(p,end = ' ')
    else:
      print(p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b, t = [int(x) for x in input().split()]
print(math.ceil((t + 0.5) // a) * b)

Submission status: Wrong Answer

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

ans = a - b
ans = c - ans

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a = C - (A - B)

print(a)