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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

rest = X - t

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

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:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    x,t=MI()
    print(max(x-t,0))
main()

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 
print(answer if answer >= 0 else 0)

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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

m = x-t

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

print(max(rest, 0))

Submission status: Accepted

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

if rest < 0:
    rest = 0

print(rest)

Submission status: Accepted

Solution code:
# ABC072a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

print(max(x-t, 0))

Submission status: Accepted

Solution code:
import sys

def main():
    X, t = map(int, sys.stdin.readline().split())
    ans = max(0, X - t)
    print(ans)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

ans = max(0, X - t)

print(ans)

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:
from sys import stdin
import math
import numpy as np
import itertools

a,b = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
#a = int(input())
# スペース区切りの整数の入力
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,t=map(int,input().split())
print(max(0,a-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 = list(map(int, input().split(" ")))
print(max(0, a[0]- a[1]))

Submission status: Accepted

Solution code:
def examA():
    X, t = LI()
    ans = max(X-t,0)
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

k = x - t

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#72a
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(0)
else:
  print(X - t)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
x, t = (int(i) for i in sys.stdin.readline().split())
print(x - t if x > t else 0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A - Sandglass2
x, t = [int(s) for s in input().split()]
print(x - t if t <= x 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:
# -*- 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, 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:
N,t = (int(x) for x in input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
# ABC074 A - Sandglass2
X,t = map(int,input().split())

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

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
X=a[0]
t=a[1]
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(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(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:
#2019/10/03
X, t = map(int, open(0).read().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())
if(X < t):
    print("0")
else:
    print(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:
def slove():
    import sys
    input = sys.stdin.readline
    x, t = list(map(int, input().rstrip('\n').split()))
    print(max(x - t, 0))


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    x,t=INTM()
    if x>=t:
        print(x-t)
    else:
        print('0')
if __name__ == '__main__':
    do()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
A,B = [int(x) for x in input().split()]
print(max(A-B,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:
s=list(input().split())
x=int(s[0])
t=int(s[1])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Z = X - t

if Z >= 0 :
    print(Z)

else:
    print(0)

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
x,t=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>0 else print (0)

Submission status: Accepted

Solution code:
x,t=map(int,input().split());print([x-t,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:
import sys
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

x, t = na()

print((x - t) if x > t 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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

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:
N = input().split()
X, t = int(N[0]), int(N[1])
if X - t > 0:
    print(X - t)
else:
    print(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())
print(x - t if x - t > 0 else 0)

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

x, t = na()
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(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, t = map(int, input().split())

print(max(x - t, 0))

Submission status: Accepted

Solution code:
x = [int(_) for _ in input().split()]
print(0 if x[0] <= x[1] else x[0] - x[1])

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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

Submission status: Accepted

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



if __name__ == '__main__':
    print(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 = 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)
elif x - t < 0:
  print(0)
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())
r = max(0, X-1*t)
print(r)

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:
a,b = list(map(int, input().split()))
print(max(a-b,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 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:
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 print("0")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

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())
print(x - t if x >= t 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:
# -*- coding: utf-8 -*-S
X,t = [int(i) for i in 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:
print(max(0, eval(input().replace(' ', '-'))))

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 = [int(i) for i in input().split()]
ans = max([x-t,0])

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

print(max(X-t, 0))

Submission status: Accepted

Solution code:
print(max(eval(input().replace(" ", "-")), 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(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:
S=list(map(int,input().split()))
print(max(0,S[0]-S[1]))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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())
print(0 if X-t < 0 else 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())
if x-t<=0:
    s=0
    print(s)
else:
    s=x-t
    print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC073
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)
elif x-t<=0:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

nA = X - t

if nA < 0:
  nA = 0

print(nA)

Submission status: Accepted

Solution code:
#72

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,t=[int(x) for x 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:
num = input().split()
ans = int(num[0])-int(num[1])
print(ans) if ans>0 else print('0')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(X: int, t: int):
    print(max(X-t, 0))
    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 > 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())
print("0" if x-t<=0 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 = [int(x) for x in input().split()]

print(max(X - t, 0))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    X, t = inputMap()
    
    print(max(0, X-t))
    
    
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 = (int(i) for i in 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,y = map(int,input().split())
if x <= y :
  print(0)
else:
  print(x-y)

Submission status: Accepted

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