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())
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:
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())
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 X <= t:
    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())

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

x = int(arr_data[0][0])
t = int(arr_data[0][1])

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

In_data=list(map(int,input().split()))
if In_data[0]>In_data[1]:
    print(In_data[0]-In_data[1])
else :print("0")

Submission status: Accepted

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

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

Submission status: Accepted

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

# AtCoder Beginner Contest
# Problem A

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

    result = X - t

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
X, t = map(int, input().rstrip().split())
if X > t:
    print(X - t)
else:
    print(0)

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=[int(i) for i in input().split()]

print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
g = list(map(int, input().split()))
if g[0] - g[1] >= 0:
    print(g[0] - g[1])
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 = [int(n) for n in input().split()]
print(0 if X < t else X - t)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_lines = input()

num_list = list(map(int, input_lines.split(' ')))

dif = num_list[0] - num_list[1]
ans = dif if dif >= 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:
x, t = list(map(int, input().split()))
print(max(0, x - t))

Submission status: Accepted

Solution code:
l = raw_input().split()
x = l[0]
t = l[1]
if int(x) - int(t) > 0:
    print int(x) - int(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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



def main():
    X, T = map(int, input().split())

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

if __name__ == "__main__": main()

Submission status: Accepted

Solution code:
import numpy as np
import pdb

def main():
    [X,t] = map(int, raw_input().split(' '))
    print sandglass(X,t)

def sandglass(X,t):
    value = np.max([X-t, 0])
    return value

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

b=int(a[0])-int(a[1])

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

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());ans=int(0)
ans = int(X)-int(t)
print([ans,0][ans<=0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

Submission status: Accepted

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

Submission status: Accepted

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


solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
X = a[0]
t = a[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input().split()
num = [int(x) for x in num]

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

Submission status: Accepted

Solution code:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
a=i2()
g=a[0]-a[1]
if g<0:
 print(0)
else:
 print(g)

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, raw_input().split())    
print max(X - t, 0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
import itertools
import time

# # A - Sandglass2
# #
# #
def A_Sandglass2():
    try:
        LOCAL_FLAG
        X = 100
        t = 170
    except NameError:
        X, t = list(map(int, input().split()))

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

start = time.time()
A_Sandglass2()
elapsed_time = time.time() - start
try:
    LOCAL_FLAG
    print ("elapsed_time: {0}".format(elapsed_time) + "[sec]")
except NameError:
    pass

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
if l[0] - l[1] <= 0:
  print('0')
else:
  print(l[0] - l[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())
s = X-t

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

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())
Y = max(0, X - t)
print(Y)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


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

    return max(x-t,0)


print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    X, t = [int(i) for i in input().split()]
    #print(X)
    #print(t)
    
    ans = X - t
    
    if(ans < 0):
        ans = 0
        
    print(ans)
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


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


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:
# -*- encoding: utf-8 -*-
x, t = map(int, input().rstrip().split(' '))

print(max(0, x - 1 * t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os 
a,b = os.read(0,100).split(b' ')
a = int(a.decode())
b = int(b.decode())
os.write(1,str(max(a-b,0)).encode())

Submission status: Accepted

Solution code:
import os 
a,b = os.read(0,100).split(b' ')
a = int(a.decode())
b = int(b.decode())
print(max(a-b,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:
#ABC072A

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#砂時計の砂X(秒)をセット #測った時間tをセット
X , t = map(int,input().split())
#残り時間を表示 (X - t)
#X > tのとき
if X > t:
    time = X - t
#X <= tのとき
else:
    time = 0
print(time)

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:
# coding: utf-8

s = input().split()

x = int(s[0])
t = int(s[1])

if (x - t) < 0 : 
    print(0) 
else :
    print(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:
def read(): return list(map(int, input().split()))

x, t = read()
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,raw_input().split())
if x < t:
    print 0
else:
    print x - t

Submission status: Accepted

Solution code:
X, t = map(int, raw_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(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:
if __name__ == '__main__':
    x, t = list(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:
# -*- 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(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = map(int,raw_input().strip().split(" "))

result = a[0] - a[1]

if result >= 0:
    print result
else:
    print 0

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    X, t = [int(i) for i in input().split()]
    if X - t < 0:
        print(0)
    else:
        print(X - t)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
#ABC072A

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

Submission status: Accepted

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

"""



if __name__ == '__main__':
    start, elapse = [int(x) for x in input().split(' ')]
    if elapse > start:
        print('0')
    else:
        print('{}'.format(start - elapse))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a =  map(int, raw_input().strip().split())
ans = a[0] - a[1]
if ans > 0:
	print(ans)
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, y = list(map(int, input().split()))
print(x-y if x-y > 0 else 0)

Submission status: Accepted

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

if a[0]-a[1]>=0:
  print a[0]-a[1]
else:
  print 0

Submission status: Accepted

Solution code:
x, t = map(int, raw_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) < 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(str(X - t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
a1=l[0]-l[1]
if a1>0:
    print(a1)
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:
X, t = list(map(int, input().split(' ')))
print(X - t if (X - t) >= 0 else 0)

Submission status: Accepted

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

a()

Submission status: Accepted

Solution code:
x,t=(int(i) for i in input().split())
d=x-t
if d<0:
    d=0
print(d)

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

g = X - t

if g >= 0:
    print(g)
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:
#coding:utf-8

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

print (max(0, X - t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a, b = map (int, sys.stdin.readline().split())
print (max (0, a - b))

Submission status: Accepted

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

Rest = X - t
if Rest < 0:
  Rest = 0

print(Rest)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

print(ans)

Submission status: Accepted

Solution code:
l = input().split()
x = int(l[0])
t = int(l[1])
y = x - t
if y > 0:
	print('{0}'.format(y))
else:
	print('0')

Submission status: Accepted

Solution code:
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

x, t = read_line(int, int)

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

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('a1.in')


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


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


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    x, t = read_int_list()
    res = x - t
    if res > 0:
        print(res)
    else:
        print('0')


main()

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,raw_input().split(' '))

r=X-t

if r<0:
    print 0
else:
    print r

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        X, t = map(lambda x: int(x), line.rstrip("\n").split(" ", 2))
        if X - t < 0:
            print(0)
        else:
            print(X - t)

if __name__ == "__main__":
    main(sys.argv)

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

Submission status: Accepted

Solution code:
k = input()
l = k.split()

x = int(l[0])
t = int(l[1])

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

Submission status: Accepted

Solution code:
nm = input().strip().split(' ')
n = int(nm[0])
m = int(nm[1])
        
r = n- m
        
if r < 0:
    r =0
print(r)

Submission status: Accepted

Solution code:
def main():
    X, T = map(int, input().split())

    weight = X - T if X - T > 0 else 0
    print(weight)

main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

print(str(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def A_Sandglass2(X, t):
    return max(X - t, 0)

X,t = [int(i) for i in input().split()]
print(A_Sandglass2(X, t))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp=map(int, raw_input().split(" "))
if tmp[0]<tmp[1]:
    print 0
else:
    print tmp[0]-tmp[1]

Submission status: Accepted

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



print(max(0,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:
from sys import stdin
n,x = map(int,stdin.readline().split())
print max(0,n-x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!usr/bim/python
#! -*- coding: utf-8 -*-

xg = raw_input()
xg = xg.split()
x,g = map(int,xg)

ans = x-g

if ans < 0:
    ans = 0

print ans

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

res = X -t

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

Submission status: Accepted

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

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(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:
# encoding: "utf-8"

class Stdin:
    @staticmethod
    def read_line(converter=str):
        return [converter(x) for x in input().split()]
    
    @staticmethod
    def read_lines(n, converter=str):
        result = list()
        for _ in range(n):
            result.append(Stdin.read_line(converter))
        return result
    
    @staticmethod
    def convert(data, converter):
        assert(len(data) == len(converter))
        return tuple(map(lambda x, f: f(x), data, converter))

    @staticmethod
    def convert_lines(datas, n, converter):
        return [converter(data, n, converter) for data in datas]


def main():
    x, t = Stdin.read_line(converter=int)
    r = x - t
    if r < 0:
        r = 0
    print(r)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
X, t = map(int, raw_input().split(' '))
print max(0, X-t)

Submission status: Accepted

Solution code:
temp = input().split(" ")
suna = int(temp[0])
time = int(temp[1])
ans = suna - time
if ans <= 0:
    ans = 0
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
def get_ln_inputs():
    return input().split()


def get_ln_int_inputs():
    return list(map(int, get_ln_inputs()))


def main():
    X, t = get_ln_int_inputs()
    print(max(0, X - t))
    return


main()

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
s = input()
 
N = len(s)
result = []
 
for i in range(0, N):
    if i == 0 or i % 2 == 0:
        result.append(s[i])
 
s = ''
N = len(result)
 
for i in range(0, N):
    s += result[i]
 
print(s)
s = input()

N = len(s)

Submission status: Runtime Error

Solution code:
s = input()
for i in range(0, len(s), 2):
  print(s[i], end = "")
s = input()
for i in range(0, len(s), 2):
  print(s[i], end = "")

Submission status: Runtime Error

Solution code:
s = input()
for i in range(0, len(s), 2):
  print(s[i], end = ' ')
s = input()
for i in range(0, len(s), 2):
  print(s[i], end = ' ')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
print(max(0,int(input())-int(input())))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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