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:
X, t = map(int, input().split())
print(max(X-t, 0))

Submission status: Accepted

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

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

result = X - t

if result < 0:
    result = 0

print(result)

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 else 0)

Submission status: Accepted

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

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())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Submission status: Accepted

Solution code:
# Xgある砂が1秒に1g落ちる砂時計 t秒後に何g残るか

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

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

Submission status: Accepted

Solution code:
# X秒を測れる砂時計があります。
# はじめ上のパーツに砂が X[g] あり、1秒間に 1[g] 砂が落ちます。
# なお、上のパーツにもう砂が残っていない場合は砂は落ちません。
# t秒後に上のパーツに残っている砂は何gでしょう。

# 制約
# 1 ≦ X ≦ 1000000000
# 1 ≦ t ≦ 1000000000
# X, t は整数

# 標準入力から X, tの値を取得する
x, t = map(int, input().split())

# t秒後の砂の[g]グラム数を計算し、出力する
result = 0

if x > t:   # xがtより大きい場合は、残りx - t[g]
    result = x - t
else:
    result = 0  # tの方が大きい場合は残り 0[g]

print(result)

Submission status: Accepted

Solution code:
# A - Sandglass2

# X秒測れる砂時計で、t秒後に残っている砂は何グラムか


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 t >= x:
  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:
    print(0)
else:
    print(X - t)

Submission status: Accepted

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

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

Submission status: Accepted

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

# Xがtより小さいなら0、そうじゃないならX-tの結果を出力
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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

X,t = MI()
print(max(0,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:
import sys

X, t = map(int, sys.stdin.readline().split())
print(max(0, 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())
print(X-t if t<X else 0)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

print(main())

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())
answer = int( X - t )
if answer > 0:
    print(answer)
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:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def LI():
    return list(map(int, input().split()))


X, t = LI()
ans = max(X-t, 0)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

x,t = inpl()
print(max(x-t,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:
X,t = map(int,input().split())
ans = X-min(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,y = map(int,input().split())

print(max(0,x-y))

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#   AtCoder abc072 a
#   ストレッチ課題

#   入力
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())
# 処理
answer = X - t
if X <= t:
    print(0)
else:
    print(answer)

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())
print(max(0, x-t))

Submission status: Accepted

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

# X秒を測れる砂時計があります。はじめ上のパーツに砂が X[g] あり、1秒間に 1[g] 砂が落ちます
# t秒後に上のパーツに残っている砂は何gかを出力
if X > t:
    print(X - t)
else:
    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())
print(max(x-t,0))

Submission status: Accepted

Solution code:
# 072a

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())
 
#残りの砂を計算し出力
Remain = X - t
if Remain > 0:
    print(Remain)
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 print(0)

Submission status: Accepted

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

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:
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(X - t if X-t>0 else 0)

Submission status: Accepted

Solution code:
# はじめの砂の量Xと何秒後tを整数で入力
X,t = map(int,input().split())
# t秒後に残っている砂の量を出力
if X > t:
    print(X - t)
else:
    print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

kekka = S_list[0] - S_list[1]
if kekka >= 0 :
    print(kekka)
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:
a,b=input().split()
a=int(a)
b=int(b)
if a-b>=0:
  print(a-b)
else:
  print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Sandglass2

# X 秒 図れる砂時計がある
# 上のパーツに X[g] 砂がある。　1秒に1[g]砂が落ちる。

# t 秒後に上のパーツに残っている砂は何[g]？

# X t を標準入力から得る
X, t = map(int, input().split())
# print(X, t)

# t <= X の時 X - t
# それ以外は、0 を代入
if t <= X:
    answer = X - t
else:
    answer = 0

# 結果を出力
print(answer)

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:
    answer = x - t
else:
    answer = 0

# 出力
print(answer)

Submission status: Accepted

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

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

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=list(map(int, input().split()))
print(max(X-t,0))

Submission status: Accepted

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

if x - t >= 1:
    print(x - t)
else:
    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())
print(max(x-t, 0))

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
# AにX - t 代入し、　－の値を0に変換
A = X - t
A = max(0, A)
print(A)

Submission status: Accepted

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

