Problem:


Score : 100 points

Problem Statement

We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.

How many grams of sand will the upper bulb contains after t seconds?

Constraints

1≤X≤10^9

1≤t≤10^9

X and t are integers.

Input

The input is given from Standard Input in the following format:

X t

Output

Print the number of sand in the upper bulb after t second.

Sample Input 1

100 17

Sample Output 1

83

17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.

Sample Input 2

48 58

Sample Output 2

0

All 48 grams of sand will be gone, resulting in 0 grams.

Sample Input 3

1000000000 1000000000

Sample Output 3

0



Sample input:
100 17


Sample output:
83

Submission status: Accepted

Solution code:
#n = int(input())
#a = int(input())
#ls = list(input().split(" "))
#ls = list(map(int,input().split(" ")))
x,t = list(map(int,input().split(" ")))
#string = input()
if x - t >= 0:
  print(x - t)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int, input().split())
if x-t > 0:
    print(x-t)
else:
    print('0')

Submission status: Accepted

Solution code:
x,t = list(map(int,input().split()))
print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, t = input().split()
x, t = int(x), int(t)
if (t > x) : print(0)
else : print(x-t)

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
ans = x - t
if ans < 0:
  ans = 0
print(ans)

Submission status: Accepted

Solution code:
x,t = map(int,input().split())
if x < t:
    print(0)
else:
    print(x - t)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
print(max(0,x-y))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int, input().split())
if x >= t:
    print(x-t)
if x < t:
    print(0)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

if x < t:
    print(0)
