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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 各秒数を取得
X,t = map(int,input().split())
 
#残りの砂を計算し出力
Remain = X - t
if remain > 0:
    print(Remain)
else:
    print("0")

Submission status: Runtime Error

Solution code:
# 各秒数を取得
X,t = map(int,input().split())
 
#残りの砂を計算し出力
Remain = X - t
if remain > 0:
    print(Remain)
else:
    print(0)

Submission status: Runtime Error

Solution code:
# 入力
x = int(input())
t = int(input())

# 処理
answer = x-t

# 出力
print(answer)

Submission status: Runtime Error

Solution code:
s=list(input())

for i in range(len(s)):
  if i%2==1:
    s.pop(i)
  
ss=''.join(map(str,s))

print(ss)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Cnt = []
cnt = 0
ans = 0
for idx, p in enumerate(P, 1):
    if idx == p:
        Cnt.append(idx)
        cnt += 1
    else:
        cnt = 0
    if cnt == 2:
        ans -= 1
        cnt = 0

ans += len(Cnt)
print(ans)

Submission status: Runtime Error

Solution code:
tmp = input().split(" ")

print(max([tmp[0] - tmp[1], 0]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
	int x, t;
	cin >> x >> t;
	int ans = x - t;
	if (ans < 0) ans = 0;
	cout << ans << endl;
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(input())-int(input()))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

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

print(oddstring)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n=int(input())
alis=list(map(int,input().split()))
xlis=set()
for i in alis:
    xlis.add(i-1)
    xlis.add(i+1)
    xlis.add(i)
#print(xlis)
counter=[0 for _ in range(len(xlis))]
t=-1
for x in xlis:
    t+=1
    for i in range(n):
        if x-1<=alis[i] and alis[i]<=x+1:
            counter[t]+=1
print(max(counter))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
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 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

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

Submission status: Runtime Error

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

A=x-t

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

Submission status: Runtime Error

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

cnt = 0
X=[]
for n in A:
    X.append(n)
    X.append(n-1)
    X.append(n+1)

Y = set(X)

y = list(Y)

for x in y:
    transient = 0
    for a in A:
        if -1 <= a - x <= 1:
            transient += 1
    else:
        if transient > cnt:
            cnt = transient

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X=input()
t=input()
if t>X:
  print "0" 
else:
  print X-t

Submission status: Runtime Error

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

if t >= x:
    print(0)

else:
    print(X-t)

Submission status: Runtime Error

Solution code:
n=int(input())
*p,=map(int,input().split())
order=1
cnt=0
for i in range(n-1):
    if p[i]==i+1:
        p[i],p[i+1]=p[i+1],p[i]
        cnt+=1
if p[n-1]==n:
    p[n-2],p[n-1]=p[n-1],p[n-2]
    cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
print(max(a-b,0))

Submission status: Runtime Error

Solution code:
print(max(0,x-t))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

max = 0

for i in range(N + 1):
  X = i

  new = [l for l in li if l == X or l == (X + 1) or l == (X - 1)]

  if max < len(new):
    max = len(new)

print(new)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
def main():
    n = int(input())
    a = list( map( int, input().split() ) )
    b = set(a)
    b.add(min(b)-1)
    b.add(max(b)+1)

    cnt = [0]*len(b)
    for j in a:
        for i,num in enumerate(b):
            if j-1 == num or j == num or j+1 == num:
                cnt[i] += 1
    print(max(cnt))
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ans = int(input())-int(input())
print(ans if ans>0 else 0)

Submission status: Runtime Error

Solution code:
N = int(input())
P = list(map(int, input().split()))
Q = P.copy()
cnt1 = 0
for i in range(N-1):
    if P[i] == i+1:
        tmp = P[i]
        P[i] = P[i+1]
        P[i+1] = tmp
        cnt1 += 1
if P[-1] == N:
    cnt1 += 1

cnt2 = 0
for i in range(N-1, 0, -1):
    if Q[i] == i+1:
        tmp = Q[i]
        Q[i] = Q[i-1]
        Q[i-1] = tmp
        cnt2 += 1
if Q[0] == 1:
    cnt2 += 1
print(min(cnt1, cnt2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int, input().split()))
a_dict = Counter(a)
keys = a_dict.keys()
max_count = 0
for key in keys:
	tmp_count = 0
	for i in keys:
		if key + 1 == i or key - 1 == i or key == i:
      		tmp_count += a_dict[i]
    if tmp_count > max_count:
    	max_count = tmp_count
print(max_count)

Submission status: Runtime Error

Solution code:
from collections import Counter



def main()->None:
    N = int(input())
    a = list(map(int, input().split()))
    a_dict = Counter(a)
    keys = a_dict.keys()
    max_count = 0
    for key in keys:
        tmp_count = a_dict[key]
        for i in keys:
            if key + 1 == i or key - 1 == i:
                tmp_count += a_dict[i]
        if tmp_count > max_count:
            max_count = tmp_count
    print(max_count)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
from collections import Counter
from typing import List, Set



def main()->None:
    # a_iに１を足すか、１引くか、何もしないかの操作を行って、ある整数個数最大化をする
    # x を決めるとgreedyに決まる。
    # 最後の一つのサンプルがTLEになる。jit の使い方もよくわからん
    N: int = int(input())
    a: List[int] = list(map(int, input().split()))
    set_a: Set[int] = set(a)
    max_count: int = 0
    top = 0
    for a_compo in set_a:
        X: int = a_compo
        tmp_count = 0
        for i in set_a:
            if abs(X - i) <= 1:
                tmp_count += a.count(i)
        if tmp_count > max_count:
            max_count = tmp_count

    print(max_count)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
from collections import Counter

def main()->None:
    # a_iに１を足すか、１引くか、何もしないかの操作を行って、ある整数個数最大化をする
    # x を決めるとgreedyに決まる。
    # どうやってxを決めるのか。
    N = int(input())
    a = list(map(int, input().split()))
    set_a = set(a)
    max_count = 0
    for a_compo in set_a:
        X = a_compo
        tmp_count = 0
        for i in a:
            if abs(X - i) <= 1:
                tmp_count += 1
        if tmp_count > max_count:
            max_count = tmp_count
    print(max_count)

if __name__ == "__main__":
    #import time
    #start = time.time()
    main()
    #print("time:{}".format(time.time() - start))

Submission status: Runtime Error

Solution code:


def main()->None:
    # a_iに１を足すか、１引くか、何もしないかの操作を行って、ある整数個数最大化をする
    # x を決めるとgreedyに決まる。
    # どうやってxを決めるのか。
    N = int(input())
    a = list(map(int, input().split()))
    range_N = range(N)
    counter = {}
    for i in range_N:
        X = a[i]
        tmp_count = 0
        for j in a:
            if j + 1 == X:
                tmp_count += 1
            if j - 1 == X:
                tmp_count += 1
            if j == X:
                tmp_count += 1

            counter[X]=tmp_count

    print(max(counter.values()))



if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections
n = int(input())
a = list(map(int,input().split()))
c = dict(collections.Counter(a))
c = dict(sorted(c.items(),key = lambda x:x[0]))

ans = 0
for i in range(1,10**5):
  cnt = 0
  try:
    cnt += c[i-1]
  except KeyError:
    pass
  
  try:
    cnt += c[i]
  except KeyError:
    pass
    
  try:
    cnt += c[i+1]
  except KeyError:
    pass
    
  ans = max(ans,cnt)  
  
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
P = list(map(int,input().split()))
ans = 0
for i in range(N - 1):
  if P[i] == i+1:
    P[i],P[i+1] = P[i+1],P[i]
    ans += 1
if P[-1] == N:
  ans += 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

N=int(input())

a=[int(t.strip()) for t in input().split()]

num=[]
num= [0] * (max(a)+3)
for i in range(N):
	num[a[i]] += 1
	
maximum=0
for i in range(len(num)-2):
	tmp=num[i] + num[i+1] +num[i+2]
	if maximum < tmp:
		maximum = tmp

print(maximum)		
#print(num)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
nums = list(map(int, input().split()))
cnt = 0
ren = 0
for i in range(N):
  if nums[i] == i+1:
    cnt += 1
    ren += 1
  elif ren > 1:
    cnt -= 1
    ren = 0
  else:
    ren = 0
if ren > 1:
  cnt -= 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;
int main(){
    int X, t;
    cin >> X >> t;
    
    X >= t ? cout << X - t : cout << 0;
    
}

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
cnt=0
for i in range(n):
  if l[i] == i+1:
    change=l[i]
    l[i]=l[i+1]
    l[i+1]=change
    cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#! /Library/Frameworks/Python.framework/Versions/3.7/bin/python3
N = int(input())
a = list(map(int, input().split()))
b = [0] * 100001  # 0から100000まで b[0]:0,b[1]:1…
c = [0] * 99999
for i in range(N):
    b[a[i]] += 1
for i in range(99999):  # 0から99998まで
    c[i] = b[i] + b[i + 1] + b[i + 2]
print(str(max(c)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter
n = int(input())
a = list(map(int, input().split()))

a_c = Counter(sorted(a))
a_v = list(a_c.values())
a_k = list(a_c.keys())
count_max = a_v[0]
for i in range(1, len(a_v)):
    count = 0
    if a_k[i] - a_k[i - 1] == 1: 
        count += a_v[i - 1]
    if i < (len(a_v) - 1) and a_k[i + 1] - a_k[i] == 1:
        count += a_v[i + 1]
    count += a_v[i]
    if count > count_max:
        count_max = count
print(count_max)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

L = [0 for _ in range(10 ** 5 + 2)]

for a in A:
    L[a] += 1

ans = 0
for i in range(1,100001):
    ans = max(ans,L[i-1]+L[i]+L[i+1])

print(ans)

Submission status: Runtime Error

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

print(max(x - t),0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(input()[0:len(s):2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int, input().split()))
values=[]
for i in range(min(a), max(a)+1):
    values.append(a.count(i))
    
max_value=0
for i in range(len(values)-2):
    max_value = max(max_value, values[i]+values[i+1]+values[i+2])
print(max_value)

Submission status: Runtime Error

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

count = 0
for i in range(N-1):
  if p[i] == i+1:
    p[i], p[i+1] = p[i+1], p[i]
    count += 1
if p[N-1] == N:
  p[N-2], p[N-1] = p[N-1], p[N-2]
  count += 1
  
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(max(x-t, 0))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter
n=int(input())
a=list(map(int,input().split()))
b=Counter(a)
t=[]
for _ in b.most_common(100):
  t.append(len([i for i in a if _[0]-1<i<_[0]+3]))
  t.append(len([i for i in a if _[0]-2<i<_[0]+2]))
  t.append(len([i for i in a if _[0]-3<i<_[0]+1]))
print(max(t))

Submission status: Runtime Error

Solution code:
from collections import Counter
n=int(input())
a=list(map(int,input().split()))
b=Counter(a)
t=[]
for _ in b.most_common(10):
  t.append(len([i for i in a if _[0]-1<i<_[0]+3]))
  t.append(len([i for i in a if _[0]-2<i<_[0]+2]))
  t.append(len([i for i in a if _[0]-3<i<_[0]+1]))
print(max(t))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#import sys
#input = sys.stdin.readline
n=int(input())
a=[int(i) for i in input().split()]
maxa=max(a)

#print(a)
ans=0
if n==1:
  ans=1
else:
  for i in range(1,maxa+1):
    cnt=0
    for j in range(len(a)):
      if a[j]==i or a[j]==i-1 or a[j]==i+1:
        cnt+=1
      if ans <= cnt:
        ans = cnt

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections as cl
N = int(input())
a_li = [i for i in input().split()]
c = cl.Counter(a_li)

keys = list(c.keys())
max_sum = 0
if (len(c) == 1) :
    print(1)
elif (len(c) == 2) :
    if (abs(a_li[0] - a_li[1]) <= 1 ) :
        print(2)
    else :
        print(1)
else :
    for k in range(len(c) -2 ) :
        sum_v = c[keys[k]] + c[keys[k+1]] + c[keys[k+2]]
        if (max_sum < sum_v) :
            max_sum = sum_v
    
    print(max_sum)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
X = int(input())
t = int(input())
if X > t:
  print(X - t)
else:
  print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ans = int(input()) - int(input())
if ans < 0:
	print(0)
else:
	print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if x<t:
	ans=0
else
	ans=x-t

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
 
int main(void)
{
  int x,t;
  std::cin >> x >> t;
  x = std::max<int>(0,x-t);
  std::cout << x << std::endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
#include <iostream>

int main()
{
  int x,t;
  std::cin >> x >> t;
  x = std::max<int>(0,x-t);
  std::cout << x << std::endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
x = sys.argv[0]
t = sys.argv[1]
print x - t

Submission status: Runtime Error

Solution code:
import sys
x = sys.argv[0]
t = sys.argv[1]
print X - t

Submission status: Runtime Error

Solution code:
X,t = map(int,rawinput().split)
return X-t

Submission status: Runtime Error

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


possibles = set()
for x in xs:
    possibles.add(x - 1)
    possibles.add(x)
    possibles.add(x + 1)


res = 0
for p in possibles:
    d = 0
    for x in xs:
        c = abs(x - p)
        if c <= 1: d += 1
    if res < d: res = d

print(res)

Submission status: Runtime Error

Solution code:
from collections import Counter

N = int(input())
A = list(map(int, input().split()))

C = Counter(A)

ans = 0
for i in range(max(A)+1):
    ans = max(C[i] + C[i-1] + C[i+1], ans)

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input().split(" ")
print(int(n[0])-int(n[t])

Submission status: Runtime Error

Solution code:
def A_Sandglass2():
    try:
        LOCAL_FLAG
        X = 100
        t = 170
    except NameError:
        X, t = list(map(int, input().split()))

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

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

Submission status: Runtime Error

Solution code:
alphabet="abcdefghijklmnopqrstuvwxyz"
st=input()
s=""
for i in range(0,len(st)):
    if alphabet.index(st[i]) % 2 == 0:
        s+=str(st[i])
    else:
        pass
print(s)

Submission status: Runtime Error

Solution code:
alphabet="abcdefghijklmnopqrstuvwxyz"
st=input()
s=""
for i in range(0,len(st)):
    if alphabet.index(st[i]) % 2 == 0:
        s+=str(st[i])
    else:
        pass

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
x = input()
t = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X = int(input())
t = int(input())

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

Submission status: Runtime Error

Solution code:
X = int(input())
t = int(input())

print(max(X - t, 0))

Submission status: Runtime Error

Solution code:
S = input().split()
if S[0] - S[1] <= 0:
  print('0')
else:
  print(S[0] - S[1])

Submission status: Runtime Error

Solution code:
S = input().split()
d = S[0] - S[1]
if d <= 0:
  print('0')
else:
  print(d)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = map(int, input().split())
d = S[0] - S[1]
if d <= 0:
  print(0)
else:
  print(d)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def oddOut():

s = str(input())
print(s[::2])
        
 
pddOut()

Submission status: Runtime Error

Solution code:
from collections import Counter
#Nをセットする
N = int(input())
#aiをセットする
a = list(map(int,input().split()))
a_mai = []
a_pura = []
#ai +- 1したものを作る
for i in range(len(a)):
    #+1したもの
    a_pura.append(a[i] + 1)
    #-1したもの
    a_mai.append(a[i] - 1)
#aiそのままの重複の数
count_a = Counter(a)
#ai + 1重複の数
count_a_pura = Counter(a_pura)
#ai - 1の中腹の数
counter_a_mai = Counter(a_mai)
#一番大きい要素を取得
max_a = count_a.most_common()[0][1]
max_a_pura = count_a_pura.most_common()[0][1]
max_a_mai = counter_a_mai.most_common()[0][1]

#3つの最大値を求める
max = max_a
if max_a_pura >= max:
    max = max_a_pura
if max_a_mai >= max:
    max = max_a_mai
print(max)