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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    x, t = LI()
    print(max(0, x-t))
    
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    n = I()
    print(n*800-200*(n//15))

#B
def B():
    k = I()
    ans = 0
    for i in range(1,k):
        for j in range(i+1,k+1):
            if (i%2)^(j%2):
                ans += 1
    print(ans)

#C
def C():
    x,t = LI()
    print(max(0,x-t))

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

def J():
    return

def K():
    return

#Solve
if __name__ == "__main__":
    C()

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
print(max(n - m, 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:
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001



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

print("%d"%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 = (int(i) for i in input().split())

print(max(x-t, 0))

Submission status: Accepted

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

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 = x - t

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t=[int(i) for i in 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 print(0)

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

Submission status: Accepted

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

ans = max(0, X - t)

print(ans)
print()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

  if (x-a) <= 0:
    print(0)
    return
  print(x-a)
  return

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


abc072_a()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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()]
print(max(x-t,0))

Submission status: Accepted

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

result = max(X - t, 0)

print(result)

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

Submission status: Accepted

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

Submission status: Accepted

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

else:
    print('0')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().strip().split(" ")

b=[int(i) for i in a]

c=b[0]-b[1]

if(c<=0):
    print("0")
else:
    print(c)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0, x-t))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if X<t:
     print(0)
else:
     print(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:
#coding: utf-8
X, t = map(int, input().split())
print([X-t, 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(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:
l = list(map(int, input().split()))
s = l[0]-l[1]
if(s < 0):
    s = 0
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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
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:
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(0, X - t)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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:
print(max(0,eval(input().replace(" ","-"))))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


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

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

print(max(0, X-T))

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    X, t = li_input()

    print(max(X - t, 0))


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n[0]-n[1]>0):
  print(n[0]-n[1])
else:
  print(0)

Submission status: Accepted

Solution code:
l = [int(x) for x in raw_input().split()]
print max(0, l[0] - l[1])

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if B>=A:
 print('0')
else:
 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]=[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,raw_input().split())
print max(0,x-t)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y = (int(i) for i in input().split());print(max(0,x-y))

Submission status: Accepted

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

print(result if result>=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:
a,b=map(int,input().split())
if a>b:
    print('{}'.format(a-b))
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 = (int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
x, t = list(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)>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:
inX,inT = list(map(int,input().split()))
if inX - inT > 0:
  print(inX - inT)
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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def calc(x, t):
	if x < t: return 0
	else: return x - t

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
print(x[0] - x[1] if x[0] - x[1] > 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:
#coding utf-8

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

if(sand[0] > sand[1]):
    print(sand[0] - sand[1])
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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