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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

Submission status: Accepted

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

rest = max(x - t, 0)

print(rest)

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

Submission status: Accepted

Solution code:
# coding: utf-8
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())
d=x-t
print(d if d>0 else 0)

Submission status: Accepted

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

Submission status: Accepted

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

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

diff = X - t

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

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

ans = X - t if X > t else 0

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
def main():
  X,t = map(int,input().split())
  print((X-t) if (X-t) >=0 else 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:
	answer = X - t
elif X <= t:
	answer = 0
  
print(answer)

Submission status: Accepted

Solution code:

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

print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

x, t = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 072: A – Sandglass2
x, t = [int(s) for s 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(0)
else:
    print(x-t)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
sand = [int(v) for v in input().split(' ')]

if sand[0] < sand[1]:
  print('0')
  exit(0)
print(sand[0] - sand[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Sun Mar 22 22:02:37 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

x, t = na()

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

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X, t = list(map(int, sys.stdin.buffer.readline().decode().split()))
    print(max(0,X-t))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(max(0,X-t))

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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


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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X, t = list(map(int, sys.stdin.readline().split()))
    print(X-t if X - t >= 0 else 0)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

else:
  print(X-t)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
x, t = map(int,input().split())
print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

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

if t >= X:
    print(0)

else:
    print(X-t)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    x,t=MI()
    print(max(0,x-t))

main()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(x-t, 0))

Submission status: Accepted

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

Submission status: Accepted

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

#----------
X,t = list(map(int, input().rstrip().split()))
#----------
x_out = t

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

Submission status: Accepted

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

print(max(X - t, 0))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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(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())
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:
def sandglass(x , t):

    return x - t if x - t > 0 else 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
C=A-B
if C<0:
	print(0)
else:
	print(C)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 入力 : 数字2つ
x, t = map(int, input().split())

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

Submission status: Accepted

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

print(max(0,x-t))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, H = map(int, read().split())
print(max(N - H,0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = max(X - t, 0)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arr = input().split()
x = int(arr[0])
t = int(arr[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
X,t = [int(i) for i in 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 b < a else 0)

Submission status: Accepted

Solution code:


import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

X, t = num_i

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, t = MAP()

print(max(0, X-t))

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
X,t = [int(x) for x in stdin.readline().rstrip().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(x-t if x-t >= 0 else 0)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,t = 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 else '0')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x, t = map(int, sys.stdin.readline().split())

def main():
    return max(0, x - t)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

stdin = sys.stdin

ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(0, X-t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

x, y = map(int, sys.stdin.readline().split())

print(max(0, x - y))

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

Submission status: Accepted

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

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

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