else:
    print(x-t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = X - t
if ans < 0:
    print(0)
else:
    print(ans)

Submission status: Accepted

Solution code:
X,t=map(int, input().split())
print(max(0, X-t))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC072-A
X, t = map(int, input().split())
if X >= t:
    print(X-t)
else:
    print(0)

Submission status: Accepted

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

if X-t >= 0:
  print(X-t)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

if x - t < 0:
    print(0)
else:
    print(x - t)

Submission status: Accepted

Solution code:

X,t = map(int,input().split())

print (max(X-t,0))

Submission status: Accepted

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

if X <= t:
    print(0)
else:
    print(X-t)

Submission status: Accepted

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

# input
X, t = map(int, input().split())

# solve & output
print(X - t if X > t else 0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a[0] <= a[1]:
  print(0)
else:
  print(a[0]-a[1])

Submission status: Accepted

Solution code:
X, t = map(int,input().split())
if X - t >= 0:
    print(X - t)
else:
    print(0)

Submission status: Accepted

Solution code:

X,t = map(int,input().split())
if X <= t:
    print(0)
else:
    print(X-t)

Submission status: Accepted

Solution code:
x,t= map(int, input().split())
print(max(x-t,0))

Submission status: Accepted

Solution code:
def resolve():
	x,t=map(int,input().split())
	ans=0 if x<=t else x-t
	print(ans)
resolve()

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
print(0 if X - t < 0 else X - t)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

 
X, t = map(int, input().split())

# print(X)
# print(t)

diff = X - t
# print(diff)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

X, t = map(int, input().split())
if X - t > 0:
    print(X - t)
else:
    print(0)

Submission status: Accepted

Solution code:
def print_ans(X,t):
    """Print max(X-t,0)

    Parameters
    --------------

    Examples
    ------------
    >>> print_ans(3,0)
    3
    >>> print_ans(3,2)
    1
    >>> print_ans(2,5)
    0
    """
    print(max(0,X-t))

if __name__ == '__main__':
    X,t = map(int,input().split())
    print_ans(X,t)

Submission status: Accepted

Solution code:
x, t = map(int,input().split())
ans = x-t
if ans >= 0:
    print(ans)
else:
    print(0)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

X, t = nl()
if t >= X:
    print(0)
else:
    print(X - t)

Submission status: Accepted

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


def solve(X: int, t: int):
    if X - t <= 0:
        print(0)
        return

    print(X - t)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    t = int(next(tokens))  # type: int
    solve(X, t)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
print(max(x-t,0))

Submission status: Accepted

Solution code:
def main():
    X, t = map(int, input().split())
    if t > X:
        print(0)
    else:
        print(X - t)


main()

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
if x > t :
        print(x-t)
elif x <= t :
        print(0)

Submission status: Accepted

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

print(max(0, X-t))

Submission status: Accepted

Solution code:
x, t = map(int,input().split())
if x - t <= 0: print(0)
else: print(x-t)

Submission status: Accepted

Solution code:
# Input
x, t = map(int, input().split())

# Calc
ans = max(x-t, 0)

# Output
print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
import itertools

def main():
    x, t = map(int, input().split())
    print(max(0, x - t))



if __name__ == '__main__':
    main()

Submission status: Accepted

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

print (max(0, X-t))

Submission status: Accepted

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


abc()

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
print(X-t if X-t>0 else 0)

Submission status: Accepted

Solution code:
X,t=map(int, input().split())
if X<t:
  print(0)
else:
  print(X-t)

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


x, t = MI()
print(max(0, x-t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
if 0 < (X - t):
    print(X - t)
else:
    print(0)

Submission status: Accepted

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

x, t = map(int, input().split(' '))

if x-t >= 0:
    print(x-t)
else:
    print(0)

Submission status: Accepted

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


def solve(X: int, t: int):
    ret = max(0, X - t)
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    t = int(next(tokens))  # type: int
    solve(X, t)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
if x<t:
  print(0)
else:
  print(x-t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if(X>t):
    print(X-t)
else:
    print('0')

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
if X <= t: print(0)
else: print(X-t)

Submission status: Accepted

Solution code:

X,t=map(int,input().split())
print(max(X-t,0))

Submission status: Accepted

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

a  = x - t

if a > 0 :
  print(x-t)
else:
  print('0')

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [input() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X, t = MI()
    print(max(0,X-t))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, T = [int(s) for s in input().split()]
print(max([X - T, 0]))

Submission status: Accepted

Solution code:
x, t = [ int(v) for v in input().split() ]

print(max(0,x-t))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

x, t = map(int, input().split())
if x <= t:
    ans = 0
else:
    ans = x-t
print(ans)

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
if x <= t:
  print(0)
else:
  print(x-t)

Submission status: Accepted

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

answer=x-t

if answer<0:
    print("0")

else:
    print(answer)

Submission status: Accepted

Solution code:
X,t = map(int, input().split())
print(X-t if X-t>0 else 0)

Submission status: Accepted

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

print(x-t if x>t else 0)

Submission status: Accepted

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

Submission status: Accepted

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

if (x-t) > 0 :
    print(x-t)
else :
    print("0")

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
if X < t:
  print(0)
else:
  print(X - t)

Submission status: Accepted

Solution code:
X,t = map(int, input().split())
if X - t >= 0:
    print(X - t)
else:
    print(0)

Submission status: Accepted

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

print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int, input().split())
if x - t > 0:
    print(x-t)
else:
    print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))

ans = l[0] - l[1] if (l[0] - l[1]) >= 0 else 0
print(ans)

Submission status: Accepted

Solution code:
X, t = map(int,input().split())
print(max(0, X - t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t = map(int,input().split(' '))
print(max(X-t,0))

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc072/tasks/abc072_a
X, t = map(int, input().split())
print(X-t) if X-t>0 else print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(eval(input().replace(' ','-')))
print(a if a>0 else 0)

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
if x-t>=0:
  print(x-t)
else:
  print('0')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int,input().split())
if x<t:
  print(0)
else:
  print(x-t)

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
if t >= X:
  print(0)
else:
  print(X - t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int,input().split())
 
print(max(x - t,0))

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
if x-t<0: print(0)
else: print(x-t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t=list(map(int,input().split()))
print(max([X-t,0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, t = list(map(int, input().split()))
if t > x:
  print(0)
else:
  print(x-t)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
print(max(0,n-m))

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
print(0 if X<=t else X-t)

Submission status: Accepted

Solution code:
x, t =[int(i) for i in input().split()]
if x > t:
  print(x-t)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

if x-t>0:
  print(int(x-t))
else:
  print(int(0))

Submission status: Accepted

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

print(X - t if (X > t) else 0)

Submission status: Accepted

Solution code:
X,t = map(int,input().split(" "))
print(max(0,X-t))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def read_input():
    x, t = map(int, input().split())
    return x, t


def submit():
    x, t = read_input()

    print(max(0, x - t))

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
X,t=map(int,input().split())
print(X-t if X-t >= 0 else 0)

Submission status: Accepted

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

Submission status: Accepted

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

if x - y >= 0:
    print(x-y)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x, t = f()
    print(max(0, x -t))

solve()

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
a = l[0] - l[1]
if a < 0:
  a = 0
print(a)

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    x,t = (int(_) for _ in input().split())
    
    print(max(x-t,0))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = X - t
if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Accepted

Solution code:
x,t = list(map(int, input().split()))
print(x-t if x>t else "0")

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
if x<t:
    ans=0
else:
    ans=x-t
print(ans)

Submission status: Accepted

Solution code:
X,t = map(int, input().split())
ans = X-t
if ans < 0:
  ans = 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t = map(int, input().split())
if X <= t:
    print(0)
else:
    print(X - t)

Submission status: Accepted

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

ans = x - t
if ans < 0:
  ans = 0

print(ans)

Submission status: Accepted

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

x, t = map(int, input().split())

if x < t:
    print(0)
else:
    print(x-t)

Submission status: Accepted

Solution code:
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    X, T = getIntList()
    return max(X-T, 0)


ans = prob()
print(ans)

Submission status: Accepted

Solution code:
x,t = map(int,input().split())
if x - t <= 0:
    print(0)
else:
    print(x - t)

Submission status: Accepted

Solution code:
X, t = map(int,input().split())
if t>=X:
  print("0")
else:
  print(X-t)

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
print(X-t if X-t >= 0 else 0)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


x, y = inl()
print(max(x-y,0))

Submission status: Accepted

Solution code:
# ABC072A - Sandglass2
x, t = list(map(int, input().rstrip().split()))
print(x - t if x > t else 0)

Submission status: Accepted

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

if x>=t:
    print(x-t)
else:
    print('0')

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
if x - t < 0:
	print(0)
else:
	print(x - t)

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
if X-t < 0:
    print(0)
else:
    print(X-t)

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
if X >= t :
    print(X-t)
else :
    print(0)

Submission status: Accepted

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

if (X-t) < 0:
  print(0)
else:
  print(X-t)

Submission status: Accepted

Solution code:
x, t = [int(n) for n in input().split()]

print(x-t if x>=t else 0)

Submission status: Accepted

Solution code:
x, t = [int(item) for item in input().split()]
print(max(0, x-t))

Submission status: Accepted

Solution code:
X, T = map(int, input().split())
print(max([0, X - T]))

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
if (x <= t):
  print('0')
else:
  print(x - t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[X,t] = list(map(int, input().split()))
print(max(0,X-t))

Submission status: Accepted

Solution code:
x, t = [int(i) for i in input().split()]
ans = x - t
if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
MOD = 10 ** 9+7
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


X, t = mi()
print(max(X-t,0))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8-*-
if __name__ == '__main__':
    X, t = map(int, input().split())
    if X < t:
        print("0")
    else:
        print(X-t)

Submission status: Accepted

Solution code:
X, t = list(map(int, input().split()))

print(max(0, X-t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t = map(int,input().split())
if X >= t:
    print(X-t)
else:
    print(0)

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
ans=x-t
if x<t:
    ans=0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(max(a - b, 0))

Submission status: Accepted

Solution code:
x, f = map(int, input().split())
ans = x - f if x >= f else 0
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(max(a - b, 0))

Submission status: Accepted

Solution code:
X, t = map(int,input().split())
print(X-t if X > t else 0)

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
if x-t <= 0:
    print("0")
else:
    
    print(x-t)

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
if X - t >= 0:
    print(X - t)
else:
    print(0)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc072/tasks/abc072_a

import itertools
import collections
import bisect

def main():
    X, t = map(int, input().split())
    print(max(0, X - t))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,m=map(int,input().split(' '))
a=n-m
if a>=0:
    print(a)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t=map(int,input().split())
print(X-t if(X-t)>0 else 0)

Submission status: Accepted

Solution code:
#072 A
X,t =map(int,input().split())
print(max((X-t),0))

Submission status: Accepted

Solution code:
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X) - int(t)
if remain_sand > 0 :
  print(remain_sand)
else :
  print(0)

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
ans = x - t
if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Accepted

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

x,t = map(int,input().split())

print(max(0,x-t))

Submission status: Accepted

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

Submission status: Accepted

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

if m > n:
  print(0)
else:
  print(n-m)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    X, t = map(int, input().split())

    return max(0, X - t)


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

Submission status: Accepted

Solution code:
X, t = list(map(int, input().split()))

ans = 0
if X-t>0:
	ans = X-t

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
if X > t:
    print(X - t)
else:
    print('0')

Submission status: Accepted

Solution code:
X,t = [int(x) for x in input().split()]
left = X-t if X-t>=0 else 0
print(left)

Submission status: Accepted

Solution code:
X, t =list(map(int, input().split( )))
print(max(X-t,0))

Submission status: Accepted

Solution code:
def sandglass2(X: int, t: int)->int:
    return max(0, X-t)


if __name__ == "__main__":
    X, t = map(int, input().split())
    ans = sandglass2(X, t)
    print(ans)

Submission status: Accepted

Solution code:
X,t=map(int,input().split())
if X<=t:
  ans=0
else:
  ans=X-t
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = map(int, input().split())
res = x-t if x-t >=0 else 0
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t=map(int,input().split(' '))
print(str(max(0,X-t)))

Submission status: Accepted

Solution code:
#ABC72
x, t = map(int, input().split())
print(max(0,x-t))

Submission status: Accepted

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


def main():
    X, t = map(int, input().split())
    print(0 if X-t<=0 else X-t)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
print(0 if X-t<=0 else X-t)

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B = IL()

print(max(0,A-B))