input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
import bisect
mod=998244353
n=int(eval(input()))
d=[]
N=1<<(n.bit_length())
t=[-1 for i in range(2*N-1)]
def ud(i,x):
i+=N-1
t[i]=x
while i:
i=(i-1)//2
if t[i*2+1]>t[i*2+2]:t[i]=t[i*2+1]
else:t[i... | def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
import bisect
mod=998244353
n=int(eval(input()))
d=[]
N=1<<(n.bit_length())
t=[-1 for i in range(2*N-1)]
def ud(i,x):
i+=N-1
t[i]=x
while i:
i=(i-1)>>1
if t[i*2+1]>t[i*2+2]:t[i]=t[i*2+1]
else:t[i... | p02758 |
n=int(eval(input()))
xd=[list(map(int,input().split())) for _ in range(n)]
xd.sort(key=lambda x:x[0])
aryx=[x for x,d in xd]
mod=998244353
dp=[1]*(n+1)
#dp[n-1]=2
r=list(range(n))
r[n-1]=n-1
from bisect import bisect_left
for i in range(n):
x,d=xd[n-1-i]
tmp=bisect_left(aryx,x+d)
ri=max(r[n-1-i... | n=int(eval(input()))
xd=[list(map(int,input().split())) for _ in range(n)]
xd.sort(key=lambda x:x[0])
aryx=[x for x,d in xd]
mod=998244353
dp=[1]*(n+1)
#dp[n-1]=2
r=list(range(n))
r[n-1]=n-1
from bisect import bisect_left
class SegmentTree:
# 初期化処理
# f : SegmentTreeにのせるモノイド
# default : fに対する単... | p02758 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 998244353
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**6)
n = int(eval(input()))
XD = [(-10**10,inf)]
for i in range(n):
... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 998244353
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**6)
n = int(eval(input()))
XD = [(-10**10,inf)]
for i in range(n):
... | p02758 |
class SegmentTreeMax():
def __init__(self,n,init):
self.offset=2**((n-1).bit_length())
self.tree=[init]*(2*self.offset)
self.init=init
def update(self,pos,val):
pos+=self.offset
self.tree[pos]=val
while pos>1:
pos=pos//2
self.tree[pos]=max(self.tree[2*pos],self.tree[2*p... | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 19 15:35:41 2020
@author: ybt07
"""
class SegmentTreeMax():
def __init__(self,n,init):
# n = 7 のとき
# offset = 2 ** 3 = 8
# 実際のデータは tree[0+8], tree[1+8],,,, に入る
# tree[0～8] は区間の値を入れるために使われている
self.offset = 2 ** ((n-... | p02758 |
class SegmentTree:
def __init__(self, L, op, ide):
self.op = op
self.ide = ide
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break
se... |
class SegmentTree:
def __init__(self, L, op, ide):
self.op = op
self.ide = ide
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break
se... | p02758 |
class Operation:
def __init__(self, name, function, function_on_equal, neutral_value=0):
self.name = name
self.f = function
self.f_on_equal = function_on_equal
def min_multiple(x, count):
return x
min_operation = Operation("min", min, min_multiple, 1e9)
class SegmentT... | MOD = 998244353
N = int(eval(input()))
robots = []
for _ in range(N):
x, d = list(map(int, input().split()))
robots.append((x, d))
robots.sort(reverse=True)
dp = [0] * (N + 1)
los = [N] * (N + 1)
dp[0] = 1
los[0] = 0
for i, (x, d) in enumerate(robots):
lo = i
while lo > 0 and robots[lo - 1]... | p02758 |
from collections import deque
n = int(eval(input()))
info = [list(map(int, input().split())) for i in range(n)]
MOD = 998244353
info = [(10**10, 10 ** 10)] + sorted(info, reverse=True)
dp = [0] * (n + 1)
dp[0] = 1
q = deque([])
for i in range(n):
if sum(info[i + 1]) <= info[i][0]:
# 抜かさないと... | from collections import deque
n = int(eval(input()))
info = [list(map(int, input().split())) for i in range(n)]
info = sorted(info, reverse=True)
MOD = 998244353
dp = [0] * (n + 1)
dp[0] = 1
q = deque([])
for i in range(n):
# 起動しない場合
dp[i + 1] += dp[i]
# 起動する場合
x, d = info[i]
... | p02758 |
import bisect
import sys
input = sys.stdin.readline
class SegmentTreeRMQ(object): # 1-indexed
def __init__(self, size, value):
self.len = 1 << size.bit_length()
# print(self.len)
self.array = [value] * (2 * self.len)
def update(self, i, x):
i += self.len
... | import bisect
import sys
input = sys.stdin.readline
class SegmentTreeRMQ(object): # 1-indexed
def __init__(self, size, value):
self.len = 1 << size.bit_length()
# print(self.len)
self.array = [value] * (2 * self.len)
def update(self, i, x):
i += self.len
... | p02758 |
import bisect
import sys
sys.setrecursionlimit(10**6)
def main():
MOD = 998244353
N = int(eval(input()))
robot_list = [list(map(int, input().split())) for _ in range(N)]
robot_list.sort() # x座標の昇順でソート
X = [robot[0] for robot in robot_list]
D = [robot[1] for robot in robot_list]... | import bisect
import sys
sys.setrecursionlimit(10**6)
INF = 10**6
class SegTree:
def __init__(self, N):
self.N = N
self.data = [- INF] * (2 * N - 1)
def update(self, i, x):
n = self.N + i - 1
self.data[n] = x
while n > 0:
n = (n - 1) //... | p02758 |
def main():
n = int(eval(input()))
xd = [list(map(int, input().split())) + [i] for i in range(1, n + 1)]
mod = 998244353
INF = 10 ** 10
xd.sort()
adj = [[] for _ in range(n + 1)]
stack = [(INF, 0)]
for x, d, i in xd:
while stack[-1][0] <= x:
stack.pop()
... | def main():
n = int(eval(input()))
xd = [list(map(int, input().split())) for _ in range(n)]
mod = 998244353
INF = 10 ** 10
xx = [(x, x + d, i) for i, (x, d) in enumerate(xd, 1)]
xx.sort()
c = [[] for _ in range(n + 1)]
stack = [(INF, 0)]
for l, r, i in xx:
while s... | p02758 |
from bisect import bisect_right
from bisect import bisect_left
mod = 998244353
n = int(eval(input()))
robot = []
pos = []
for i in range(n):
x, d = list(map(int, input().split()))
robot.append([x, x+d])
pos.append(x)
robot = sorted(robot, key=lambda y: y[0])
pos = sorted(pos)
def init(... | from bisect import bisect_left
MOD = 998244353
n = int(eval(input()))
robot = []
pos = []
for i in range(n):
x, d = list(map(int, input().split()))
robot.append([x, x+d])
pos.append(x)
robot = sorted(robot, key=lambda y: y[0])
pos = sorted(pos)
def init(init_val):
for i in range(n)... | p02758 |
from bisect import bisect_left
MOD = 998244353
n = int(eval(input()))
robot = []
pos = []
for i in range(n):
x, d = list(map(int, input().split()))
robot.append([x, x+d])
pos.append(x)
robot = sorted(robot, key=lambda y: y[0])
pos = sorted(pos)
def init(init_val):
for i in range(n)... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
MOD = 998244353
n = int(eval(input()))
robot = []
pos = []
for i in range(n):
x, d = list(map(int, input().split()))
robot.append([x, x+d])
pos.append(x)
robot = sorted(robot, key=lambda y... | p02758 |
import sys
import bisect
input = sys.stdin.readline
class SegmentTree:
def __init__(self, a):
self.padding = -float('inf')
self.n = len(a)
self.N = 2 ** (self.n-1).bit_length()
self.data = [self.padding]*(self.N-1) + a + [self.padding]*(self.N-self.n)
for i in rang... | import sys
import bisect
input = sys.stdin.readline
class SegmentTree:
def __init__(self, a):
self.padding = -float('inf')
self.n = len(a)
self.N = 2 ** (self.n-1).bit_length()
self.data = [self.padding]*(self.N-1) + a + [self.padding]*(self.N-self.n)
for i in rang... | p02758 |
class SegTree:
def __init__(self, init_val, ide_ele, segfunc):
self.n = len(init_val)
self.num =2**(self.n-1).bit_length()
self.ide_ele = ide_ele
self.seg = [self.ide_ele]*2*self.num
self.segfunc = segfunc
#set_val
for i in range(self.n):
... | class SegTree:
def __init__(self, init_val, ide_ele, segfunc):
self.n = len(init_val)
self.num =2**(self.n-1).bit_length()
self.ide_ele = ide_ele
self.seg = [self.ide_ele]*2*self.num
self.segfunc = segfunc
#set_val
for i in range(self.n):
... | p02758 |
class SegTree:
def __init__(self, init_val, ide_ele, segfunc):
self.n = len(init_val)
self.num =2**(self.n-1).bit_length()
self.ide_ele = ide_ele
self.seg = [self.ide_ele]*2*self.num
self.segfunc = segfunc
#set_val
for i in range(self.n):
... | class SegTree:
def __init__(self, init_val, ide_ele, segfunc):
self.n = len(init_val)
self.num =2**(self.n-1).bit_length()
self.ide_ele = ide_ele
self.seg = [self.ide_ele]*2*self.num
self.segfunc = segfunc
#set_val
for i in range(self.n):
... | p02758 |
import sys
# import collections
# import math
import string
# import bisect
# import re
# import itertools
# import statistics
def main():
s, t = sys.stdin.read().split()
n, m = len(s), len(t)
s = sorted(s)
t = list(reversed(sorted(t)))
if n < m:
for i in range(n):
... | import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
s, t = sys.stdin.read().split()
n, m = len(s), len(t)
s = sorted(s)
t = list(reversed(sorted(t)))
if n < m:
for i in range(n):
... | p03486 |
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
s, t = sys.stdin.read().split()
n, m = len(s), len(t)
s = sorted(s)
t = list(reversed(sorted(t)))
if n < m:
for i in range(n):
... | import sys
s, t = sys.stdin.read().split()
def main():
return 'Yes' if ''.join(sorted(s)) < ''.join(sorted(t))[::-1] else 'No'
if __name__ == '__main__':
ans = main()
print(ans) | p03486 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03486 |
n=int(eval(input()))
l=list(map(int,input().split()))
for i in range(1,n+1):
print((l.count(i)))
| n=int(eval(input()))
l=list(map(int,input().split()))
res=[0]*n
for i in l:
res[i-1] +=1
for i in res:
print(i) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(1,N+1):
print((A.count(i))) | N = int(eval(input()))
A = list(map(int, input().split()))
B = [0]*N
for i in range(N-1):
B[A[i]-1] += 1
for i in range(N):
print((B[i])) | p02707 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
for i in range(n + 1):
if i == 0: continue
ans.append(a.count(i))
for i in range(n):
print((ans[i]))
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = []
sp = 0
c = 0
for i in range(n + 1):
if i == 0: continue
for j in range(sp, n - 1):
if a[j] != i:
break
sp += 1
c += 1
ans.append(c)
c = 0
for i in range(n):
print((ans[i... | p02707 |
n=int(eval(input()))
lst=list(map(int,input().split(' ')))
final=[0]*n
for i in lst:
final[i-1]+=1
for i in final:
print(i)
| n=int(input())
lst=list(map(int,input().split(' ')))
final=[0]*n
for i in lst:
final[i-1]+=1
print(*final, sep='\n')
| p02707 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
for i in range(N) :
print((A.count(i+1))) | N = int(eval(input()))
A = [int(i) for i in input().split()]
A_cnt = [0 for i in range(N)]
for i in range(N-1) :
A_cnt[A[i]-1] += 1
for i in range(N) :
print((A_cnt[i])) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
print((A.count(i + 1)))
| N = int(input())
s = [0 for i in range(N)]
A = list(map(int, input().split()))
for i in A:
s[i - 1] += 1
print(*s, sep='\n')
| p02707 |
N=int(eval(input()))
A = list(map(int, input().strip().split()))
for i in range(1,N+1):
print((A.count(i))) | n=int(eval(input()))
A = list(map(int, input().split()))
list=[0]*(n+2)
for i in range(n-1):
list[A[i]]+=1
for i in range(1,n+1):
print((list[i]))
| p02707 |
N = int(eval(input()))
A1 = [0]
Ai = [int(a) for a in input().split()]
A = A1+Ai
for i in range(1,N+1):
print((A.count(i))) | N = int(eval(input()))
A = [0]*N
for i in [int(s) for s in input().split()]:
A[i-1] +=1
for j in range(N):
print((A[j])) | p02707 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range (n):
print((a.count(i+1))) | n=int(eval(input()))-1
a=list(map(int,input().split()))
r=[]
for i in range(n):
r.append(0)
r[a[i]-1]+=1
for i in range (n):
print((r[i]))
print((0))
| p02707 |
import collections
n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)
c=collections.Counter(a)
c=c.most_common()
l=[0]*n
for i in range(len(c)):
l[c[i][0]-1]=c[i][1]
print((l[0]))
for j in range(1,n):
print((l[j]))
| n=int(eval(input()))
a=list(map(int,input().split()))
l=[0]*(n+1)
check=[False]*(n+1)
for i in a:
l[i]+=1
for i in range(1,n+1):
print((l[i])) | p02707 |
N=int(eval(input()))
A = list(map(int,input().split()))
for i in range(1,N+1):
count = 0
for j in A:
if i == j:
count += 1
print(count)
| num = int(eval(input()))
table = list(map(int, input().split()))
table2 = []
for i in range(num):
table2.append(0)
for j in range(len(table)):
table2[table[j]-1] += 1
for k in table2:
print(k) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N-1):
A[i] -= 1
#上司の社員番号は自分より小さい
dic = {}
for i in range(N):
dic[i] = 0
for i in range(N-1):
dic[A[i]] += 1
for i in range(N):
print((dic[i])) | N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N-1):
A[i] -= 1
ans = [0 for i in range(N)]
for a in A:
ans[a] += 1
for i in range(N):
print((ans[i])) | p02707 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
print((a.count(i+1))) | n=int(eval(input()))
a=list(map(int,input().split()))
lst=[]
for i in range(n):
lst.append(0)
for i in a:
lst[i-1]+=1
for j in lst:
print(j) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
x = i + 1
ans = A.count(x)
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
B = [0] * N
for i in range(N - 1):
x = A[i] - 1
B[x] = B[x] + 1
for i in range(N):
print((B[i])) | p02707 |
n = int(eval(input()))
l = list(map(int,input().split()))
for i in range(n):
print((l.count(i+1)))
|
n = int(eval(input()))
l = list(map(int,input().split()))
l.sort()
k = 0
j = 1
cnt = 0
for i in range(n):
if i == n-1:
print(cnt)
for _ in range(n - j):
print((0))
elif j == l[i]:
cnt += 1
elif l[i] - j >= 1:
print(cnt)
cnt = 1
a ... | p02707 |
N = int(eval(input()))
works = list(map(int, input().split()))
for i in range(1,N + 1):
print((works.count(i))) | N = int(eval(input()))
works = list(map(int, input().split()))
ans = [0] * (N + 1)
for i in range(0,N - 1):
ans[works[i]] += 1
ans.pop(0)
for i in ans:
print(i) | p02707 |
a = int(eval(input()))
b = list(map(int,input().split()))
for i in range(a):
c = 0
for num in range(len(b)):
if i+1 == b[num]:
c = c + 1
print(c)
| a = int(eval(input()))
b = list(map(int,input().split()))
c = [0]*a
for i in b:
c[i-1] += 1
for i in c:
print(i)
| p02707 |
import sys
sys.setrecursionlimit(4100000)
input = sys.stdin.readline
N = int(eval(input())) #社員数
joushi_no_bangou = [0] #上司の社員番号
ans = []
joushi_no_bangou += list(map(int,input().split()))
#==--------------
for i in range(N):
print((joushi_no_bangou.count(i+1))) | N = int(eval(input()))
As = list(map(int, input().split()))
ct = [0] * N
for a in As: #ここがキモ．リスト「As」にはそれぞれの上司が入っていて，その中からaを取り出すので，a=上司になっている．これにより，ctの上司を正確に呼び出すことができる．
ct[a-1] += 1
for c in ct:
print(c)
#別解
#print(*c,sep='\n') | p02707 |
n = int(eval(input()))
A = list(map(int,input().split()))
for i in range(n):
print((A.count(i+1)))
| n = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*(n+1)
for i in range(n-1):
ans[A[i]]+=1
for i in range(1,n+1):
print((ans[i])) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(1, N):
s = A.count(i)
print(s)
print((0)) | n = int(eval(input()))
a = list(map(int, input().split()))
tm = [0] * n
for i in range(n-1):
tm[a[i] - 1] += 1
for i in tm:
print(i) | p02707 |
N = int(eval(input()))
A = input().split()
for i in range(1, N+1):
print((A.count(str(i)))) | n = int(eval(input()))
a = list(map(int, input().split()))
sub = []
for i in range(0, n):
sub.append(0)
for j in a :
sub[j - 1] += 1
for i in sub:
print(i) | p02707 |
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(1,N+1):
counter = 0
for item in A:
if item == i:
counter += 1
print(counter) | N = int(eval(input()))
A = list(map(int,input().split()))
count_list = [0] * N
for item in A:
count_list[item-1] += 1
for countitem in count_list:
print(countitem) | p02707 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]*(n+1)
for i in range(1,n+1):
b[i]=a.count(i)
for i in range(1,n+1):
print((b[i])) | n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]*n
for i in a:
b[i-1]+=1
for i in b:
print(i) | p02707 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1,n+1):
print((a.count(i))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
for i in a:
b[i-1]+=1
for i in b:
print(i) | p02707 |
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * n
ac = Counter(a)
for i in range(n):
cnt[i] = ac[i+1]
for i2 in range(n):
print((cnt[i2]))
if __name__ == '__main__':
main() | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import pi
def main():
n, *a = map(int, read().split())
cnt = [0] * n
for ae in a:
cnt[ae-1] += 1
print(*cnt, sep='\n')
if __name__ == '__main__':
main()
| p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_max = max(A)
for i in range(A_max):
print((A.count(i+1)))
for i in range(N-A_max):
print((0)) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * N
for i in range(len(A)):
ans[A[i]-1] += 1
for i in range(len(ans)):
print((ans[i])) | p02707 |
# C - management
from collections import Counter
def main():
N, *A = list(map(int, open(0).read().split()))
cnt_subordinates = Counter(A)
ans = [cnt_subordinates[i] for i in range(1, N + 1)]
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main()
| # C - management
def main():
N, *A = list(map(int, open(0).read().split()))
cnt_subordinates = [0] * (N + 1)
for a in A:
cnt_subordinates[a] += 1
print(("\n".join(map(str, cnt_subordinates[1:]))))
if __name__ == "__main__":
main()
| p02707 |
n = int(eval(input()))
al = list(map(int, input().split()))
ans_al = [0]*n
for i in range(n):
ans_al[i-1] += al.count(i)
for ans in ans_al:
print(ans) | n = int(eval(input()))
al = list(map(int, input().split()))
ans_al = [0]*n
# for i in range(n):
# ans_al[i-1] += al.count(i)
for a in al:
ans_al[a-1] += 1
for ans in ans_al:
print(ans)
| p02707 |
n = int(eval(input()))
A = list(map(int, input().split()))
i = 1
while i <= n:
print((A.count(i)))
i += 1 | n = int(eval(input()))
A = list(map(int, input().split()))
R = [0 for i in range(n)]
for i in range(n-1):
R[A[i]-1] += 1
for i in range(n):
print((R[i])) | p02707 |
if __name__ == "__main__":
N = int(eval(input()))
As = list(map(int, input().split(" ")))
bosses = []
for n in range(1, N+1):
bosses.append(As.count(n))
print(("\n".join(map(str, bosses)))) | if __name__ == "__main__":
N = int(eval(input()))
As = list(map(int, input().split(" ")))
bosses = [0]*N
for a in As:
bosses[a-1] = bosses[a-1] + 1
print(("\n".join(map(str, bosses)))) | p02707 |
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(1, a[0]+1):
print((b.count(i))) | n,*a=map(int,open(0).read().split())
b=[0]*n
for i in a:
b[i-1]+=1
print(*b, sep="\n")
| p02707 |
from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
c=Counter(a)
for i in range(1,n+1):
print((c[i])) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(eval(input()))
a=lnii()
ans=[0 for i in range(n)]
for i in a:
i-=1
ans[i]+=1
for i in ans:
print(i) | p02707 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=0
for i in range(1,n+1):
b=a.count(i)
print(b) | n=int(input())
a=list(map(int,input().split()))
b=[0 for _ in range(n)]
for i in range(0,len(a)):
b[a[i]-1]+=1
[print(i) for i in b]
| p02707 |
a = int(eval(input()))
i = list(map(int, input().split()))
for num in range(a):
sum = 0
for num2 in range(len(i)):
if i[num2] == num + 1:
sum += 1
print(sum) | a = int(eval(input()))
i = list(map(int, input().split()))
dict = {}
for num in range(a):
dict[num] = 0
for num2 in range(len(i)):
dict[i[num2] - 1] += 1
for num in range(a):
print((dict[num]))
| p02707 |
n = int(eval(input()))
a = list(map(int,input().split()))
t = [0]*(len(a)+1)
for i in range(len(a)+1):
t[i] = a.count(i+1)
for i in range(len(t)):
print((t[i]))
|
n = int(eval(input()))
a = list(map(int,input().split()))
t = [0]*(len(a)+1)
for i in range(len(a)):
t[a[i]-1] += 1
for i in range(len(t)):
print((t[i]))
| p02707 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=set(A)
for i in range(1,N+1):
if i not in B:
print((0))
else:
print((A.count(i)))
| N=int(eval(input()))
A=list(map(int,input().split()))
B=[0]*(N+1)
for i in A:
B[i]+=1
for j in range(1,N+1):
print((B[j]))
| p02707 |
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(1,N+1):
print((A.count(i)))
| N = int(eval(input()))
A = list(map(int,input().split()))
L = [0] * (N + 1)
for i in A:
L[i] += 1
for i in range(1,len(L)):
print((L[i])) | p02707 |
N=int(eval(input()))
A=list(map(int, input().split()))
for i in range(N):
print((A.count(i+1))) | N=int(eval(input()))
A=list(map(int, input().split()))
ans = [0] * N
for i in range(N-1):
l = A[i]-1
ans[l] +=1
for i in range(N):
print((ans[i])) | p02707 |
n= int(input())
l = list(map(int, input().split()))
print(*[l.count(i) for i in range(1,n+1)],sep='\n')
| n = int(input())
a = list(map(int, input().split()))
ans = [0]*n
for i, a in enumerate(a):
ans[a-1] += 1
print(*ans, sep="\n")
| p02707 |
from collections import Counter
N = int(eval(input()))
List = list(map(int,input().split()))
C = Counter(List)
for i in range(1,N):
if i in list(C.keys()):
print((C[i]))
else:
print((0))
print((0)) | N = int(eval(input()))
ls = list(map(int,input().split()))
cnt = [0] * (N+1)
for i in range(N-1):
cnt[ls[i]] += 1
for i in range(1,N+1):
print((cnt[i])) | p02707 |
n=int(eval(input()))
A=list(map(int,input().split()))
R=[0]*n
for a in A:
R[a-1]+=1
for r in R:
print(r) | #!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ret = [0]*N
for a in A:
ret[a-1]+=1
print(('\n'.join(map(str, ret))))
if __name__ == '__main__':
main() | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
i = 0
while i < N:
num = 0
for j in A:
if j == i + 1:
num += 1
i += 1
print(num)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * N
for i in range(N - 1):
ans[A[i] - 1] += 1
for i in range(N):
print((ans[i]))
| p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
print((A.count(i+1)))
| N = int(eval(input()))
A = list(map(int, input().split()))
cnt = []
[cnt.append(0) for _ in range(len(A))]
for i in A:
cnt[i-1] += 1
for i in range(N-1):
print((cnt[i]))
print("0")
| p02707 |
N = int(eval(input()))
from collections import Counter as C
l = dict(C((int(x) for x in input().split())))
for x in range(1,N+1):
print((l.get(x,0))) | n = int(eval(input()))
al = [int(x) - 1 for x in input().split()]
a = []
count = 0
for _ in [0] * n:
a.append(0)
for x in al:
a[x] += 1
count += 1
for x in a:
print(x) | p02707 |
N=int(eval(input()))
A=list(map(int,input().split()))
for i in range(1,N+1):
print((A.count(i))) | N=int(eval(input()))
A=list(map(int,input().split()))
B=[0]*N
for i in A:
B[i-1]+=1
for i in B:
print(i)
| p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
buka = []
for i in range(N):
b = 0
for j in range(N-1):
if (i+1) == A[j]:
b += 1
buka.append(b)
# 出力
for i in range(N):
print((buka[i]))
|
N = int(eval(input()))
A = list(map(int, input().split()))
buka = [0] * N
for i in range(N-1):
buka[A[i]-1] += 1
# 出力
for i in range(N):
print((buka[i])) | p02707 |
n = int(eval(input()))
line = list(map(int, input().strip().split(" ")))
for i in range(1, n + 1):
print((line.count(i)))
| n = int(eval(input()))
line = list(map(int, input().strip().split(" ")))
ans = [0 for s in range(n)]
for i in line:
ans[i - 1] += 1
for i in range(n):
print((ans[i]))
| p02707 |
n = int(eval(input()))
li_a = list(map(int, input().split()))
set_a = set(li_a)
for i in range(1, n + 1):
if i in set_a:
print((li_a.count(i)))
else:
print((0))
| n = int(eval(input()))
li_a = list(map(int, input().split()))
dic = {}
for a in li_a:
dic[a] = dic.get(a, 0) + 1
for i in range(1, n + 1):
print((dic.get(i, 0)))
| p02707 |
# 5
# 1 1 2 2
# 5人の部下
# 社員番号 2の社員の直属の上司の社員番号が 1, 社員番号 3の社員の直属の上司の社員番号が 1, 社員番号 4の社員の直属の上司の社員番号が 2, 社員番号 5の社員の直属の上司の社員番号が 2,
N = int(eval(input()))
AnStr = input().split(' ')
zyosiList = []
for v in AnStr:
zyosiList.append(int(v))
for i in range(1, N + 1):
print((zyosiList.count(i))) | N = int(eval(input()))
AnStr = input().split(' ')
zyosiList = []
a = {}
for v in AnStr:
zyosiList.append(int(v))
if v in a:
a[v] += 1
else:
a[v] = 0
for i in range(1, N + 1):
if str(i) in a:
print((a[str(i)]+1))
else:
print((0)) | p02707 |
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read
# n,m = map(int,input().split())
# a = list(map(int, input().split())) # n個の文字列がリストに格納される
N = int(eval(input()))
A = list(map(int, input().split())) # n個の文字列がリストに格納される
for i in range(N-1):
print... | N = int(input())
A = list(map(int, input().split())) # n個の文字列がリストに格納される
ans = [0] * N
for a in A:
ans[a-1] += 1
print(*ans,sep='\n')
| p02707 |
from collections import Counter
def LI():return list(map(int,input().split()))
n=int(eval(input()))
a=LI()
c=Counter(a)
for i in range(1,n+1):
ans=c[i]
print(ans)
| from collections import*
n,*a=list(map(int,open(0).read().split()));c=Counter(a)
for i in range(n):print((c[i+1])) | p02707 |
from collections import*
n,*a=list(map(int,open(0).read().split()));c=Counter(a)
for i in range(n):print((c[i+1])) | n,*a=list(map(int,open(0).read().split()));c=[0]*n
for q in a:c[q-1]+=1
for d in c:print(d) | p02707 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n-1):
j=i
k=0
while j<n-1:
if i+1==a[j]:
k=k+1
j=j+1
print(k)
print((0))
| n=int(eval(input()))
a=list(map(int,input().split()))
jyoshi=[0]*n
for i in range(n-1):
jyo=a[i]
jyoshi[jyo-1]=jyoshi[jyo-1]+1
for k in jyoshi:
print(k) | p02707 |
n=int(eval(input()))
l=list(map(int,input().split()))
from collections import *
c=Counter(l)
for i in range(n): print((c[i+1])) | n=int(eval(input()))
from collections import *
c=Counter(list(map(int,input().split())))
for i in range(n): print((c[i+1])) | p02707 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
for i in range(N):
n = A.count(i+1)
print(n)
if i+1 in A:
A.remove(i+1) | N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [0] * N
for i in range(N-1):
B[(A[i]-1)] += 1
for j in range(N):
print((B[j])) | p02707 |
import sys
n = int(eval(input()))
A = list(map(int, sys.stdin.readline().split()))
ans = [0] * n
for i in A:
ans[i-1] += 1
for j in ans:
print(j) | import sys
n = int(eval(input()))
A = list(map(int, sys.stdin.readline().split()))
ans = [0] * n
for i in A:
ans[i-1] += 1
print(('\n'.join(map(str, ans)))) | p02707 |
N=int(eval(input()))
A_r=list(input().split())
A=[int(x) for x in A_r]
for i in range(N):
print((len([j for j,x in enumerate(A) if x==i+1])))
| N=int(eval(input()))
A_r=list(input().split())
A=[int(x) for x in A_r]
B=[0 for i in range(N)]
for i in range(len(A)):
B[A[i]-1]+=1
for i in range(len(B)):
print((B[i])) | p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(1, N+1):
print((A.count(i))) | N = int(input())
A = list(map(int, input().split()))
l = [0]*N
for i in A:
l[i-1] += 1
print(*l, sep="\n")
| p02707 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1, n+1):
cnt = 0
for j in a:
if i == j:
cnt += 1
print(cnt)
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = {}
for i in a:
cnt.setdefault(i, 0)
cnt[i] += 1
for i in range(1, n+1):
cnt.setdefault(i, 0)
print((cnt[i]))
| p02707 |
N = int(eval(input()))
arr = list(map(int, input().split()))
for i in range(1,N+1,1):
print((arr.count(i))) | N = int(eval(input()))
arr = list(map(int, input().split()))
ans = [0]*N
for i in range(N-1):
ans[(arr[i])-1] += 1
for i in range(len(ans)):
print((ans[i])) | p02707 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
print((Counter(A)[i + 1]))
if __name__ == "__main__":
main()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
from collections import Counter
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
count = Counter(A)
for i in range(N):
print((count[i + 1]))
if __name__ == "__main__":
main()
| p02707 |
社員数 = int(eval(input()))
上司 = list(map(int, input().split(' ')))
for 社員番号 in range(1, 社員数+1):
print((上司.count(社員番号)))
| num_employee = int(eval(input()))
num_subordinate = [0] * num_employee
for boss in map(int, input().split(' ')):
num_subordinate[boss-1] += 1
print(('\n'.join(map(str, num_subordinate))))
| p02707 |
社員数 = int(input())
部下数 = [0] * 社員数
for 上司 in map(int, input().split(' ')):
部下数[上司-1] += 1
[print(部下) for 部下 in 部下数]
| 社員数 = int(eval(input()))
部下数 = [0] * 社員数
for 上司 in input().split(' '):
部下数[int(上司)-1] += 1
print(('\n'.join(map(str, 部下数))))
| p02707 |
社員数 = int(eval(input()))
部下数 = [0] * 社員数
for 上司 in input().split(' '):
部下数[int(上司)-1] += 1
print(('\n'.join(map(str, 部下数))))
| a = int(eval(input()))
b = [0] * a
for c in map(int, input().split()):
b[c-1] += 1
print(('\n'.join(map(str, b))))
| p02707 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
print((a.count(i + 1)))
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = [0]* n
for i in a:
ans[i - 1] += 1
for i in range(n):
print((ans[i]))
| p02707 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
for i in range(1,n+1):
print((a.count(i))) | n=int(eval(input()))
a=[int(i) for i in input().split()]
b={i:0 for i in range(1,n+1)}
for i in a:
b[i]+=1
for i in list(b.values()):
print(i) | p02707 |
N = int(eval(input()))
boss = input().split(" ")
for i in range(1,N+1):
print((boss.count(str(i))))
| N = int(eval(input()))
l = [0]*N
boss = input().split(" ")
for i in range(N-1):
l[int(boss[i])-1]+=1
for j in range(N):
print((l[j]))
| p02707 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * (N+1)
for i in range(1, N+1):
ans[i] = A.count(i)
for a in ans[1:]:
print(a) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * (N+1)
for a in A:
ans[a] += 1
for a in ans[1:]:
print(a) | p02707 |
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(1,N+1):
print((A.count(i))) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*N
for i in A:
ans[i-1] += 1
for j in ans:
print(j)
| p02707 |
n = int(eval(input()))
List = list(map(int, input().split(" ")))
a = 1
for i in range(n):
m = List.count(a)
a += 1
print(m) | N = int(eval(input()))
List = list(map(int,input().split()))
List2 = [0]*N
for i in range(N-1):
List2[List[i-1]-1] += 1
for j in List2:
print(j) | p02707 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
print((A.count(i+1)))
main() | N = int(eval(input()))
A = list(map(int, input().split()))
bukaninzu_list = N * [0]
for i in range(N-1):
bukaninzu_list[A[i]-1] += 1
for bukaninzu in bukaninzu_list:
print(bukaninzu) | p02707 |
n = int(eval(input()))
a = [0]
a += list(map(int,input().split()))
b = [0]*n
for i in range(n):
print((a.count(i+1)))
| n = int(eval(input()))
a = [0]
a += list(map(int,input().split()))
b = [0]*n
for i in range(n-1,0,-1):
b[a[i]-1] += 1
for i in b:
print(i)
| p02707 |
n = int(eval(input()))
ai = list(map(int, input().split()))
for i in range(n):
print((ai.count(i+1))) | n = int(eval(input()))
ai = list(map(int, input().split()))
ans = [0]*n
for i in range(len(ai)):
ans[ai[i]-1] += 1
for i in range(len(ans)):
print((ans[i])) | p02707 |
from collections import Counter
n = int(eval(input()))
Al = list(input().split())
count = Counter(Al)
for i in range(n):
if str(i + 1) in Al:
print((count[str(i+1)]))
else:
print((0)) | from collections import Counter
n = int(eval(input()))
Al = list(input().split())
cdict = Counter(Al)
for i in range(n):
print((cdict[str(i+1)])) | p02707 |
N = int(eval(input()))
d = list(map(int, input().split()))
for j in range(1, N+1):
count = 0
for i in range(len(d)):
if j == d[i]:
count += 1
print(count) | N = int(eval(input()))
d = list(map(int, input().split()))
p = [0] * N
for i in range(N - 1):
p[d[i] - 1] += 1
for i in range(N):
print((p[i])) | p02707 |
from collections import Counter
n = int(eval(input()))
a = Counter(list(map(int, input().split())))
for i in range(n):
print((a[i+1])) | n = int(eval(input()))
a = list(map(int, input().split()))
s = [0]*n
for i in a:
s[i-1] += 1
for i in s:
print(i) | p02707 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
count = Counter(a)
for i in range(n):
if i+1 in count:
print((count[i+1]))
else:
print((0)) | n = int(input())
a = list(map(int, input().split()))
l = [0]*n
for i in a: l[i-1] += 1
print(*l, sep='\n')
| p02707 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int,input().split()))
d = defaultdict(int)
for i in A:
d[i] += 1
for i in range(1,N+1):
print((d[i])) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0] * N
for i in range(N-1):
ans[A[i] - 1] += 1
for i in range(N):
print((ans[i])) | p02707 |
N = int(eval(input()))
#A = [0]
B = list(map(int, input().split()))
#A += B
#print(A)
sig = [0] * N
for i in range(N-1):
print((B.count(i+1)))
print((0))
#print(sig)
#for i in sig:
# print(i) | N = int(eval(input()))
A = [0]
B = list(map(int, input().split()))
A += B
#print(A)
sig = [0] * N
for i in range(N-1):
sig[A[i+1]-1] += 1
#print(sig)
#print(sig)
for i in sig:
print(i) | p02707 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = [0]*n
for i in range(max(a)):
s[i] = a.count(i+1)
for i in range(n):
print((s[i])) | n = int(eval(input()))
a = list(map(int,input().split()))
c = [0]*n
for i in a:
c[i-1] += 1
for i in range(n):
print((c[i])) | p02707 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
for i in range(1,n+1):
print((a.count(i))) | N = int(eval(input()))
K = [0]*N
A = [int(i) for i in input().split()]
for i in range(N-1):
K[A[i]-1] += 1
for i in K:
print(i) | p02707 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
print((a.count(i + 1)))
| n = int(eval(input()))
a = list(map(int, input().split()))
result = [0] * n
for x in a:
result[x-1] += 1
for v in result:
print(v) | p02707 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.