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: Wrong Answer

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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

print(s[::2])

Submission status: Wrong Answer

Solution code:
s = input()

print(s[:2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(eval(input().replace(*" -")))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a-b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
print(S[::2])

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
# 各秒数を取得
X,t = map(int,input().split())

#残りの砂を計算し出力
Remain = X - t
print(Remain)

Submission status: Wrong Answer

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

# 処理
answer = x-t

# 出力
print(answer)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input()[::2])

Submission status: Wrong Answer

Solution code:
s = input()

oddstring = s[0]
a = ((len(s) + 1) // 2) - 1

for i in range(a):
    oddstring += s[2*i+2]

print(oddstring)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(x-t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(x-t)

Submission status: Wrong Answer

Solution code:
input = str(input())

word = [x for x in input]
word = word[::2]

output = ""
for i in word:
  output += i
  
print(output)

Submission status: Wrong Answer

Solution code:
input = str(input())

word = [x for x in input]
word = word[::2]

print(word)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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 accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

X, t = MAP()

print(X-t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=eval(input().replace(" ","-"));print(min(0,k))

Submission status: Wrong Answer

Solution code:
s = list(input())
l = []
for i,j in enumerate(s):
    if i%2==0:
        l.append(j)
print(''.join(l))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

answer = X - t

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
str=input()
ans=[]
head,end=0,0
flag = False

for i,val in enumerate(str):
	if val=='A':
		head=i
		ans.append(val)  
		flag=True
		continue
	if val is not 'Z'and flag==True:
		ans.append(val)
		end=i
		continue
	elif val is 'Z' and flag==True:
		break
answer= ''.join(ans)
print(len(answer[head:end])+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input()[::2])

Submission status: Wrong Answer

Solution code:
n = input()
print(n[::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=(int(x) for x in input().split())
for i in range (b):
  a=a-1
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(r))

Submission status: Wrong Answer

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

X, t = num_i

print(X-t)

Submission status: Wrong Answer

Solution code:
s=input()
li = []

for index, i in enumerate(s):
  if (index + 1) % 2 == 0:
    continue
  li.append(i)

print("".join(li))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

s_odd = [c for i, c in enumerate(S) if i % 2 == 0]

print(''.join(s_odd))

Submission status: Wrong Answer

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

print(x-t)

Submission status: Wrong Answer

Solution code:
##### 解けた #####

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

print(X-t)

Submission status: Wrong Answer

Solution code:
n = list(input())
if "9" in n:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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


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

examA()

Submission status: Wrong Answer

Solution code:
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        #print(array)

print("".join(array),end="")

Submission status: Wrong Answer

Solution code:
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        #print(array)
 
print("".join(array),end="")

Submission status: Wrong Answer

Solution code:
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        #print(array)
 
print("".join(array))

Submission status: Wrong Answer

Solution code:
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        #print(array)

print("".join(array))

Submission status: Wrong Answer

Solution code:
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])

print("".join(array))

Submission status: Wrong Answer

Solution code:
S = input()
n = len(S)//2
#与えられた文字列をリスト化し分割
lst = list(S)

array = []
for i in range(n):
    array.append(lst[2*i+1])

new_lst = "".join(array)
print(new_lst, end = "")

Submission status: Wrong Answer

Solution code:
S = input()
n = len(S)//2
#与えられた文字列をリスト化し分割
lst = list(S)

array = []
for i in range(n):
    array.append(lst[2*i+1])

new_lst = "".join(array)
print(new_lst)

Submission status: Wrong Answer

Solution code:
#2019/10/03
X, t = map(int, open(0).read().split())
print(X - t)

Submission status: Wrong Answer

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

print(X-t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

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

x, t = na()

print(abs(x - t))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
N=len(s)
ans=""

for i in range(0, N, 2):
    ans+=s[i]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(X-t)

Submission status: Wrong Answer

Solution code:
s = input()
print(s[::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b = map(int, input().split())
print(math.ceil((a + b) / 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = input().split()
print(int(num[0])-int(num[1]))

Submission status: Wrong Answer

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

print(X-t)

Submission status: Wrong Answer

Solution code:
s = input()
num = len(s)
newl = []

for i in range(0,num,2):
    newl.append(s[i])
ans = "".join(newl)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(x-t)

Submission status: Wrong Answer

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

print(X-t)

Submission status: Wrong Answer

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

print(x - t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


x, y = inl()
print(x-y)

Submission status: Wrong Answer

Solution code:
# ABC072A - Sandglass2
x, t = list(map(int, input().rstrip().split()))
print(x - t)

Submission status: Wrong Answer

Solution code:
print(input()[:2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
MOD = 10 ** 9+7
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


X, t = mi()
print(X-t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
print(s[::2])

Submission status: Wrong Answer

Solution code:
s = input()
print(s[::1])

Submission status: Wrong Answer

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

print(min(x-t, 0))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())
result = ""
for i in range(len(s)):
    if i % 2 != 0:
        result += s[i]
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

for x in range(0,len(s),2):
  print(s[x])

Submission status: Wrong Answer

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

print(x - t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=list(input())
s=s[::2]
print("".join(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


abc072_a()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(x - t)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
print((A + B) % 24)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

ans = ""
for i in range(len(s)):
	if i % 2 == 0:
		ans += s[i]
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()

ans = ""
for i in range(len(s)):
	if i%2 == 0:
		ans += s[i]
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
ans = ""
for i in range(len(s)):
	if i%2 == 0:
		ans += s[i]
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
ans = ""
for i in range(len(s)):
   if i%2 == 0:
     ans += s[i]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = raw_input().split()
x = l[0]
t = l[1]
print int(x) - int(t)

Submission status: Wrong Answer

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

print(a-b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Here your code !
str =""
i =1
for j in input():
    if i%2==1:
        str+=j
    i+=1
print(str)

Submission status: Wrong Answer

Solution code:
s=raw_input()
slen=len(s)
count=0
os=""
for i in range(int(slen/2)):
    os=os+s[count]
    count+=2
print(os)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#文字列をセット
str = input()
flag = 0
result = "None"
#小文字のアルファベットをセット
for s in str:
    for i in range(97, 97+26):
        if flag == 0:
            if  chr(i) == s:
                result = chr(i)
                flag = 1
        else:
            break
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(X-t)

Submission status: Wrong Answer

Solution code:
s=str(input())
x=list(s)
out=""
for i in range(len(x)):
	if i % 2 ==0:
		out+=x[i]
print(out)

Submission status: Wrong Answer

Solution code:
input_line1 = input()
c = 1
p = ""
for v in input_line1:
    if c == 1:
        p += v
        c = 0
    else:
        c += 1
print(p)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
hoge =list(s)

moji = ''

for num in range(len(s)):
    if num%2 == 0:
        moji += hoge[num]
    continue

print(moji)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
r=""
for i in range(len(s)):
    if i%2==0:
        r+=s[i]
print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print X-t

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

X, t = map(int, input().split(' '))
ans = X - t
print(ans)

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

Solution code:
a,b=(int(x) for x in input().split())
for i in range (b):
  a=a-1
  if a==0:
    break
print(a)

Submission status: Time Limit Exceeded

Solution code:
X, t = map(int,input().split())
r = 0
cont = 0
while X > 0 and cont < t :
    X = X - 1
    cont = cont + 1
    
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:
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(max(x-t, 0))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = input().split()

d = int(lst[0]) - int(lst[1])

if 0 <= d:
   print(d)
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秒を測れる砂時計があります。
# はじめ上のパーツに砂が X[g] あり、1秒間に 1[g] 砂が落ちます。
# なお、上のパーツにもう砂が残っていない場合は砂は落ちません。
# t秒後に上のパーツに残っている砂は何gでしょう。

# x（秒）、t（秒後）：標準入力（数値）
x,t = map(int, input().split())

# x>tの時、砂が残っている x-tが存在する
# x<=tの時、砂は残っておらず砂は落ちない
weight = 0
if x > t:
    weight = x - t
else:
    weight = 0

print(weight)

Submission status: Accepted

Solution code:
X,t = list(map(int,input().split()))
print(max(X-t,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:
# 072_a
X,t=map(int,input().split())
if (1<=X and X<=10**9) and (1<=t and t<=10**9):
    if X<=t:
        print(0)
    else:
        print(X-t)

Submission status: Accepted

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

def answer(x: int, t: int) -> int:
    if x > t:
        return x - t
    else:
        return 0

print(answer(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:
print(max(eval(input().replace(*" -")),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:
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())
f = lambda x: x if x > 0 else 0
print(f(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(X-t,0))

Submission status: Accepted

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

Submission status: Accepted

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

answer = x - t

if answer <= -1:
    print(0)
else:
    print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

    print(max(0, x - t))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max(X-t, 0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# abc072 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """100 17"""
        output = """83"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """48 58"""
        output = """0"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1000000000 1000000000"""
        output = """0"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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


print(max(x-t,0))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    print(max(0, x - t))


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

Submission status: Accepted

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

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

Submission status: Accepted

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