input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
x = [int(x) for x in input().split()]
N = x[0]
A = x[1]
B = x[2]
ans = 0
for i in range(N):
i = i+1
to_int = [int(i) for i in list(str(i))]
X = sum(to_int)
if (X >= A) & (X <= B) :
ans += i
print(ans) | x = [int(x) for x in input().split()]
N = x[0]
A = x[1]
B = x[2]
def check(x):
ans = 0
while x >= 10:
ans += x%10
x = x//10
ans += x
return ans
ans1 = 0
for i in range(N):
i = i+1
if (check(i) >= A) & (check(i) <= B):
ans1 += i
print(ans1) | p03478 |
n,a,b = [int(i) for i in input().split()]
ans = int(0)
#range(a,b,c)はstart:a,end:b-1,step:cである。注意。
for i in range(1,n+1):
# h = i//100
# l,m = divmod(i%100,10)
# p = h+l+m
p = sum(int(j) for j in str(i))
if a <= p <= b:
ans += i
print(ans) | n,a,b = [int(i) for i in input().split()]
ans = 0
#range(a,b,c)はstart:a,end:b-1,step:cである。注意。
for i in range(1,n+1):
# h = i//100
# l,m = divmod(i%100,10)
# p = h+l+m
p = sum(int(j) for j in str(i))
if a <= p <= b:
ans += i
print(ans) | p03478 |
n,a,b=input().split()
n,a,b=int(n),int(a),int(b)
m=len(str(n))
'''
c=0
if n==10**4 and A==1:
c=1
k=len(str(n))
for i in range(k):
'''
c=0
for i in range(n):
#map関数はクソ便利
if a <= sum(list(map(int, str(i+1)))) <= b:
c+=i+1
print(c)
| n,a,b=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
s=0
j=i
while j!=0:
s+=(j%10)
j//=10
if a<=s<=b:ans+=i
print(ans) | p03478 |
from collections import deque
from sys import stdin
def main():
height, width = list(map(int, stdin.readline().split()))
q = deque([])
grid = []
for i in range(height):
now = list(stdin.readline())
for j in range(width):
if now[j] == "#":
q.appen... | from collections import deque
from sys import stdin
def main():
height, width = list(map(int, stdin.readline().split()))
q = deque([])
grid = [stdin.readline() for _ in range(height)]
distance = [[-1 for _ in range(width)] for _ in range(height)]
for i in range(height):
for j in ... | p03053 |
from collections import deque
h, w = list(map(int, input().split()))
d = deque()
op = [[-1] * w for i in range(h)]
for i in range(h):
s = input().rstrip()
for j in range(len(s)):
if s[j] == '#':
d.append((i, j, 0))
while d:
i, j, step = d.popleft()
if op[i][j] !=... | from collections import deque
h, w = list(map(int, input().split()))
d = deque()
op = [[-1] * w for i in range(h)]
for i in range(h):
s = input().rstrip()
for j in range(len(s)):
if s[j] == '#':
d.append((i, j, 0))
op[i][j] = 0
while d:
i, j, step = d.pople... | p03053 |
def main():
from collections import deque
from array import array
s,*c=open(0)
h,w=list(map(int,s.split()))
f=array('h',[-1]*h*w)
q=deque()
for i,c in enumerate(''.join(t[:w]for t in c)):
if c=='#':
q.append(i)
f[i]=0
while q:
i=q.popleft()
v=f[i]+1
j,k,l,m=i+w,... | def main():
from collections import deque
s,*c=open(0)
h,w=list(map(int,s.split()))
f=[-1]*h*w
q=deque()
for i,c in enumerate(''.join(t[:w]for t in c)):
if c=='#':
q.append(i)
f[i]=0
while q:
i=q.popleft()
v=f[i]+1
j,k,l,m,u=i+w,i-w,i+1,i-1,i%w
if h*w>j and f[... | p03053 |
import sys
readline = sys.stdin.readline
H,W = list(map(int,readline().split()))
grid = [None] * H
dist = [[2000] * W for i in range(H)]
from collections import deque
q = deque([])
for i in range(H):
grid[i] = readline().rstrip()
for j in range(len(grid[i])):
if grid[i][j] == "#":
q.append(... | import sys
readline = sys.stdin.readline
H,W = list(map(int,readline().split()))
grid = [None] * H
dist = [[2000] * W for i in range(H)]
from collections import deque
q = deque([])
for i in range(H):
grid[i] = readline().rstrip()
for j in range(len(grid[i])):
if grid[i][j] == "#":
q.append(... | p03053 |
x = int(eval(input()))
print((0 if x == 1 else 1)) | x = int(eval(input()))
print((1-x)) | p02552 |
x = int(eval(input()))
print((1-x)) | print((1-int(eval(input())))) | p02552 |
x = int(eval(input()))
if x == 1:
print((0))
else:
print((1))
| if int(eval(input())):
print((0))
else:
print((1)) | p02552 |
a = int(eval(input()))
print(("1" if(a == 0) else "0")) | print((1^int(eval(input())))) | p02552 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
if N == 0:
print((1))
else:
print((0))
if __name__ == '__main__':
main()
| n= int(eval(input()) )
print(( 1^ n )) | p02552 |
n=int(eval(input()))
if (n==1):
print((0))
else:
print((1)) | print((1-int(eval(input())))) | p02552 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def I(): return int(sys.stdin.readline().rstrip())
print((1-I()))
| p02552 |
print((1-int(eval(input())))) | import math
print((1-math.ceil(math.sin(int(eval(input())))))) | p02552 |
x=int(eval(input()))
if(x==1):
print((0))
elif(x==0):
print((1))
| print((int(not(int(eval(input())))))) | p02552 |
a = int(eval(input()))
print((1 if a == 0 else 0)) | def _print():
a = int(eval(input()))
print((1 if a == 0 else 0))
if __name__ == '__main__':
_print()
| p02552 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x = int(readline())
if x == 1:
print((0))
else:
print((1))
if __name__ == '__main__':
main()
| x = int(eval(input()))
if x == 1:
print((0))
else:
print((1)) | p02552 |
# -*- coding: utf-8 -*-
# 標準入力を取得
x = int(eval(input()))
# 求解処理
ans = int()
if x == 0:
ans = 1
else:
ans = 0
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
x = int(eval(input()))
return x
def main(x: int) -> None:
"""
メイン処理.
Args:\n
x (int): 整数(0 <= x <= 1)
"""
# 求解処理
ans = 1 - x
# 結果出力
... | p02552 |
x = int(eval(input()))
if x == 0:
print((1))
else:
print((0)) | x = int(eval(input()))
print((x^1))
| p02552 |
print(('10'[int(eval(input()))])) | import sys
print(('10'[int(sys.stdin.buffer.readline())])) | p02552 |
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().split()))
def li(): return list(map(int, input().split()))
x = ii()
print((0 if x == 1 else 1))
| print((int(not int(eval(input())))))
| p02552 |
a = int(eval(input()))
print((int(not a))) | print((int(not int(eval(input()))))) | p02552 |
# AtCoder Beginner Contest 178
# A - Not
x=int(eval(input()))
if x==1:
print((0))
else:
print((1)) | print((int(eval(input()))^1)) | p02552 |
x = int(eval(input()))
print((1 - x))
| x = int(eval(input()))
print((x ^ 1))
| p02552 |
x = int(eval(input()))
if x == 1:
print("0")
else:
print("1")
| x = int(eval(input()))
print((x^1)) | p02552 |
x = int(eval(input()))
if x == 0:
print('1')
else:
print('0')
| x = int(eval(input()))
print((x ^ 1))
| p02552 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
x = ni()
print((1 if x==0 else 0)) | print((1-int(eval(input())))) | p02552 |
x = int(eval(input()))
if x == 0:
print((1))
else:
print((0)) | print((1-int(eval(input())))) | p02552 |
x=int(eval(input()))
if x==1:
print("0")
elif x==0:
print("1") | x=int(eval(input()))
if x==1:
print((0))
else:
print((1)) | p02552 |
x = int(eval(input()))
if x == 1:
print("0")
elif x == 0:
print("1") | N = int(eval(input("")))
print((1-N)) | p02552 |
x = int(eval(input()))
ans = 1 if x == 0 else 0
print(ans)
| print((1 if int(eval(input())) == 0 else 0))
| p02552 |
x = int(eval(input()))
print(([1, 0][x])) | print((int(eval(input()))^1)) | p02552 |
x=int(eval(input()))
if x==0:
print("1")
else:
print("0") | x=int(eval(input()))
if x==1:
print("0")
else:
print("1") | p02552 |
ans = [1, 0]
print((ans[int(eval(input()))])) | print((0 if bool(int(eval(input()))) else 1)) | p02552 |
n = int(input())
S = []
for _ in range(n):
S += [list(input())]
t = list('abcdefghijklmnopqrstuvwxyz')
count = []
x = 0
for i in t:
x += 1
# print (i, x)
tmp = 50
for j in S:
tmp = min(tmp, j.count(i))
count += [tmp]
# print (count)
for k in range(26):
for l in rang... | import sys
# input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
N = int(input())
lst = [50] * 26
for _ in range(N):
S = list(input())
tmp = [0] * 26
for s in S:
tmp[ord(s) - ord('a')] += 1
for i in range(26):
lst[i] = min(lst[i], tmp[i])
for i ... | p03761 |
n = int(eval(input()))
G = []
for _ in range(n):
S = list(input().strip())
C = {}
for i in range(len(S)):
x = S[i]
if x not in C:
C[x] = 0
C[x] += 1
G.append(C)
A = {}
for i in range(97,123):
flag = 0
cmin = 50
for C in G:
if chr(i)... | n = int(eval(input()))
S = [input().strip() for _ in range(n)]
C = {chr(i):0 for i in range(97,123)}
for i in range(len(S[0])):
C[S[0][i]] += 1
for j in range(1,n):
C1 = {chr(i):0 for i in range(97,123)}
for i in range(len(S[j])):
C1[S[j][i]] += 1
for i in range(97,123):
C[chr(... | p03761 |
import sys
def 解():
iN = int(eval(input()))
aS = [_.rstrip() for _ in sys.stdin.readlines()]
def buildDic(s):
d = {}
aABC = sorted(set(list(s)))
for es in aABC:
d[es]= s.count(es)
return d
d0 = buildDic(aS[0])
for s in aS[1:]:
aABC = so... | import sys
def 解():
iN = int(eval(input()))
aS = [_.rstrip() for _ in sys.stdin.readlines()]
sABC = "abcdefghijklmnopqrstuvwxyz"
iL = len(sABC)
aC = [0]*iL
for i in range(iL):
aC[i] = aS[0].count(sABC[i])
for s in aS[1:]:
b0 = True
for i in range(iL):
... | p03761 |
import copy
n=int(input())
ans=[]
mins=55
a=[list(input()) for _ in range(n)]
for i in a:
if mins > len(i):
mins=min(mins,len(i))
m=copy.copy(i)
for i in m:
flg=0
for j in a:
if i not in j:
flg=1
if flg==0:
ans.append(i)
for j in a:
j.remove(i)
ans.sort()
print... | n=int(input())
ans=[]
mins=55
a=[list(input()) for _ in range(n)]
for i in a:
if mins > len(i):
mins=min(mins,len(i))
m=list(i)
for i in m:
flg=0
for j in a:
if i not in j:
flg=1
if flg==0:
ans.append(i)
for j in a:
j.remove(i)
ans.sort()
print(*ans,sep='')
| p03761 |
s=list(map(int,input().split()))
if len(s)==2:c=s[0];d=s[1]
else:c=s[0];d=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | p00495 |
import itertools
p, q, r = list(map(int, input().split()))
mn = 10 ** 9
for v in itertools.combinations([p, q, r], 2):
mn = min(mn, v[0]+v[1])
print(mn)
| l = list(map(int, input().split()))
l.sort()
print((l[0]+l[1]))
| p03011 |
a,b,c = list(map(int,input().split()))
A = a+b
B = b+c
C = c+a
lm = [A,B,C]
print((min(lm))) | lm = list(map(int,input().split()))
lm.sort()
print((lm[0]+lm[1]))
| p03011 |
P,Q,R = list(map(int,input().split()))
sum = P + Q
if sum > P + R:
sum = P + R
if sum > Q + R:
sum = Q + R
print(sum) | P,Q,R = list(map(int,input().split()))
dis = [P,Q,R]
dis.sort()
print((dis[0]+dis[1])) | p03011 |
P, Q, R = list(map(int, input().split()))
print((min(P+Q, Q+R, R+P))) | P, Q, R = list(map(int, input().split()))
print((P + Q + R - max(P, Q, R))) | p03011 |
t = list(map(int, input().split()))
print((sum(t) - max(t))) | p, q, r = list(map(int, input().split()))
print((p + q + r - max(p, q, r))) | p03011 |
#!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python
import time
time.sleep(2)
P,Q,R = list(map(int,input().split()))
print((min(P+Q,min(Q+R,R+P)))) | #!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python
P,Q,R = list(map(int,input().split()))
print((min(P+Q,min(Q+R,R+P)))) | p03011 |
def main():
A = sorted(list(map(int, input().split())))
print((A[0] + A[1]))
if __name__ == '__main__':
main() | def main():
A = sorted(list(map(int, input().split())))
print((sum(A[:2])))
if __name__ == '__main__':
main()
| p03011 |
a = input().split()
a.sort()
print((int(a[0]) + int(a[1]))) | P,Q,R=list(map(int,input().split()))
a=[P+Q,Q+R,R+P]
print((min(a))) | p03011 |
p, q, r = list(map(int, input().split()))
print((p + q+ r - max(p, q, r))) | a, b, c= list(map(int, input().split()))
print(( a+b+c- max(a, b, c)))
| p03011 |
A = list(map(int, input().split()))
print((sum(sorted(A)[:2]))) | P, Q, R = list(map(int, input().split()))
ans = min((P + Q, Q + R, R + P))
print(ans) | p03011 |
import heapq
l = list(map(int,input().split()))
heapq.heapify(l)
print((heapq.heappop(l) + heapq.heappop(l)))
| ans = list(map(int,input().split()))
ans.sort()
print((ans[0]+ans[1]))
| p03011 |
pqr = list(map(int, input().split()))
pqr.sort()
print((sum(pqr[:2])))
| nums = list(map(int, input().split()))
nums.sort()
print((sum(nums[:2]))) | p03011 |
p,q,r=list(map(int,input().split()))
sum=min(p+q,q+r,p+r)
print(sum)
|
a = list(map(int, input().split()))
a.sort()
print((a[0] + a[1])) | p03011 |
num = list(map(int,input().split()))
num.sort()
print((num[0]+num[1]))
| p,q,r = list(map(int,input().split()))
print((min(p+q,q+r,r+p))) | p03011 |
P , Q , R = list(map(int, input().split()))
if P >= Q and P >= R:
print((Q + R))
elif Q >= P and Q >= R:
print((P + R))
else:
print((P + Q)) | P , Q , R = list(map( int , input().split()))
distance = [P+Q , Q+R , R+P]
print((min(distance))) | p03011 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
c = [0] * (100000 + 1)
for ai in A:
c[ai] += 1
ans = 0
for i in range(len(c) - 2):
ans = max(ans, c[i] + c[i+1] + c[i+2])
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
c = [0] * (100000 + 2)
for ai in A:
c[ai+1] += 1
c[ai] += 1
c[ai+2] += 1
print((max(c)))
if __name__ == "__main__":
main() | p03611 |
N = int(eval(input()))
def dec(a):
return a-1
def inc(a):
return a+1
a = list(map(int,input().split()))
b = list(map(dec,a))
c = list(map(inc,a))
count = a+b+c
set_c = list(set(count))
c = {}
for i in range(len(set_c)):
c[set_c[i]] = count.count(set_c[i])
print((max(c.values()))) | N = int(eval(input()))
a = list(map(int,input().split()))
x = {}
for i in range(N):
ai = a[i]
temp = x.get(ai-1, 0)
temp += 1
x[ai-1] = temp
temp = x.get(ai, 0)
temp += 1
x[ai] = temp
temp = x.get(ai+1, 0)
temp += 1
x[ai+1] = temp
X = max(x.values())... | p03611 |
N=int(eval(input()))
ANi=input().split()
AN=list(map(int,ANi))
Xhairetsu={}
for i in range(len(AN)):
for X in range(1,10**5):
if AN[i]<=X+1 and AN[i]>=X-1 and X not in list(Xhairetsu.keys()):
Xhairetsu[X]=1
elif AN[i]<=X+1 and AN[i]>=X-1 and X in list(Xhairetsu.keys()):
... | N=int(eval(input()))
ANi=input().split()
AN=list(map(int,ANi))
Whairetsu={}
Xhairetsu={}
Yhairetsu={}
for i in range(len(AN)):
if AN[i] not in list(Xhairetsu.keys()):
Xhairetsu[AN[i]]=1
elif AN[i] in list(Xhairetsu.keys()):
Xhairetsu[AN[i]]+=1
if AN[i] -1 not in list(W... | p03611 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(set(a))
l=[];m=[]
for i in range(len(b)):
l.append([b[i],a.count(b[i])])
if len(l)>2:
for j in range(len(b)-2):
x=l[j][1]
if l[j+1][0]-l[j][0]<=2:
x+=l[j+1][1]
if l[j+2][0]-l[j][0]<=2:x+=l[j+2][1]
m.append(x)
elif len(... | n=int(eval(input()))
a=list(map(int,input().split()))
l=[]
for i in range(max(a)+3):
l.append(0)
for j in range(n):
l[a[j]+1]+=1
m=[]
for i in range(1,max(a)+2):
m.append(l[i-1]+l[i]+l[i+1])
print((max(m))) | p03611 |
nums = int(eval(input()))
ary = list(map(int,input().split()))
count =0
max_count = 0
ary.sort()
ary_count = [0 for i in range(100005)]
ary_count.append(0)
for i in range(100005):
ary_count[i] = ary.count(i)
for i in range(1,100005):
count += ary_count[i]
count += ary_count[i+1]
count +... | nums = int(eval(input()))
ary = list(map(int,input().split()))
count =0
max_count = 0
ary.sort()
ary_count = [0 for i in range(100005)]
ary_count.append(0)
for i in ary:
ary_count[i] += 1
for i in range(1,100005):
count += ary_count[i]
count += ary_count[i+1]
count += ary_count[i-1]
... | p03611 |
n = int(eval(input()))
a = list(map(int, input().split()))
nums = [0] * (10**5+1)
nums[0] = a.count(0) + a.count(1)
nums[(10**5)] = a.count((10**5)-1) + a.count((10**5))
for i in range(1, (10**5)):
nums[i] = a.count(i-1) + a.count(i) + a.count(i+1)
print((max(nums))) | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
for j in range(i - 1, i + 2): #aの値の両隣まで
d[j] = d.get(j, 0) + 1#getは第一引数で指定したキーがなかったら第二引数で指定した値を戻す
print((max(d.values()))) | p03611 |
N = int(eval(input()))
a = []
elements = set()
for i in input().split():
a.append(int(i))
elements.add(int(i))
elements.add(int(i)-1)
elements.add(int(i)+1)
max_count = 0
for X in elements:
count = 0
for num in a:
if X-1 <= num <= X+1:
count += 1
max_count =... | def dic_counter(dic, num):
if num in dic:
dic[num] += 1
else:
dic[num] = 1
N = int(eval(input()))
dic = {}
for i in input().split():
dic_counter(dic, int(i)-1)
dic_counter(dic, int(i))
dic_counter(dic, int(i)+1)
for _, value in sorted(list(dic.items()), key=lambda x: -x[... | p03611 |
def dic_counter(dic, num):
if num in dic:
dic[num] += 1
else:
dic[num] = 1
N = int(eval(input()))
dic = {}
for i in input().split():
dic_counter(dic, int(i)-1)
dic_counter(dic, int(i))
dic_counter(dic, int(i)+1)
for _, value in sorted(list(dic.items()), key=lambda x: -x[... | def dic_counter(dic, num):
if num in dic:
dic[num] += 1
else:
dic[num] = 1
_ = int(eval(input()))
dic = {}
for i in input().split():
dic_counter(dic, int(i)-1)
dic_counter(dic, int(i))
dic_counter(dic, int(i)+1)
print((sorted(list(dic.values()), key=lambda x: -x)[0])) | p03611 |
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a1 = [i + 1 for i in a]
a2 = [i - 1 for i in a]
a = a + a1 + a2
ac = Counter(a)
print((ac.most_common()[0][1]))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
l1 = [0] * (max(a) + 3)
for ea in a:
l1[ea] += 1
l1[ea+1] += 1
l1[ea+2] += 1
print((max(l1)))
if __name__ == '__main__':
main() | p03611 |
from collections import Counter
N = int(eval(input()))
As = list(map(int, input().split()))
box = []
for a in As:
box.append(a)
box.append(a+1)
box.append(a-1)
cnt = Counter(box).most_common(1)
print((cnt[0][1])) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
B = []
for a in A:
B.append(a)
B.append(a-1)
B.append(a+1)
C = Counter(B).most_common(1)
print((C[0][1])) | p03611 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort()
count = 0
ans = []
for i in range(n):
for j in range(n-1):
if j >= i and a[j]-a[i] <= 2:
#print(i,j)
count += 1
else:
ans.append(count)
count = 0
if n == 1:
print((1))
else:
print((max(ans))) | n = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort()
count = 0
p1 = []
for i in range(n):
p1.append(a[i]-1)
p2 = []
for i in range(n):
p2.append(a[i]+1)
chk = a+p1+p2
chk.sort()
#print(chk)
ans =[]
count = 0
for i in range(3*n-1):
if chk[i+1] == chk[i]:
count += 1
else:
... | p03611 |
from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
a=list(map(int,readline().split()))
d=dict()
for i in range(n):
if a[i] not in d:
d[a[i]]=1
else:
d[a[i]]+=1
cnt=0
for x in range(1,10**5+1):
... | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
a=list(map(int,readline().split()))
li=[0]*(10**5+2)
for i in range(n):
li[a[i]]+=1
cnt=0
for x in range(1,10**5+1):
cnt=max(cnt,li[x-1]+li[x]+li[x+1])
print(cnt)
if _... | p03611 |
n = int(eval(input()))
al = list(map(int, input().split()))
num = [0] * (10**5+1)
for a in al:
num[a] += 1
ans = 0
for i in range(10**5+2):
x_cnt = sum(num[i-1:i+2])
ans = max(ans, x_cnt)
print(ans) | n = int(eval(input()))
al = list(map(int, input().split()))
ans = [0]*(10**5+2)
for a in al:
ans[a] += 1
ans[a-1] += 1
ans[a+1] += 1
print((max(ans))) | p03611 |
from collections import Counter as C
n = int(eval(input()))
a= list(input().split())
al = list([int(i) for i in a])
aset = set([int(i) for i in a])
cnt=0
#print(C(al)[0])
for i in aset:
#print(i)
#print(al.count(i-1),al.count(i),al.count(i+1))
if cnt < C(al)[i-1] + C(al)[i] + C(al)[i+1]:
cn... | from collections import Counter as C
n = int(eval(input()))
a= list(input().split())
al = list([int(i) for i in a])
aset = set([int(i) for i in a])
cnt=0
ca = C(al)
#print(C(al)[0])
for i in aset:
#print(i)
#print(al.count(i-1),al.count(i),al.count(i+1))
if cnt < ca[i-1] + ca[i] + ca[i+1]:
c... | p03611 |
from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
min_v=min(a)
max_v=max(a)
c=Counter(a)
ans=0
for i in range(min_v,max_v+1):
t_ans=c[i-1]+c[i]+c[i+1]
ans=max(ans,t_ans)
print(ans) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from collections import Counter
n=int(eval(input()))
a=lnii()
c=Counter(a)
a_max=max(a)
ans=0
for i in range(a_max+1):
t_ans=c[i-1]+c[i]+c[i+1]
ans=max(ans,t_ans)
print(an... | p03611 |
import collections
n = int(eval(input()))
#a = list(map(int,input().split()))
a = list( input().split() )
dict = collections.Counter(a)
#print(n)
#print(a)
#print(dict)
#print(dic[str(1)])
x_max = 0
mem_key = ""
for key in list(dict.keys()):
k = int( key )
l = dict[str(k-1)]
m = dict[str(k... | import collections
n = int(eval(input()))
a = list( input().split() )
dict = collections.Counter(a)
x_max = 0
#mem_key = ""
for key in list(dict.keys()):
k = int( key )
x_max = max(x_max, dict[str(k-1)]+dict[str(k)]+dict[str(k+1)])
print(x_max) | p03611 |
n = int(eval(input()))
a = list(map(int, input().split()))
t = [1 if a[i] == a[j] or abs(a[i] - a[j]) == 1 else 0 for i in range(n) for j in range(n)]
print((max([sum(t[i:i+n]) for i in range(0, len(t), n)]))) | n = int(eval(input()))
a = list(map(int, input().split()))
count = {}
for i in a:
for j in [-1, 0, 1]:
count.setdefault(i+j, 0)
count[i+j] += 1
print((max(count.values()))) | p03611 |
n = int(eval(input()))
a = input().split()
a = list(map(int,a))
arr = []
for x in range(10**5):
count = 0
for i in range(n):
if a[i] == x-1 or a[i] == x or a[i] == x+1:
count += 1
arr.append(count)
print((max(arr)))
| n = int(eval(input()))
a = input().split()
a = list(map(int,a))
arr = [0] * (10**5 + 2)
for i in range(n):
arr[a[i]] += 1
ans = []
for x in range(1,10**5):
ans.append(arr[x-1] + arr[x] + arr[x+1])
print((max(ans)))
| p03611 |
N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**7)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**6)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | p03611 |
N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**6)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**5+2)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | p03611 |
from collections import Counter
N = int(eval(input()))
a = list(map(int,input().split()))
counter = Counter(a)
ans=[]
for k,v in list(counter.items()):
if k-1 in counter:
v+=counter[k-1]
if k+1 in counter:
v+=counter[k+1]
ans.append(v)
print((max(ans))) | n = int(eval(input()))
a = list(map(int, input().split()))
c = [0] * (max(a)+3)
for v in a:
c[v] += 1
c[v+1] += 1
c[v+2] += 1
print((max(c))) | p03611 |
import sys
import collections
#import numpy as np
readline = sys.stdin.readline
def main():
N = int(eval(input()))
#A1 = np.array(list(map(int, readline().split())))
A = list(map(int, readline().split()))
count = [0] * (max(A) + 3)
for a in A:
count[a+1] += 1
count... | import sys
readline = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, readline().split()))
count = [0] * (pow(10, 5)+3)
for a in A:
count[a] += 1
count[a+1] += 1
count[a+2] += 1
ans = max(count)
print(ans)
if __name__ == "... | p03611 |
n,*l=list(map(int,open(0).read().split()))
c=[0]*(10**5+3)
for i in l:
for j in (-1,0,1): c[i+j]+=1
print((max(c))) | eval(input())
c=[0]*100002
for i in map(int,input().split()):
for j in (0,1,2): c[i+j]+=1
print((max(c))) | p03611 |
eval(input())
A=list(map(int,input().split()))
B=set(A)
dict={}
for x in B:
dict[x]=A.count(x)
max=0
for x in B:
tmp = dict[x]
if x-1 in B:
tmp+=dict[x-1]
if x+1 in B:
tmp+=dict[x+1]
if tmp>max:
max=tmp
print(max) | n = int(eval(input()))
A = list(map(int,input().split()))
Ap = [a+1 for a in A]
Am = [a-1 for a in A]
label = set(A+Ap+Am)
dict = {l:0 for l in label}
for a in A+Ap+Am:
dict[a]+=1
print((max(dict.values()))) | p03611 |
n=int(eval(input()))
a=list(map(int,input().split()))
count=0
a_plus=[]
a_minu=[]
for i in range(n):
a_plus.append(a[i]+1)
a_minu.append(a[i]-1)
import collections
a.extend(a_plus)
a.extend(a_minu)
data=collections.Counter(a)
data=sorted(list(data.items()),key=lambda x:x[1],reverse=True)
print((dat... | n=int(eval(input()))
a=list(map(int,input().split()))
from collections import Counter
plus=[0]*n
minus=[0]*n
for i in range(n):
plus[i]=a[i]+1
minus[i]=a[i]-1
plus=plus+minus+a
data=Counter(plus)
ans=[]
for i in list(data.values()):
ans.append(i)
print((max(ans)))
| p03611 |
N = int(eval(input()))
a = list(map(int, input().split()))
L = [0] * 10 ** 5
for i in range(N):
L[a[i]] += 1
s = L[0] + L[1] + L[2]
A = s
for i in range(10 ** 5-3):
s += L[i+3] - L[i]
A = max(A,s)
print(A)
| N = int(eval(input()))
a = list(map(int, input().split()))
num_list = [0 for _ in range(10 ** 5)]
for i in a:
if i > 0:
num_list[i - 1] += 1
num_list[i] += 1
if i < 10 ** 5 - 1:
num_list[i + 1] += 1
print((max(num_list)))
| p03611 |
import collections
num = int(eval(input()))
s = sorted(list(map(int, input().split())))
if num == 1:
print((1))
else:
max_ans = 0
for i in range(num):
start = s[i]
c = collections.Counter(s)
current_ans = c[start]+c[start+1]+c[start+2]
max_ans = max(current_ans,m... | import collections
num = int(eval(input()))
s = sorted(list(map(int, input().split())))
if num == 1:
print((1))
else:
c = collections.Counter(s)
max_ans = 0
for i in range(num):
start = s[i]
current_ans = c[start]+c[start+1]+c[start+2]
max_ans = max(current_ans,max_a... | p03611 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
i = 0
max_count = 0
count = 0
while i < len(a):
x = a[i]
j = i
while j < len(a):
if x == a[j] or x+1 == a[j] or x+2 == a[j]:
count += 1
j += 1
else:
break
if max_count <... | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
max_count = 0
count = 0
i = 0
x_before = -1
while i < N:
x = a[i]
j = i
if x_before != x:
while j < len(a):
if x == a[j] or x+1 == a[j] or x+2 == a[j]:
count += 1
j += 1
... | p03611 |
N = int(eval(input()))
A = [int(i) for i in input().split(' ')]
count = 0
answer = 0
A.sort()
for i in range(A[0],A[N-1]+1):
count = 0
for a in A:
if i-1 <= a <= i+1:
count += 1
if answer < count:
answer = count
print(answer) | N = int(eval(input()))
A = [int(i) for i in input().split(' ')]
A.sort()
B = [0]*(A[N-1]+3)
for a in A:
B[a] += 1
B[a+1] += 1
B[a+2] += 1
print((max(B))) | p03611 |
n = int(eval(input()))
a = list(map(int, input().split()))
ys = [0] * (max(a)+ 1)
for x in range(len(ys)):
y = a.count(x-1) + a.count(x) + a.count(x+1)
ys[x] = y
print((max(ys))) | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in range(max(a)+1):
d[i] = 0
for a_ in a:
d[a_] += 1
d[-1] = 0
d[max(a)+1] = 0
ans = 0
for x in range(max(a)+1):
if x-1 in d:
ans = max(ans, d[x-1] + d[x] + d[x+1])
print(ans)
| p03611 |
n = int(eval(input()))
a = list(map(int, input().split()))
nums = [0]*(10**5+1)
for i in a: nums[i] += 1
t = sum(nums[:3])
ans = t
for i in range(3,10**5+1):
t = t - nums[i-3] + nums[i]
if ans < t: ans = t
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
nums = [0]*(max(a)+1)
for i in a: nums[i] += 1
ans = sum(nums[:3])
t = sum(nums[:3])
for i in range(len(nums)-3):
t = t + nums[i+3] - nums[i]
if ans < t: ans = t
print(ans) | p03611 |
N = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(100000):
b.append(a.count(i-1) + a.count(i) + a.count(i+1))
print((max(b)))
| N = int(eval(input()))
a = list(map(int, input().split()))
b = []
c = []
for i in range(N):
if a[i] > 0:
b.append(a[i] - 1)
c.append(a[i] + 1)
else:
c.append(a[i] + 1)
abc = a + b + c
count = [0] * (max(abc) + 1)
for x in abc:
count[x] += 1
print((max(count))) | p03611 |
# encoding: "utf-8"
from collections import defaultdict
class Stdin:
@staticmethod
def read_line(converter=str):
return [converter(x) for x in input().split()]
@staticmethod
def read_lines(n, converter=str):
result = list()
for _ in range(n):
resul... | eval(input())
a_list = [int(s) for s in input().split()]
count = [0]*100002
for a in a_list:
count[a] += 1
count[a+1] += 1
count[a+2] += 1
print((max(count))) | p03611 |
# encoding: "utf-8"
from collections import defaultdict
# class Stdin:
# @staticmethod
# def read_line(converter=str):
# return [converter(x) for x in input().split()]
# @staticmethod
# def read_lines(n, converter=str):
# result = list()
# for _ in range(n):
#... | # encoding: "utf-8"
from collections import defaultdict
# class Stdin:
# @staticmethod
# def read_line(converter=str):
# return [converter(x) for x in input().split()]
# @staticmethod
# def read_lines(n, converter=str):
# result = list()
# for _ in range(n):
#... | p03611 |
# encoding: "utf-8"
from collections import defaultdict
class Stdin:
@staticmethod
def read_line(converter=str):
return [converter(x) for x in input().split()]
@staticmethod
def read_lines(n, converter=str):
result = list()
for _ in range(n):
resul... | # encoding: "utf-8"
class Stdin:
@staticmethod
def read_line(converter=str):
return [converter(x) for x in input().split()]
@staticmethod
def read_lines(n, converter=str):
result = list()
for _ in range(n):
result.append(Stdin.read_line(converter))
... | p03611 |
# encoding: "utf-8"
from collections import defaultdict
from functools import reduce
from itertools import groupby, chain
class Stdin:
@staticmethod
def read_line(converter=str):
return [converter(x) for x in input().split()]
@staticmethod
def read_lines(n, converter=str):
... | # encoding: "utf-8"
from collections import defaultdict
from functools import reduce
from itertools import groupby, chain
class Stdin:
@staticmethod
def read_line(converter=str):
return [converter(x) for x in input().split()]
@staticmethod
def read_lines(n, converter=str):
... | p03611 |
n=int(eval(input()))
al=list(map(int,input().split()))
dic={}
for v in al:
if not v in list(dic.keys()):
dic[v]=1
else:
dic[v]=dic[v]+1
count_l=[]
for v in range(min(al)-1,max(al)+2):
count=0
count=dic.get(v-1,0)+dic.get(v,0)+dic.get(v+1,0)
count_l.append(count)
print(... | n = int(eval(input()))
#a, b = map(int,input().split())
al = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
dic = {}
for a in al:
dic[a] = dic.get(a, 0)+1
mx = max(al)
mn = min(al)
ans = 0
for x in range(mn, mx+1):
ans = max(ans, dic.get(x+1, 0)+dic.get(x,... | p03611 |
n=int(eval(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
... | n=int(eval(input()))
alis=list(map(int,input().split()))
xlis=dict()
for i in set(alis):
xlis[i-1]=0
xlis[i+1]=0
xlis[i]=0
for i in alis:
xlis[i-1]+=1
xlis[i+1]+=1
xlis[i]+=1
print((max(xlis.values()))) | p03611 |
n = int(eval(input()))
a = list(map(int, input().split()))
p = [0] * 100005
for i in range(100005):
p[i] += a.count(i - 1)
p[i] += a.count(i)
p[i] += a.count(i + 1)
print((max(p))) | n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
p = [0] * 100005
for i in a:
p[i] += 1
num = 0
for i in range(1, 100000):
num = max(num, sum(p[i - 1: i + 2]))
print(num) | p03611 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
cntA = [0 for _ in range(10**5)]
for i in range(10**5):
if i in A:
cntA[i] = A.count(i)
sumA = [0 for _ in range(10**5)]
sumA[0] = cntA[0]
sumA[1] = cntA[0] + cntA[1]
for i in range(2,10**5):
sumA[i] = cntA[i] + cntA[i-1] + cn... | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
cntA = [0 for _ in range(10**5)]
for a in A:
cntA[a] += 1
sumA = [0 for _ in range(10**5)]
sumA[0] = cntA[0]
sumA[1] = cntA[0] + cntA[1]
for i in range(2,10**5):
sumA[i] = cntA[i] + cntA[i-1] + cntA[i-2]
print((max(sumA))) | p03611 |
from collections import Counter
n = int(eval(input()))
a = Counter(sorted(list(map(int, input().split()))))
ans = 0
p = 0
for x, y in list(a.items()):
p = y
if x-1 in a: p += a[x-1]
if x+1 in a: p += a[x+1]
if p > ans: ans = p
print(ans) | from collections import Counter
n = int(eval(input()))
a = Counter(list(map(int, input().split())))
ans = 0
for x,y in list(a.items()):
cnt = y
if x-1 in a: cnt += a[x-1]
if x+1 in a: cnt += a[x+1]
if cnt > ans: ans = cnt
print(ans) | p03611 |
n=int(eval(input()))
a=list(map(int,input().split()))
if max(a)==min(a):
print(n)
else:
ans=1
b=[0]*(10**6)
for i in range(max(a)+1):
b[i]=a.count(i)
for i in range(10**5+3):
ans=max(ans,b[i]+b[i+1]+b[i+2])
print(ans) | import collections
n=int(eval(input()))
a=list(map(int,input().split()))
c=collections.Counter(a)
ans=1
for i in range(min(a),max(a)+1):
goukei=c[i-1]+c[i]+c[i+1]
ans=max(ans,goukei)
print(ans) | p03611 |
import sys
from collections import defaultdict
cnt = defaultdict(int)
def main():
n, *a = list(map(int, sys.stdin.read().split()))
a.sort()
l = a[0]
r = a[-1]
for val in a:
cnt[val] += 1
ans = 0
for i in range(l, r+1):
ans = max(ans, cnt[i-1] + cnt[i] ... | import sys
from collections import defaultdict
n, *a = list(map(int, sys.stdin.read().split()))
def main():
res = defaultdict(int)
for i in a:
res[i-1] += 1
res[i] += 1
res[i+1] += 1
return max(res.values())
if __name__ == '__main__':
ans = main()
pri... | p03611 |
import sys
from collections import defaultdict
n, *a = list(map(int, sys.stdin.read().split()))
def main():
res = defaultdict(int)
for i in a:
res[i-1] += 1
res[i] += 1
res[i+1] += 1
return max(res.values())
if __name__ == '__main__':
ans = main()
pri... | import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
m = 10 ** 5
cnt = [0] * (m + 1)
for x in a:
cnt[x] += 1
if x > 0: cnt[x-1] += 1
if x < m: cnt[x+1] += 1
print((max(cnt)))
if __name__ == '__main__':
main() | p03611 |
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for num in range(min(A), max(A)+1):
tmp = [1 if abs(a-num)<=1 else 0 for a in A]
ans = max(ans, sum(tmp))
print(ans) | n = int(eval(input()))
A = sorted(list(map(int, input().split())))
count = dict()
for a in A:
for i in range(a-1, a+2):
if i not in count:
count[i] = 1
else:
count[i] += 1
print((max(count.values()))) | p03611 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.