if sand_weight > drop_sand_per_second:
    remain_sand = sand_weight - drop_sand_per_second
    print(remain_sand)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

    print(max(0, x-t))


if __name__ == '__main__':
    main()

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(max(x - t, 0))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,t= map(int,input().split())
time = x-t
if time>=0:
  print(time)
else:
  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(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(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())
print(max(0,X-T))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print(x-a if x >= a 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:
#n = int(input())
x, t = map(int, input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
print(max(x-t, 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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    X, t = map(int, readline().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(0)
else:
  print(ans)

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 = (int(x) for x in input().split())
if a < b:
  print (0)
else:
  print (a-b)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]


X,t = map(int, 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())
print(max(0, 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:
X,T=map(int,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 <= 0:
    print(0)
else:
    print(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())
print(max(0, X-t))

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

print(x-t if x>t else "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:
x,y=map(int, input().split())
if x-y <= 0:
    print (0)
else:
    print (x-y)

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())
print(max(0, x-t))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, t = MAP()
print(max([X - t, 0]))

Submission status: Accepted

Solution code:
tmp = input().split(" ")
 
print(max([int(tmp[0]) - int(tmp[1]), 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:
a, b = list(map(int, input().split()))
if a >= b:
  my_result = a - b
else:
  my_result = 0
print(my_result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Time = (int(T) for T in input().split())
print(max(X-Time,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:
x,t = map(int,input().split())
if t <= x:
	print(x-t)
else:
	print(0)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    print(max(X - t, 0))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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(X - t, 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:
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(0 if X-t<0 else 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:
X,t=map(int,input().split())

print(max(X-t,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    x, t = i_map()

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

if __name__ == '__main__':
    main()

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

print(max(x-t, 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())
print(x-t if x>t else 0)

Submission status: Accepted

Solution code:
n,t = map(int,input().split())
print(max(0,n-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())

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:
X, r = list(map(int, input().split())) 

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

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:
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())
print(max(x-t, 0))

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 = map(int, 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:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, t = M()
print(max(0, 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:
x, t = [int(s) for s in input().split()]
print(max(x - t, 0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, t = map(int, input().split())
A = X - t
if A > 0:
    print(A)
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:
  print(0)
else:
  print(x - t)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
if x-t >= 0:
  print(x-t)
else:
  print(0)

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,input().split())
if a>b:
    print(a-b)
else:
    print(0)

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 t <= X:
  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:
def resolve():
    x, t = map(int, input().split())
    ans = x-t

    if x-t < 0:
        ans = 0
    print(ans)
resolve()

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

ans = X-t

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

Submission status: Accepted

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

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())
z = x-t
if x-t > 0:
    print(z)
else:
    print(0)

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,input().split())
print(max(0,a-b))

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(x-t)
else:
  print("0")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(max(eval(input().replace(*' -')),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(0,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:
x,t=map(int,input().split())

print(max(0,x-t))

Submission status: Accepted

Solution code:
import sys
X,t = map(int,input().split())
if X < 0 or t < 0 or X > 10 ** 9 or t > 10 ** 9:
    sys.exit()

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

Submission status: Accepted

Solution code:
x,t = map(int,input().split())
a = x-t
if a >= 0:
    print(a)
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(X-t)
    
if (X-t)<=0:
  	print('0')

Submission status: Accepted

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

rem = X - t

if (X <= t):
    print("0")

else:
    print(rem)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(X, t):
    if X <= t:
        return 0

    return X - t

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

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,t = map(int,list(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())
print(max(0,X-T))

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc072/tasks/abc072_a
# simulation
x, t = map(int, input().split())

print(max(0, x-t))

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:
x,t = list(map(int,input().strip().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:
suna=input().split(" ")

if int(suna[1]) >= int(suna[0]):
	print("0")
else:
	sand= int(suna[0]) - int(suna[1])
	print(str(sand))

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(max(0,a-b))

Submission status: Accepted

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

ans = max(0, X_max - T_s)

print(ans)

Submission status: Accepted

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

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())
result = x - t
if result > 0:
  print(result)
else:
  print('0')

Submission status: Accepted

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