problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02773
|
def main():
n = int(input())
ss = {}
max_s = -1
for _ in range(n):
s = input()
if s not in ss:
ss[s] = 0
else:
ss[s] += 1
max_s = max(max_s, ss[s])
ss = sorted(ss.items(), key=lambda x: x[0])
anss = [s for s, i in ss if i == max_s]
for ans in anss:
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(input())
ss = {}
max_s = 0
for _ in range(n):
s = input()
if s not in ss:
ss[s] = 0
else:
ss[s] += 1
max_s = max(max_s, ss[s])
ss = sorted(ss.items(), key=lambda x: x[0])
anss = [s for s, i in ss if i == max_s]
for ans in anss:
print(ans)
if __name__ == "__main__":
main()
|
[
"assignment.value.change",
"expression.operation.unary.remove"
] | 570,643
| 570,644
|
u044964932
|
python
|
p02773
|
import collections
N = int(input())
S = [input() for _ in range(N)]
if len(S) == len(set(S)):
ans = S
else:
ans = []
c = collections.Counter(S)
c_common = c.most_common()
max_vote = c_common[0][1]
for k in range(len(S)):
if c_common[k][1]== max_vote:
ans.append(c_common[k][0])
else:
break
[print(a) for a in sorted(ans)]
|
import collections
N = int(input())
S = [input() for _ in range(N)]
if len(S) == len(set(S)):
ans = S
else:
ans = []
c = collections.Counter(S)
c_common = c.most_common()
max_vote = c_common[0][1]
for k in range(len(set(S))):
if c_common[k][1]== max_vote:
ans.append(c_common[k][0])
else:
break
[print(a) for a in sorted(ans)]
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 570,645
| 570,646
|
u760961723
|
python
|
p02773
|
N = int(input())
S = list()
for i in range(N):
S.append(str(input()))
import collections
counter = Counter(S)
max_cnt = max(counter.values())
names = [n for n,c in counter.items() if c==max_cnt]
names.sort()
print(*names, sep='\n')
|
N = int(input())
S = list()
for i in range(N):
S.append(str(input()))
import collections
counter = collections.Counter(S)
max_cnt = max(counter.values())
names = [n for n,c in counter.items() if c==max_cnt]
names.sort()
print(*names, sep='\n')
|
[] | 570,649
| 570,650
|
u382639013
|
python
|
p02773
|
n = int(input())
dic = {}
lis = []
lis2 = []
for i in range(n):
moji = input()
if moji not in dic:
dic[moji] = 0
dic[moji] += 1
for i in sorted(dic.items(), key=lambda x:x[1]):
lis.append(i)
lis.reverse()
for j in lis:
if lis[0][1] == j[1]:
lis2.append(j[0])
else:
break
for i in range(len(lis2)):
print(lis2[i])
|
#10e5程度ならソートしてもTLEならないらしい？
n = int(input())
dic = {}
lis = []
lis2 = []
for i in range(n):
moji = input()
if moji not in dic:
dic[moji] = 0
dic[moji] += 1
for i in sorted(dic.items(), key=lambda x:x[1]):
lis.append(i)
lis.reverse()
for j in lis:
if lis[0][1] == j[1]:
lis2.append(j[0])
else:
break
lis2.sort()
for i in range(len(lis2)):
print(lis2[i])
|
[
"call.add"
] | 570,659
| 570,660
|
u294385082
|
python
|
p02773
|
n = int(input())
dic = {}
lis = []
lis2 = []
for i in range(n):
moji = input()
if moji not in dic:
dic[moji] = 0
dic[moji] += 1
for i in sorted(dic.items(), key=lambda x:x[1]):
lis.append(i)
lis.reverse()
for j in lis:
if lis[0][1] == j[1]:
lis2.append(j[0])
else:
break
for i in range(len(lis2)):
print(lis2[i])
|
n = int(input())
dic = {}
lis = []
lis2 = []
for i in range(n):
moji = input()
if moji not in dic:
dic[moji] = 0
dic[moji] += 1
for i in sorted(dic.items(), key=lambda x:x[1]):
lis.append(i)
lis.reverse()
for j in lis:
if lis[0][1] == j[1]:
lis2.append(j[0])
else:
break
lis2.sort()
for i in range(len(lis2)):
print(lis2[i])
|
[
"call.add"
] | 570,659
| 570,661
|
u294385082
|
python
|
p02773
|
import collections
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
s=Counter(s)
p=[]
k=s.most_common()
p.append(k[0][0])
for i in range(len(collections.Counter(s))-1):
if k[i][1]==k[i+1][1]:
p.append(k[i+2][0])
else:
break
p=sorted(p)
for i in range(len(p)):
print(p[i])
|
import collections
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
s=Counter(s)
p=[]
k=s.most_common()
p.append(k[0][0])
for i in range(len(collections.Counter(s))-1):
if k[i][1]==k[i+1][1]:
p.append(k[i+1][0])
else:
break
p=sorted(p)
for i in range(len(p)):
print(p[i])
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 570,664
| 570,665
|
u646203242
|
python
|
p02773
|
n = int(input())
s = {}
for i in range(n):
temp = input()
if temp in s:
s[temp] += 1
else:
s[temp] = 1
max_s_val = max(s.value())
t = [k for k, v in s.items() if v == max_s_val]
t.sort()
for i in range(len(t)):
print(t[i])
|
n = int(input())
s = {}
for i in range(n):
temp = input()
if temp in s:
s[temp] += 1
else:
s[temp] = 1
max_s_val = max(s.values())
t = [k for k, v in s.items() if v == max_s_val]
t.sort()
for i in range(len(t)):
print(t[i])
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 570,668
| 570,669
|
u235027735
|
python
|
p02773
|
N = int(input())
A = [input() for _ in range(N)]
dic = {}
for i in range(N):
dic[A[i]] = 0
for i in range(N):
dic[A[i]] += 1
k = dic[max(dic)]
dic = sorted(dic.items(), key=lambda x:x[0])
for el in dic:
if el[1] == k:
print(el[0])
|
N = int(input())
A = [input() for _ in range(N)]
dic = {}
for i in range(N):
dic[A[i]] = 0
for i in range(N):
dic[A[i]] += 1
k = max(dic.values())
dic = sorted(dic.items(), key=lambda x:x[0])
for el in dic:
if el[1] == k:
print(el[0])
|
[
"call.add"
] | 570,672
| 570,673
|
u662615460
|
python
|
p02773
|
n=int(input())
l={}
ans=[]
for i in range(n):
s=input()
if s in l:
l[s]+=1
else:
l.setdefault(s,1)
max_l=max(l.values)
for i in l.keys():
if l[i]==max_l:
ans.append(i)
ans.sort()
for j in ans:
print(j)
|
n=int(input())
l={}
ans=[]
for i in range(n):
s=input()
if s in l:
l[s]+=1
else:
l.setdefault(s,1)
max_l=max(l.values())
for i in l.keys():
if l[i]==max_l:
ans.append(i)
ans.sort()
for j in ans:
print(j)
|
[
"call.add"
] | 570,676
| 570,677
|
u185405877
|
python
|
p02773
|
import collections
n=int(input())
s=[]
for _ in range(n):
s.append(str(input()))
ans=collections.Counter(s)
a=max(ans.values())
ans=[i for i,k in ans.items() if a==k]
print(*ans.sort(),sep="\n")
|
import collections
n=int(input())
s=[]
for _ in range(n):
s.append(str(input()))
ans=collections.Counter(s)
a=max(ans.values())
ans=[i for i,k in ans.items() if a==k]
print(*sorted(ans),sep="\n")
|
[
"call.arguments.change",
"io.output.change"
] | 570,680
| 570,681
|
u387080888
|
python
|
p02773
|
from collections import Counter
n = int(input())
S = []
for _ in range(n):
s = input()
S.append(s)
cnt = Counter(S)
l = max(cnt.values())
ans = []
for k,v in cnt.items():
if v == l:
ans.append(k)
print(ans)
ans.sort()
for i in ans:
print(i)
|
from collections import Counter
n = int(input())
S = []
for _ in range(n):
s = input()
S.append(s)
cnt = Counter(S)
l = max(cnt.values())
ans = []
for k,v in cnt.items():
if v == l:
ans.append(k)
ans.sort()
for i in ans:
print(i)
|
[
"call.remove"
] | 570,682
| 570,683
|
u849229491
|
python
|
p02773
|
n = int(input())
d = {}
for i in range(n):
s = input()
d[s] = d.get(s, 0) + 1
m = max(d[i] for i in d)
print(m, d)
for j in sorted(d):
if d[j] == m:
print(j)
|
n = int(input())
d = {}
for i in range(n):
s = input()
d[s] = d.get(s, 0) + 1
m = max(d[i] for i in d)
for j in sorted(d):
if d[j] == m:
print(j)
|
[
"call.remove"
] | 570,684
| 570,685
|
u048176319
|
python
|
p02773
|
N=int(input())
cnt = {}
for _ in range(N):
s = input()
if s not in cnt:cnt[s]=0
cnt[s]+=1
max_val = max([cnt[v] for v in cnt])
l = [v for v in cnt if cnt[v]==max_val]
sorted(l)
print('\n'.join(l))
|
N=int(input())
cnt = {}
for _ in range(N):
s = input()
if s not in cnt:cnt[s]=0
cnt[s]+=1
max_val = max([cnt[v] for v in cnt])
l = [v for v in cnt if cnt[v]==max_val]
l.sort()
print('\n'.join(l))
|
[
"call.remove",
"call.add"
] | 570,686
| 570,687
|
u221061152
|
python
|
p02773
|
N=int(input())
cnt = {}
for _ in range(N):
s = input()
if s not in cnt:cnt[s]=0
cnt[s]+=1
max_val = max([cnt[v] for v in cnt])
l = [v for v in cnt if cnt[v]==max_val]
print('\n'.join(l))
|
N=int(input())
cnt = {}
for _ in range(N):
s = input()
if s not in cnt:cnt[s]=0
cnt[s]+=1
max_val = max([cnt[v] for v in cnt])
l = [v for v in cnt if cnt[v]==max_val]
l.sort()
print('\n'.join(l))
|
[
"call.add"
] | 570,688
| 570,687
|
u221061152
|
python
|
p02770
|
def main():
import numpy as np
k, q = map(int, input().split())
d = np.array(list(map(int, input().split())))
for i in range(q):
n, x, m = map(int, input().split())
x %= m
d_mod = d % m
zero_d = k - np.count_nonzero(d_mod)
d_mod_sum = np.sum(d_mod) + m * zero_d
rep = (n-1) // k
rem = (n-1) % k
zero_rem = len(d_mod[:rem]) - np.count_nonzero(d_mod[:rem])
rem_sum = np.sum(d_mod[:rem]) + m * zero_rem
ans = n - 1 - (x + d_mod_sum * rep + rem_sum) // m
print(ans)
print(rem_sum)
if __name__ == '__main__':
main()
|
def main():
import numpy as np
k, q = map(int, input().split())
d = np.array(list(map(int, input().split())))
for i in range(q):
n, x, m = map(int, input().split())
x %= m
d_mod = d % m
zero_d = k - np.count_nonzero(d_mod)
d_mod_sum = np.sum(d_mod) + m * zero_d
rep = (n-1) // k
rem = (n-1) % k
zero_rem = len(d_mod[:rem]) - np.count_nonzero(d_mod[:rem])
rem_sum = np.sum(d_mod[:rem]) + m * zero_rem
ans = n - 1 - (x + d_mod_sum * rep + rem_sum) // m
print(ans)
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 570,713
| 570,714
|
u711693740
|
python
|
p02770
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
mod = 10**9+7 #出力の制限
N = 10**5 * 2
def cmb(n, r):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def p(n,r):
if ( r<0 or r>n ):
return 0
return g1[n] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
# a = cmb(n,r)
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
k,q = m()
d = l()
for i in range(q):
n,x,mm = m()
co = 0
po = []
for j in range(k):
po.append(d[j] % mm)
for j in range(k):
if po[j] == 0:
ccc = ((n-1)//k)
if (n-1)%k >= j:
ccc += 1
co += ccc
pp = sum(po) * ((n-1)//k)
pp += x
for j in range((n-1)%k):
pp += po[j]
co += (pp//mm) - (x//mm)
print((n-co-1))
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
mod = 10**9+7 #出力の制限
N = 10**5 * 2
def cmb(n, r):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def p(n,r):
if ( r<0 or r>n ):
return 0
return g1[n] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
# a = cmb(n,r)
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
k,q = m()
d = l()
for i in range(q):
n,x,mm = m()
co = 0
po = []
for j in range(k):
#po.append(d[j] % mm if d[j] % mm > 0 else mm)
po.append(d[j] % mm)
for j in range(k):
if po[j] == 0:
ccc = ((n-1)//k)
if (n-1)%k >= j+1:
ccc += 1
co += ccc
pp = sum(po) * ((n-1)//k)
pp += x
for j in range((n-1)%k):
pp += po[j]
co += (pp//mm) - (x//mm)
print((n-co-1))
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 570,756
| 570,757
|
u807772568
|
python
|
p02770
|
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
k,q = LI()
d = LI()
for _ in range(q):
n,x,m = LI()
a = [((i-1)%m)+1 for i in d]
S = sum(a)
r = n//k
s = S*r+(x%m)
for i in range((n-1)%k):
s += a[i]
print(n-1-(s//m))
return
#Solve
if __name__ == "__main__":
solve()
|
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
k,q = LI()
d = LI()
for _ in range(q):
n,x,m = LI()
a = [((i-1)%m)+1 for i in d]
S = sum(a)
r = (n-1)//k
s = S*r+(x%m)
for i in range((n-1)%k):
s += a[i]
print(n-1-(s//m))
return
#Solve
if __name__ == "__main__":
solve()
|
[] | 570,762
| 570,763
|
u585482323
|
python
|
p02770
|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
k,q = map(int,input().split())
D =list(map(int,input().split()))
for _ in range(q):
n,x,m = map(int,input().split())
DD = [(d-1+m)%m+1 for d in D]
tmp = x; s = (n-1) // k
for i, di in enumerate(DD):
tmp += di*(s + int(n%k-1 > i))
print(n-1-(tmp//m-x//m))
|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
k,q = map(int,input().split())
D =list(map(int,input().split()))
for _ in range(q):
n,x,m = map(int,input().split())
DD = [(d-1+m)%m+1 for d in D]
tmp = x; s = (n-1) // k
for i, di in enumerate(DD):
tmp += di*(s + int((n-1)%k > i))
print(n-1-(tmp//m-x//m))
|
[
"call.arguments.change",
"expression.operation.binary.remove"
] | 570,772
| 570,773
|
u716530146
|
python
|
p02770
|
k,q=map(int,input().split())
d=list(map(int,input().split()))
for i in range(q):
n,x,m=map(int,input().split())
l=[i%m if i%m!=0 else m for i in d]
print(n-1-(x+((n-1)//k)*sum(l)+sum(l[:(n-1)%k]))//m+x//k)
|
k,q=map(int,input().split())
d=list(map(int,input().split()))
for i in range(q):
n,x,m=map(int,input().split())
l=[i%m if i%m!=0 else m for i in d]
print(n-1-(x+((n-1)//k)*sum(l)+sum(l[:(n-1)%k]))//m+x//m)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 570,811
| 570,812
|
u619819312
|
python
|
p02770
|
k,q=map(int,input().split())
d=list(map(int,input().split()))
for i in range(q):
n,x,m=map(int,input().split())
l=[i%m if i%m!=0 else m for i in d]
print(n-1-(x+((n-1)//k)*sum(l)+sum(l[:(n-1)%k]))//m+x//k)
|
k,q=map(int,input().split())
d=list(map(int,input().split()))
for i in range(q):
n,x,m=map(int,input().split())
l=[i%m if i%m!=0 else m for i in d]
print(n-1-(x+((n-1)//k)*sum(l)+sum(l[:(n-1)%k]))//m+x//m)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 570,813
| 570,812
|
u619819312
|
python
|
p02773
|
from collections import Counter
n=int(split())
l=[input() for i in range(n)]
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in c.items() if v==d]
max_list.sort()
for j in max_list:
print(j)
|
from collections import Counter
n=int(input())
l=[input() for i in range(n)]
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in c.items() if v==d]
max_list.sort()
for j in max_list:
print(j)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 570,829
| 570,830
|
u067447457
|
python
|
p02773
|
import collections
n = int(input())
si = []
for i in range(n):
si.append(input())
ss = collections.Counter(si)
print(ss)
n_ma = max(ss.values())
ans = []
for i in ss.keys():
if ss[i] == n_ma:
ans.append(i)
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
import collections
n = int(input())
si = []
for i in range(n):
si.append(input())
ss = collections.Counter(si)
n_ma = max(ss.values())
ans = []
for i in ss.keys():
if ss[i] == n_ma:
ans.append(i)
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
[
"call.remove"
] | 570,840
| 570,841
|
u737758066
|
python
|
p02773
|
import collections
n = int(input())
si = []
for i in range(n):
si.append(input())
ss = collections.Counter(si)
print(ss)
n_ma = max(ss.values())
ans = []
for i in ss.keys():
if ss[i] == n_ma:
ans.append(i)
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
import collections
n = int(input())
si = []
for i in range(n):
si.append(input())
ss = collections.Counter(si)
n_ma = max(ss.values())
ans = []
for i in ss.keys():
if ss[i] == n_ma:
ans.append(i)
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
[
"call.remove"
] | 570,840
| 570,842
|
u737758066
|
python
|
p02773
|
n=int(input())
box={}
for i in range(n):
vote=input()
if not(vote in box):
box[vote]=1
else:
box[vote]+=1
m=0
win=[]
for num in box.values():
if num > m:
m=num
for name,num in box.items():
if num==m:
win.append(name)
sorted(win)
for i in win:
print(i)
|
n=int(input())
box={}
for i in range(n):
vote=input()
if not(vote in box):
box[vote]=1
else:
box[vote]+=1
m=0
win=[]
for num in box.values():
if num > m:
m=num
for name,num in box.items():
if num==m:
win.append(name)
win=sorted(win)
for i in win:
print(i)
|
[
"assignment.add"
] | 570,845
| 570,846
|
u131638468
|
python
|
p02773
|
import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
c = Counter(s)
m = max(c.values())
ans = [s for s, c in cnt.items() if c == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
|
import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
c = Counter(s)
m = max(c.values())
ans = [s for s, v in c.items() if v == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.change"
] | 570,851
| 570,852
|
u254871849
|
python
|
p02773
|
import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
c = Counter(s)
m = max(c.values())
ans = [s for s, c in cnt.items if c == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
|
import sys
from collections import Counter
n, *s = sys.stdin.read().split()
def main():
c = Counter(s)
m = max(c.values())
ans = [s for s, v in c.items() if v == m]
print(*sorted(ans), sep='\n')
if __name__ == '__main__':
main()
|
[
"assignment.value.change",
"identifier.change",
"call.add"
] | 570,853
| 570,852
|
u254871849
|
python
|
p02773
|
N=int(input())
S=[input() for i in range(N)]
S=sorted(S)
cnt=1
max_cnt=1
ans=[S[0]]
for i in range(N-1):
if S[i]==S[i+1]:
cnt+=1
else:
cnt=1
if cnt==max_cnt:
ans.append(S[i+1])
if cnt>max_cnt:
ans=[S[i+1]]
ans=sorted(ans)
for i in ans:
print(i)
|
N=int(input())
S=[input() for i in range(N)]
S=sorted(S)
cnt=1
max_cnt=1
ans=[S[0]]
for i in range(N-1):
if S[i]==S[i+1]:
cnt+=1
else:
cnt=1
if cnt==max_cnt:
ans.append(S[i+1])
if cnt>max_cnt:
max_cnt=cnt
ans=[S[i+1]]
ans=sorted(ans)
for i in ans:
print(i)
|
[
"assignment.add"
] | 570,858
| 570,859
|
u962330718
|
python
|
p02773
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=itemgetter(1)):
if val == tmp:
print(key)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=itemgetter(0)):
if val == tmp:
print(key)
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 570,864
| 570,865
|
u285891772
|
python
|
p02773
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), lambda x:x[0]):
if val == tmp:
print(key)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=itemgetter(0)):
if val == tmp:
print(key)
|
[
"call.arguments.change"
] | 570,866
| 570,865
|
u285891772
|
python
|
p02773
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=itemgetter(1)):
if val == tmp:
print(key)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=itemgetter(0)):
if val == tmp:
print(key)
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 570,867
| 570,865
|
u285891772
|
python
|
p02773
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), lambda x:x[0]):
if val == tmp:
print(key)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
S = [input() for _ in range(N)]
cnt_s = Counter(S)
tmp = cnt_s.most_common()[0][1]
for key, val in sorted(cnt_s.most_common(), key=lambda x:x[0]):
if val == tmp:
print(key)
|
[
"call.arguments.keyword_argument.add"
] | 570,866
| 570,868
|
u285891772
|
python
|
p02773
|
n = int(input())
dic = {}
for i in range(n):
s = input()
if s not in dic: dic[s] = 1
else: dic[s] += 1
v = dic.values()
v = sorted(v)
max_num = v[n-1]
ans = []
for s in dic:
if dic[s]==max_num:
ans.append(s)
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
n = int(input())
dic = {}
for i in range(n):
s = input()
if s not in dic: dic[s] = 1
else: dic[s] += 1
v = dic.values()
v = sorted(v)
max_num = v[len(v)-1]
ans = []
for s in dic:
if dic[s]==max_num:
ans.append(s)
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
[
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 570,869
| 570,870
|
u472696272
|
python
|
p02773
|
N = int(input())
l = []
for _ in range(N):
s = str(input())
l.append(s)
import collections
c = collections.Counter(l)
c = c.most_common()
most_count = c[0][1]
for i in range(len(c)):
if c[i][1] == most_count:
print(c[i][0])
|
N = int(input())
l = []
for _ in range(N):
s = str(input())
l.append(s)
import collections
c = collections.Counter(l)
c = c.most_common()
most_count = c[0][1]
c.sort()
for i in range(len(c)):
if c[i][1] == most_count:
print(c[i][0])
|
[
"call.add"
] | 570,871
| 570,872
|
u961945062
|
python
|
p02773
|
import math
from functools import reduce
import itertools
#入力:N(int:整数)
def input1():
return int(input())
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
N=input1()
S=[]
for _ in range(N):
S.append(str(input()))
dic={}
results=[]
for s in S:
if s not in dic:
dic[s]=1
else:
dic[s]+=1
ans=10000010010
score_sorted = sorted(dic.items(), key=lambda x:x[1])
print(score_sorted)
max_count=max(dic.values())
for x in score_sorted:
if x[1]==max_count:
results.append(x[0])
results.sort()
for i in results:
print(i)
|
import math
from functools import reduce
import itertools
#入力:N(int:整数)
def input1():
return int(input())
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
N=input1()
S=[]
for _ in range(N):
S.append(str(input()))
dic={}
results=[]
for s in S:
if s not in dic:
dic[s]=1
else:
dic[s]+=1
ans=10000010010
score_sorted = sorted(dic.items(), key=lambda x:x[1])
max_count=max(dic.values())
for x in score_sorted:
if x[1]==max_count:
results.append(x[0])
results.sort()
for i in results:
print(i)
|
[
"call.remove"
] | 570,873
| 570,874
|
u602773379
|
python
|
p02773
|
import collections as col
N = int(input())
l = [0]*N
for i in range(N):
l[i] = input()
ans = []
counter = col.Counter(l)
common = counter.most_common()
ans = []
ans.append(common[0][0])
for i in range(len(common)-1):
if common[i][1] == common[i+1][1]:
ans.append(common[i+1][0])
i += 1
else:
break
for i in range(len(ans)):
print(ans[i])
|
import collections as col
N = int(input())
l = [0]*N
for i in range(N):
l[i] = input()
ans = []
counter = col.Counter(l)
common = counter.most_common()
ans = []
ans.append(common[0][0])
for i in range(len(common)-1):
if common[i][1] == common[i+1][1]:
ans.append(common[i+1][0])
i += 1
else:
break
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
[
"call.add"
] | 570,881
| 570,882
|
u617718239
|
python
|
p02773
|
from collections import Counter
n=int(input())
name=[input() for _ in range(n)]
cnt=Counter(name)
l=max(cnt.values())
ans=[s for s,c in cnt.items() if c==1]
ans.sort()
print('\n'.join(ans))
|
from collections import Counter
n = int(input())
sss = [input() for _ in range(n)]
cnt = Counter(sss)
l = max(cnt.values())
ans = [s for s, c in cnt.items() if c == l]
ans.sort()
print('\n'.join(ans))
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 570,889
| 570,890
|
u121879791
|
python
|
p02773
|
from collections import *
_,*a=map(lambda x:x.rstrip(), open(0))
a=Counter(a).most_common()
a=[i[0] for i in a if i[1]==a[0][1]]
print(*a,sep="\n")
|
from collections import *
_,*a=map(lambda x:x.rstrip(), open(0))
a=Counter(a).most_common()
a=sorted([i[0] for i in a if i[1]==a[0][1]])
print(*a,sep="\n")
|
[
"call.add",
"call.arguments.change"
] | 570,891
| 570,892
|
u443151804
|
python
|
p02773
|
N = int(input())
List = [input() for i in range(N)]
from collections import Counter
C = Counter(List)
C = C.most_common()
Newlist = []
for p in range(N):
if C[p][1] == C[0][1]:
Newlist.append(C[p][0])
else:
break
Newlist.sort()
for i in range(len(Newlist)):
print(Newlist[i])
|
N = int(input())
List = [input() for i in range(N)]
from collections import Counter
C = Counter(List)
C = C.most_common()
Newlist = []
for p in range(len(C)):
if C[p][1] == C[0][1]:
Newlist.append(C[p][0])
else:
break
Newlist.sort()
for i in range(len(Newlist)):
print(Newlist[i])
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 570,895
| 570,896
|
u112629957
|
python
|
p02773
|
import collections
n = int(input())
s_ = [input() for i in range(n)]
cnt = collections.Counter(s_)
cntList = list(cnt.most_common())
cnt_f = cnt.most_common()[0][1]
resList = []
for i in range(n):
if cntList[i][1] == cnt_f:
resList.append(cntList[i][0])
else:
break
resList.sort()
for i in resList:
print(i)
|
import collections
n = int(input())
s_ = [input() for i in range(n)]
cnt = collections.Counter(s_)
cntList = list(cnt.most_common())
cnt_f = cnt.most_common()[0][1]
resList = []
for i in range(len(cntList)):
if cntList[i][1] == cnt_f:
resList.append(cntList[i][0])
else:
break
resList.sort()
for i in resList:
print(i)
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 570,899
| 570,900
|
u815304751
|
python
|
p02773
|
import collections
n=int(input())
s=[input() for _ in range(n)]
c=collections.counter(s)
common=c.most_common()
value,cnt=zip(*common)
common.sort(key=lambda x:x[0])
m=max(cnt)
for cc in most_common:
if cc[1]==max:
print(cc[0])
|
import collections
n=int(input())
s=[input() for _ in range(n)]
c=collections.Counter(s)
common=c.most_common()
value,cnt=zip(*common)
common.sort(key=lambda x:x[0])
m=max(cnt)
for cc in common:
if cc[1]==m:
print(cc[0])
|
[
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 570,901
| 570,902
|
u932868243
|
python
|
p02773
|
n = int(input())
s = list(input() for i in range(n))
import collections
A = collections.Counter(S)
B = max(A.values())
C = [i for i in A if A[i] == B]
C = sorted(C)
for i in C:
print(i)
|
n = int(input())
s = list(input() for i in range(n))
import collections
A = collections.Counter(s)
B = max(A.values())
C = [i for i in A if A[i] == B]
C = sorted(C)
for i in C:
print(i)
|
[
"misc.typo",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 570,903
| 570,904
|
u643498327
|
python
|
p02773
|
N = int(input())
S = list(input() for i in range(N)) #スペース抜きの単語を複数行
A = {}
for i in S:
A.setdefault(i, 1)
A[i] += 1
B = max(A.values())
C = [i for i in A if A[i] == B]
C = sorted(C)
print(C)
|
N = int(input())
S = list(input() for i in range(N)) #スペース抜きの単語を複数行
A = {}
for i in S:
A.setdefault(i, 1)
A[i] += 1
B = max(A.values())
C = [i for i in A if A[i] == B]
C = sorted(C)
for i in C:
print(i)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 570,905
| 570,906
|
u620238824
|
python
|
p02773
|
from collections import Counter
N=int(input())
listS=[]
for i in range(N):
S=input()
listS+=[S]
listS=Counter(listS).most_common()
ans=[]
MAX=listS[0][1]
for i in range(N):
if listS[i][1]==MAX:
ans+=[listS[i][0]]
else:
break
ans.sort()
for i in ans:
print(i)
|
from collections import Counter
N=int(input())
listS=[]
for i in range(N):
S=input()
listS+=[S]
listS=Counter(listS).most_common()
ans=[]
MAX=listS[0][1]
for i in range(len(listS)):
if listS[i][1]==MAX:
ans+=[listS[i][0]]
else:
break
ans.sort()
for i in ans:
print(i)
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 570,907
| 570,908
|
u829249049
|
python
|
p02773
|
N=int(input())
listS=[]
for i in range(N):
S=input()
listS+=[S]
listS.sort()
counter=[]
count=1
for i in range(N-1):
if listS[i]==listS[i+1]:
count+=1
else:
counter+=[count]
count=1
counter+=[count]
MAX=max(counter)
count=1
for i in range(N-1):
if listS[i]==listS[i+1]:
count+=1
else:
count=1
if count==MAX:
print(listS[i])
if count==MAX:
print(listS[-1])
|
N=int(input())
listS=[]
for i in range(N):
S=input()
listS+=[S]
listS.sort()
counter=[]
count=1
for i in range(N-1):
if listS[i]==listS[i+1]:
count+=1
else:
counter+=[count]
count=1
counter+=[count]
MAX=max(counter)
count=1
for i in range(N-1):
if listS[i]==listS[i+1]:
count+=1
else:
count=1
if count==MAX:
print(listS[i])
if MAX==1:
print(listS[-1])
|
[
"control_flow.branch.if.condition.change"
] | 570,909
| 570,910
|
u829249049
|
python
|
p02773
|
from collections import Counter
#まずは代入
n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s).most_common() #もうリストにしちゃった<3
#この時点で, cは個数が多い順に並んでる
#たとえば入力例1だと
#[('vet', 2), ('beet', 2), ('beat', 1), ('bed', 1), ('bet', 1)]
ans = []
max = c[0][1] #最大の個数は何か? 数値を代入
for item,count in c:
if count==max:
ans.append(item)
else:
break #もうこれ以下は弱いのしかないのでbreakします
ans.sort() #辞書順に並べる
for i in range(len(ans)):
print(ans[i])
|
from collections import Counter
# まずは代入
n = int(input())
s = [input() for _ in range(n)]
c = Counter(s).most_common() # もうリストにしちゃった<3
# この時点で, cは個数が多い順に並んでる
# たとえば入力例1だと
# [('vet', 2), ('beet', 2), ('beat', 1), ('bed', 1), ('bet', 1)]
ans = []
max = c[0][1] # 最大の個数は何か? 数値を代入
for item, count in c:
if count == max:
ans.append(item)
else:
break # もうこれ以下は弱いのしかないのでbreakします
ans.sort() # 辞書順に並べる
for i in range(len(ans)):
print(ans[i])
|
[] | 570,911
| 570,912
|
u723792785
|
python
|
p02773
|
import collections
#まずは代入
n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s).most_common() #もうリストにしちゃった<3
d = max([c[x][1] for x in range(len(c))])
#この時点で, cは個数が多い順に並んでる
#たとえば入力例1だと
#[('vet', 2), ('beet', 2), ('beat', 1), ('bed', 1), ('bet', 1)]
ans = []
max = c[0][1] #最大の個数は何か? 数値を代入
for item,count in c[0:d]:
if count==max:
ans.append(item)
else:
break #もうこれ以下は弱いのしかないのでbreakします
ans.sort() #辞書順に並べる
for i in range(len(ans)):
print(ans[i])
|
import collections
#まずは代入
n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s).most_common() #もうリストにしちゃった<3
d = collections.Counter([c[x][1] for x in range(len(c))])
#この時点で, cは個数が多い順に並んでる
#たとえば入力例1だと
#[('vet', 2), ('beet', 2), ('beat', 1), ('bed', 1), ('bet', 1)]
ans = []
max = c[0][1] #最大の個数は何か? 数値を代入
for item,count in c[0:d[max]]:
if count==max:
ans.append(item)
else:
break #もうこれ以下は弱いのしかないのでbreakします
ans.sort() #辞書順に並べる
for i in range(len(ans)):
print(ans[i])
|
[
"assignment.value.change"
] | 570,913
| 570,914
|
u723792785
|
python
|
p02773
|
import collections
n=int(input())
s=[]
for i in range(n):
S=input()
s.append(S)
c = collections.Counter(s)
l=c.most_common()
x=[l[0][0]]
for i in range(1,n):
if l[i-1][1]==l[i][1]:
x.append(l[i][0])
else:
break
x.sort()
for i in x:
print(i)
|
import collections
n=int(input())
s=[]
for i in range(n):
S=input()
s.append(S)
c = collections.Counter(s)
l=c.most_common()
x=[l[0][0]]
for i in range(1,len(l)):
if l[i-1][1]==l[i][1]:
x.append(l[i][0])
else:
break
x.sort()
for i in x:
print(i)
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 570,915
| 570,916
|
u357230322
|
python
|
p02773
|
import collections
n = int(input())
s = []
for i in range(n):
s.append(input())
dic = collections.Counter(s)
dic = dic.most_common()
ans = [dic[0][0]]
for i in range(n):
if dic[i][1] == dic[i+1][1]:
ans.append(dic[i+1][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
import collections
n = int(input())
s = []
for i in range(n):
s.append(input())
dic = collections.Counter(s)
dic = dic.most_common()
ans = [dic[0][0]]
for i in range(len(dic)-1):
if dic[i][1] == dic[i+1][1]:
ans.append(dic[i+1][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 570,924
| 570,925
|
u883040023
|
python
|
p02773
|
N=int(input())
l={}
ans =[]
"""for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
print(l)"""
for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
#print(l)
max = max(l.values())
print(max)
for i in l:
#print(l[i])
if l[i]==num:
ans.append(i)
b = sorted(ans)
for i in b:
print(i)
|
N=int(input())
l={}
ans =[]
"""for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
print(l)"""
for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
#print(l)
num = max(l.values())
#print(max)
for i in l:
#print(l[i])
if l[i]==num:
ans.append(i)
b = sorted(ans)
for i in b:
print(i)
|
[
"assignment.variable.change",
"identifier.change",
"call.remove"
] | 570,930
| 570,931
|
u347920118
|
python
|
p02773
|
N=int(input())
l={}
ans =[]
"""for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
print(l)"""
for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
#print(l)
num = max(l.values())
print(max)
for i in l:
#print(l[i])
if l[i]==num:
ans.append(i)
b = sorted(ans)
for i in b:
print(i)
|
N=int(input())
l={}
ans =[]
"""for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
print(l)"""
for i in range(N):
s=input()
if s in l:
l[s]+=1
else:
l[s]=1
#print(l)
num = max(l.values())
#print(max)
for i in l:
#print(l[i])
if l[i]==num:
ans.append(i)
b = sorted(ans)
for i in b:
print(i)
|
[
"call.remove"
] | 570,932
| 570,931
|
u347920118
|
python
|
p02773
|
N = int(input())
dic = {}
for i in range(1,N+1):
key = input()
if key not in dic:
dic[key] = 1
else:
dic[key] += 1
lis = []
for key,val in dic.items():
lis.append([val,key])
lis.sort(reverse = True)
lis2 = []
fnum = lis[0][0]
j = 0
for x in range(0,len(lis)):
if lis[j][0] == fnum:
lis2.append(lis[j][1])
else:
break
lis2.sort()
for k in lis2:
print(k)
|
N = int(input())
dic = {}
for i in range(1,N+1):
key = input()
if key not in dic:
dic[key] = 1
else:
dic[key] += 1
lis = []
for key,val in dic.items():
lis.append([val,key])
lis.sort(reverse = True)
lis2 = []
fnum = lis[0][0]
for j in range(0,len(lis)):
if lis[j][0] == fnum:
lis2.append(lis[j][1])
else:
break
lis2.sort()
for k in lis2:
print(k)
|
[
"identifier.change"
] | 570,933
| 570,934
|
u521271655
|
python
|
p02773
|
#bA
import collections
N = int(input())
S = [input() for i in range(N)]
s = collections.Counter(S) #出現回数をまとめた辞書型作成
maximum = max(S.values())
list = sorted(key for key,value in s.items() if value==maximum)
#sを利用して、出現回数が最大のものを辞書順に並べたリストを作成
for i in list:
print(i)
|
#bA
import collections
N = int(input())
S = [input() for i in range(N)]
s = collections.Counter(S) #出現回数をまとめた辞書型作成
maximum = max(s.values()) #
list = sorted(key for key,value in s.items() if value==maximum)
#sを利用して、出現回数が最大のものを辞書順に並べたリストを作成
for i in list:
print(i)
|
[
"misc.typo",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 570,948
| 570,949
|
u581603131
|
python
|
p02773
|
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
Clist = Counter(S).most_common()
num = Clist[0][1]
anses = [Clist[0][0]]
for X in Clist[1:]:
if X[1] == num:
anses.append(X[0])
for ans in anses:
print(ans)
|
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
Clist = Counter(S).most_common()
num = Clist[0][1]
anses = [Clist[0][0]]
for X in Clist[1:]:
if X[1] == num:
anses.append(X[0])
anses.sort()
for ans in anses:
print(ans)
|
[
"call.add"
] | 570,964
| 570,965
|
u931462344
|
python
|
p02773
|
n = int(input())
dic = {}
for _ in range(n):
s = input()
if s not in dic:
dic[s] = 1
else:
dic[s] += 1
m = max(dic.values())
anslis = []
for k, v in dic.items():
if v == m:
anslis.append(k)
print('/n'.join(anslis))
|
n = int(input())
dic = {}
for _ in range(n):
s = input()
if s not in dic:
dic[s] = 1
else:
dic[s] += 1
m = max(dic.values())
anslis = []
for k, v in dic.items():
if v == m:
anslis.append(k)
print('\n'.join(sorted(anslis)))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"call.add"
] | 570,966
| 570,967
|
u857293613
|
python
|
p02773
|
N = int(input())
A = [input() for i in range(N)]
dic = {}
for i in A:
if i not in dic:
dic[i] = 1
else:
dic[i] += 1
de = 0
ans_list = []
#dic2 = sorted(dic.values(), reverse=True)
for k, v in sorted(dic.items(), key=lambda x: x[1], reverse = True):
if v != de and de !=0:
exit()
else:
ans_list.append(k)
de = v
ans_list_n = sorted(ans_list)
for i in ans_list_n:
print(i)
|
N = int(input())
A = [input() for i in range(N)]
dic = {}
for i in A:
if i not in dic:
dic[i] = 1
else:
dic[i] += 1
de = 0
ans_list = []
#dic2 = sorted(dic.values(), reverse=True)
for k, v in sorted(dic.items(), key=lambda x: x[1], reverse = True):
if v != de and de !=0:
break
else:
ans_list.append(k)
de = v
ans_list_n = sorted(ans_list)
for i in ans_list_n:
print(i)
|
[
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 570,968
| 570,969
|
u744920373
|
python
|
p02773
|
from itertools import Counter
n = int(input())
lst = [0]*n
for i in range(n):
s = input()
lst[i] = s
c = Counter(lst)
max_num = max(c.values())
most_lst = sorted([k for k, v in c.items() if v == max_num])
for x in most_lst:
print(x)
|
from collections import Counter
n = int(input())
lst = [0]*n
for i in range(n):
s = input()
lst[i] = s
c = Counter(lst)
max_num = max(c.values())
most_lst = sorted([k for k, v in c.items() if v == max_num])
for x in most_lst:
print(x)
|
[
"identifier.change"
] | 570,970
| 570,971
|
u729535891
|
python
|
p02773
|
n = int(input())
a = dict()
for i in range(n): #辞書型でカウント
s = input()
a.setdefault(s, 0)
a[s] += 1
ans = []
mx = 0
for key, value in a.items(): #最大値のものをリストに入れる
if mx < value:
mx = value
ans = [key]
elif mx == value:
ans.append(key)
for i in ans:
print(i)
|
n = int(input())
a = dict()
for i in range(n): # 辞書型でカウント
s = input()
a.setdefault(s, 0)
a[s] += 1
ans = []
mx = 0
for key, value in a.items(): # 最大値のものをリストに入れる
if mx < value:
mx = value
ans = [key]
elif mx == value:
ans.append(key)
ans.sort() # 辞書順に出力
for i in ans:
print(i)
|
[
"call.add"
] | 570,972
| 570,973
|
u874644572
|
python
|
p02773
|
N = int(input())
dic = {}
s = []
for _ in range(N):
s.append(input())
for i in s:
if i in dic.keys():
dic[i] += 1
else:
dic[i] = 1
result = []
num = 0
for i in dic.keys():
if dic[i] > num:
result = []
result.append(i)
num = dic[i]
elif dic[i] == num:
result.append(i)
for i in result:
print(i)
|
N = int(input())
dic = {}
s = []
for _ in range(N):
s.append(input())
for i in s:
if i in dic.keys():
dic[i] += 1
else:
dic[i] = 1
result = []
num = 0
for i in dic.keys():
if dic[i] > num:
result = []
result.append(i)
num = dic[i]
elif dic[i] == num:
result.append(i)
result.sort()
for i in result:
print(i)
|
[
"call.add"
] | 570,976
| 570,977
|
u629560745
|
python
|
p02773
|
N = int(input())
word_count = {}
for i in range(N):
word = input()
if word not in word_count:
word_count[word] = 1
else:
word_count[word] += 1
counts = [val for (key, val) in word_count.items()]
max_count = max(counts)
words = [key for (key, val) in word_count.items() if val == max_count]
for word in words:
print(word)
|
N = int(input())
word_count = {}
for i in range(N):
word = input()
if word not in word_count:
word_count[word] = 1
else:
word_count[word] += 1
counts = [val for (key, val) in word_count.items()]
max_count = max(counts)
words = sorted([key for (key, val) in word_count.items() if val == max_count])
for word in words:
print(word)
|
[
"call.add",
"call.arguments.change"
] | 570,982
| 570,983
|
u608579392
|
python
|
p02773
|
from collections import Counter
n = int(input())
s = [input() for i in range(n)]
a = Counter(s)
b = a.most_common()[0][1]
s = list(set(s)) #sの重複した要素を消す
for i in s:
if a[i] == b:
print(i)
|
from collections import Counter
n = int(input())
s = [input() for i in range(n)]
a = Counter(s)
b = a.most_common()[0][1]
s = list(set(s)) #sの重複した要素を消す
s.sort()
for i in s:
if a[i] == b:
print(i)
|
[
"call.add"
] | 570,988
| 570,989
|
u015418292
|
python
|
p02773
|
N=int(input())
s=[input() for i in range (N)]
s.sort()
count=1
maximum=0
for j in range (N-1):
if s[j]==s[j+1]:
count+=1
if j==N-2:
if count>maximum:
a=[]
a.clear()
a.append(s[j])
maximum=count
number=1
elif count==maximum:
a.append(s[j])
number+=1
else:
if count>maximum:
a=[]
a.clear()
a.append(s[j])
maximum=count
number=1
elif count==maximum:
a.append(s[j])
number+=1
count=1
if maximum==1 and j==N-2:
a.append(s[j])
number+=1
for p in range (number):
print(a[p])
|
N=int(input())
s=[input() for i in range (N)]
s.sort()
count=1
maximum=0
for j in range (N-1):
if s[j]==s[j+1]:
count+=1
if j==N-2:
if count>maximum:
a=[]
a.clear()
a.append(s[j])
maximum=count
number=1
elif count==maximum:
a.append(s[j])
number+=1
else:
if count>maximum:
a=[]
a.clear()
a.append(s[j])
maximum=count
number=1
elif count==maximum:
a.append(s[j])
number+=1
count=1
if maximum==1 and j==N-2:
a.append(s[N-1])
number+=1
for p in range (number):
print(a[p])
|
[
"variable_access.subscript.index.change",
"call.arguments.change"
] | 570,991
| 570,992
|
u166340293
|
python
|
p02773
|
from collections import Counter
N = int(input())
A = []
for i in range(N):
A.append(input())
C= Counter(A)
B = 0
for v in c.values():
B = max(B,v)
ans = []
for k, v in c.items():
if v == B:
ans.append(k)
ans.sort()
print(*ans,sep='\n')
|
from collections import Counter
N = int(input())
A = []
for i in range(N):
A.append(input())
C= Counter(A)
B = 0
for v in C.values():
B = max(B,v)
ans = []
for k, v in C.items():
if v == B:
ans.append(k)
ans.sort()
print(*ans,sep='\n')
|
[
"misc.typo",
"identifier.change"
] | 570,993
| 570,994
|
u514118270
|
python
|
p02773
|
N = int(input())
S = []
for i in range(N):
tmp = input()
S.append(tmp)
S.sort()
if N == 1:
print(S[0])
exit()
ans = []
SS = []
count = 1
print(S)
for i in range(N-1):
if i == N-2:
if S[i] == S[i+1]:
count += 1
ans.append(count)
SS.append(S[i])
else:
ans.append(count)
SS.append(S[i])
ans.append(1)
SS.append(S[i+1])
elif S[i] == S[i+1]:
count += 1
else:
ans.append(count)
SS.append(S[i])
count = 1
m = max(ans)
for i in range(len(SS)):
if ans[i] == m:
print(SS[i])
|
N = int(input())
S = []
for i in range(N):
tmp = input()
S.append(tmp)
S.sort()
if N == 1:
print(S[0])
exit()
ans = []
SS = []
count = 1
for i in range(N-1):
if i == N-2:
if S[i] == S[i+1]:
count += 1
ans.append(count)
SS.append(S[i])
else:
ans.append(count)
SS.append(S[i])
ans.append(1)
SS.append(S[i+1])
elif S[i] == S[i+1]:
count += 1
else:
ans.append(count)
SS.append(S[i])
count = 1
m = max(ans)
for i in range(len(SS)):
if ans[i] == m:
print(SS[i])
|
[
"call.remove"
] | 570,996
| 570,997
|
u497952650
|
python
|
p02773
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
ans = []
c = Counter(s)
max_count = max(c.values())
for k, v in c.items():
if v == max_count:
ans.append(k)
ans.sort()
print('\n'.join(ans))
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
ans = []
c = Counter(s)
max_count = max(c.values())
for k, v in c.items():
if v == max_count:
ans.append(k)
ans.sort()
print('\n'.join(ans))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 571,004
| 571,005
|
u309423187
|
python
|
p02773
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
ans = []
c = Counter(s)
max_count = max(c.values())
for k, v in c.items():
if v == max_count:
ans.append(k)
ans.sort()
print('\n'.join(ans))
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
ans = []
c = Counter(s)
max_count = max(c.values())
for k, v in c.items():
if v == max_count:
ans.append(k)
ans.sort()
print('\n'.join(ans))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 571,004
| 571,006
|
u309423187
|
python
|
p02773
|
N = int(input())
from collections import defaultdict
d = defaultdict(int)
for i in range(N):
d[input()] += 1
max_cnt = max(d.value())
for v in sorted([key for key,value in d.items() if value == max_cnt]):
print(v)
|
N = int(input())
from collections import defaultdict
d = defaultdict(int)
for i in range(N):
d[input()] += 1
max_cnt = max(d.values())
for v in sorted([key for key,value in d.items() if value == max_cnt]):
print(v)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 571,010
| 571,011
|
u904804404
|
python
|
p02773
|
N = int(input())
A = [""] * N
for i in range(N):
A[i] = input()
A.sort()
c, m = 1, [1, [A[0]]]
for i in range(1, N):
if A[i - 1] == A[i]:
c += 1
else:
if m[0] == c:
m[1].append(A[i - 1])
elif m[0] < c:
m[1].clear()
m[1].append(A[i - 1])
m[0] = c
c = 1
if m[0] == c:
m[1].append(A[-1])
elif m[0] < c:
m[1].clear()
m[1].append(A[-1])
for i in m[1]:
print(i)
|
N = int(input())
A = [""] * N
for i in range(N):
A[i] = input()
A.sort()
c, m = 1, [1, []]
for i in range(1, N):
if A[i - 1] == A[i]:
c += 1
else:
if m[0] == c:
m[1].append(A[i - 1])
elif m[0] < c:
m[1].clear()
m[1].append(A[i - 1])
m[0] = c
c = 1
if m[0] == c:
m[1].append(A[-1])
elif m[0] < c:
m[1].clear()
m[1].append(A[-1])
for i in m[1]:
print(i)
|
[] | 571,018
| 571,019
|
u565476466
|
python
|
p02773
|
from collections import Counter
N = int(input())
Sc = Counter([input() for _ in range(N)]).most_common()
print(Sc)
max_num = Sc[0][1]
ans = []
for key, val in Sc:
if val == max_num:
ans.append(key)
ans.sort()
for t in ans:
print(t)
|
from collections import Counter
N = int(input())
Sc = Counter([input() for _ in range(N)]).most_common()
# print(Sc)
max_num = Sc[0][1]
ans = []
for key, val in Sc:
if val == max_num:
ans.append(key)
ans.sort()
for t in ans:
print(t)
|
[
"call.remove"
] | 571,030
| 571,031
|
u762420987
|
python
|
p02773
|
def main():
from collections import Counter
import sys
input = sys.stdin.readline
n=int(input())
s=[]
for _ in []*n:
s.append(input().rstrip())
c = Counter(s)
ans=[]
max_vote = max(c.values())
for i,j in c.items():
if j == max_vote:
ans.append(i)
print("\n".join(sorted(ans)))
main()
|
def main():
from collections import Counter
import sys
input = sys.stdin.readline
n=int(input())
s=[]
for _ in [0]*n:
s.append(input().rstrip())
c = Counter(s)
ans=[]
max_vote = max(c.values())
for i,j in c.items():
if j == max_vote:
ans.append(i)
print("\n".join(sorted(ans)))
main()
|
[] | 571,036
| 571,037
|
u752907966
|
python
|
p02773
|
import sys
input=sys.stdin.readline
def main():
N=int(input())
S=[""]*N
result={}
for i in range(N):
S[i]=input().strip()
if S[i] not in result:
result[S[i]]=1
else:
result[S[i]]+=1
result=sorted(result.items())
print(result)
result=sorted(result,key=lambda x:-x[1])
max_num=result[0][1]
for i in range(len(result)):
if result[i][1]==max_num:
print(result[i][0])
else:
break
if __name__=="__main__":
main()
|
import sys
input=sys.stdin.readline
def main():
N=int(input())
S=[""]*N
result={}
for i in range(N):
S[i]=input().strip()
if S[i] not in result:
result[S[i]]=1
else:
result[S[i]]+=1
result=sorted(result.items())
result=sorted(result,key=lambda x:-x[1])
max_num=result[0][1]
for i in range(len(result)):
if result[i][1]==max_num:
print(result[i][0])
else:
break
if __name__=="__main__":
main()
|
[
"call.remove"
] | 571,042
| 571,043
|
u079022693
|
python
|
p02773
|
n = int(input())
s = ['.'] * n
for i in range(n):
s[i] = str(input())
dict = {}
for i in range(n):
if s[i] in dict:
dict[s[i]] += 1
else:
dict[s[i]] = 1
m = max(dict.values())
keys = [k for k, v in dict.items() if v == m]
for i in range(len(keys)):
print(keys[i])
|
n = int(input())
s = ['.'] * n
for i in range(n):
s[i] = str(input())
dict = {}
for i in range(n):
if s[i] in dict:
dict[s[i]] += 1
else:
dict[s[i]] = 1
m = max(dict.values())
keys = [k for k, v in dict.items() if v == m]
keys.sort()
for i in range(len(keys)):
print(keys[i])
|
[
"call.add"
] | 571,052
| 571,053
|
u106342872
|
python
|
p02773
|
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in d.items() if v == m]
keys.sort()
for i in keys:
print(i)
|
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in c.items() if v == m]
keys.sort()
for i in keys:
print(i)
|
[
"assignment.value.change",
"identifier.change"
] | 571,054
| 571,055
|
u440975163
|
python
|
p02773
|
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in d.items() if v == m]
sorted(keys)
for i in keys:
print(i)
|
n = int(input())
p = [str(input()) for _ in range(n)]
import collections
c = collections.Counter(p)
m = max(c.values())
keys = [k for k, v in c.items() if v == m]
keys.sort()
for i in keys:
print(i)
|
[
"assignment.value.change",
"identifier.change",
"call.remove",
"call.add"
] | 571,056
| 571,055
|
u440975163
|
python
|
p02773
|
from collections import defaultdict
def solve():
N = int(input())
d = defaultdict(int)
for _ in range(N):
a = input()
d[a] += 1
m = 0
for k, v in d.items():
m = max(m, v)
l = []
for k, v in d.items():
if m == v:
l.append(k)
l.sort()
for ans in l:
print(ans)
print(solve())
|
from collections import defaultdict
def solve():
N = int(input())
d = defaultdict(int)
for _ in range(N):
a = input()
d[a] += 1
m = 0
for k, v in d.items():
m = max(m, v)
l = []
for k, v in d.items():
if m == v:
l.append(k)
l.sort()
for ans in l:
print(ans)
solve()
|
[
"call.remove",
"call.arguments.change"
] | 571,059
| 571,060
|
u112317104
|
python
|
p02773
|
n=int(input())
S=[]
ans=0
import collections
for i in range(n):
s=input()
S.append(s)
S=sorted(S)
c=collections.Counter(S)
ANS=[]
for i in range(n-1):
if (S[i]!=S[i+1] and ans<c[S[i]]) or i==n-2:
ans=c[S[i]]#Sの？番目がSにいくつあるのか
ANS.append(ans)
inko=""
ans=max(ANS)
for i in range(n):
if c[S[i]]==ans and S[i]!=inko:
print(S[i])
|
n=int(input())
S=[]
ans=0
import collections
for i in range(n):
s=input()
S.append(s)
S=sorted(S)
c=collections.Counter(S)
ANS=[]
for i in range(n-1):
if (S[i]!=S[i+1] and ans<c[S[i]]) or i==n-2:
ans=c[S[i]]#Sの？番目がSにいくつあるのか
ANS.append(ans)
inko=""
ans=max(ANS)
for i in range(n):
if c[S[i]]==ans and S[i]!=inko:
print(S[i])
inko=S[i]
|
[
"assignment.add"
] | 571,065
| 571,066
|
u840958781
|
python
|
p02773
|
from collections import Counter
S = []
N = int(input())
for i in range(N):
s = input()
S.append(s)
c = collections.Counter(S)
max_num = max(c.values())
max_list = [i for i,j in c.items() if j==max_num]
max_list.sort()
print('\n'.join(max_list))
|
from collections import Counter
S = []
N = int(input())
for i in range(N):
s = input()
S.append(s)
c = Counter(S)
max_num = max(c.values())
max_list = [i for i,j in c.items() if j==max_num]
max_list.sort()
print('\n'.join(max_list))
|
[] | 571,086
| 571,087
|
u891518152
|
python
|
p02773
|
def main():
N = int(input())
S = [input() for _ in range(N)]#list()
#for i in range(N):
# S.append(input())
# S_uniquie = sorted(set(S))
# S_uniquie = sorted(set(S))
# c = 0
target = {}
for word in S:
if word in target:
target[word] += 1
else:
target[word] = 1
# for i in S_uniquie:
# c = S.count(i)
# target[i] = c
maximum = max(target.values())
#for val in target.values():
# if max < val:
# max = val
for key,val in target.items():
if(val == maximum):
print(key)
if __name__ == '__main__':
main()
|
def main():
N = int(input())
S = [input() for _ in range(N)]#list()
#for i in range(N):
# S.append(input())
# S_uniquie = sorted(set(S))
# S_uniquie = sorted(set(S))
# c = 0
target = {}
for word in S:
if word in target:
target[word] += 1
else:
target[word] = 1
# for i in S_uniquie:
# c = S.count(i)
# target[i] = c
maximum = max(target.values())
for key,val in sorted(target.items()):
if(val == maximum):
print(key)
if __name__ == '__main__':
main()
|
[
"call.add",
"call.arguments.change"
] | 571,113
| 571,114
|
u131411061
|
python
|
p02773
|
N = int(input())
S = []
for i in range(N):
S.append(input())
S_S = sorted(S)
maxi = 1
count = 1
i = 0
tmp = []
while i<N-1:
if S_S[i] == S_S[i+1]:
count = count + 1
if count > maxi:
maxi = count
tmp = []
i = i + 1
else:
count = 1
i = i + 1
if maxi == count:
tmp.append(i)
#print(maxi)
#print(S_S)
for i in range(len(tmp)):
print(S_S[tmp[i]])
|
N = int(input())
S = []
for i in range(N):
S.append(input())
S_S = sorted(S)
maxi = 1
count = 1
i = 0
tmp = [0]
while i<N-1:
if S_S[i] == S_S[i+1]:
count = count + 1
if count > maxi:
maxi = count
tmp = []
i = i + 1
else:
count = 1
i = i + 1
if maxi == count:
tmp.append(i)
#print(maxi)
#print(S_S)
for i in range(len(tmp)):
print(S_S[tmp[i]])
|
[] | 571,117
| 571,118
|
u663101675
|
python
|
p02773
|
n = int(input())
dic = {}
for i in range(n):
elem = input()
if not elem in dic:
dic[elem] = 1
else:
dic[elem] += 1
max_ = max(dic.values())
res = []
for k, v in dic.items():
if v == max_:
res.append(v)
res = sorted(res)
for elem in res:
print(res)
|
n = int(input())
dic = {}
for i in range(n):
elem = input()
if not elem in dic:
dic[elem] = 1
else:
dic[elem] += 1
max_ = max(dic.values())
res = []
for k, v in dic.items():
if v == max_:
res.append(k)
res = sorted(res)
for elem in res:
print(elem)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 571,119
| 571,120
|
u047197186
|
python
|
p02773
|
n = int(input())
s = [input() for _ in range(n)]
from collections import Counter
c = Counter(s)
m = max(c.values())
ans = []
for k,v in c.items():
if v == m:
ans.append(k)
for i in ans:
print(i)
|
n = int(input())
s = [input() for _ in range(n)]
from collections import Counter
c = Counter(s)
m = max(c.values())
ans = []
for k,v in c.items():
if v == m:
ans.append(k)
ans.sort()
for i in ans:
print(i)
|
[
"call.add"
] | 571,125
| 571,126
|
u059684599
|
python
|
p02773
|
from collections import Counter
n = int(input())
S = []
for _ in range(n):
S.append(input()) # S += [input()] とも書ける
# 要素数チェック
counter = Counter(S)
# 要素数最大の要素を全て取得する->リスト
mostnum = 0
ans = []
for c in counter.most_common():
if mostnum < c[1]:
mostnum = c[1]
ans.append(c[0])
else:
break
# リストを辞書順に並び替える
ans.sort()
# リストを改行で出力
for a in ans:
print(a)
|
from collections import Counter
n = int(input())
S = []
for _ in range(n):
S.append(input()) # S += [input()] とも書ける
# 要素数チェック
counter = Counter(S)
# 要素数最大の要素を全て取得する->リスト
mostnum = 0
ans = []
for c in counter.most_common():
if mostnum <= c[1]:
mostnum = c[1]
ans.append(c[0])
else:
break
# リストを辞書順に並び替える
ans.sort()
# リストを改行で出力
for a in ans:
print(a)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,135
| 571,136
|
u114641312
|
python
|
p02773
|
import collections
N = int(input())
listA = []
listB = []
for i in range(N):
listA.append(input())
c = collections.Counter(listA)
c = c.most_common()
max_number = c[0][1]
listB.append(c[0][0])
A = len(c)
for i in range(1,A-1):
if max_number == c[i][1]:
listB.append(str(c[i][0]))
else:
break
listB.sort()
for i in listB:
print(i)
|
import collections
N = int(input())
listA = []
listB = []
for i in range(N):
listA.append(input())
c = collections.Counter(listA)
c = c.most_common()
max_number = c[0][1]
listB.append(c[0][0])
A = len(c)
for i in range(1,A):
if max_number == c[i][1]:
listB.append(str(c[i][0]))
else:
break
listB.sort()
for i in listB:
print(i)
|
[
"expression.operation.binary.remove"
] | 571,140
| 571,141
|
u188745744
|
python
|
p02773
|
n = int(input())
Strings = [input() for _ in range(n)]
dic = {}
for s in Strings:
if s not in dic.keys():
dic[s] = 1
else:
dic[s] += 1
maxValue = dic[max(dic)]
ans = []
for s in dic:
if dic[s] == maxValue:
ans.append(s)
ans.sort()
for s in ans:
print(s)
|
# TODO:review test cases (https://www.dropbox.com/sh/arnpe0ef5wds8cv/AAAk_SECQ2Nc6SVGii3rHX6Fa?dl=0)
n = int(input())
Strings = [input() for _ in range(n)]
# f = open('sub1_19.txt')
# n = int(f.readline().replace('\n',''))
# Strings = [f.readline().replace('\n','') for _ in range(n)]
dic = {}
for s in Strings:
if s not in dic.keys():
dic[s] = 1
else:
dic[s] += 1
maxValue = max(dic.values())
ans = []
for s in dic:
if dic[s] == maxValue:
ans.append(s)
ans.sort()
for s in ans:
print(s)
|
[
"call.add"
] | 571,142
| 571,143
|
u329049771
|
python
|
p02773
|
from collections import Counter
n = int(input())
S = [input() for i in range(n)]
s = Counter(S)
print(s)
max_cnt = s.most_common()[0][1]
names = [name for name, cnt in s.items() if cnt == max_cnt]
names.sort()
print("\n".join(names))
|
from collections import Counter
n = int(input())
S = [input() for i in range(n)]
s = Counter(S)
max_cnt = s.most_common()[0][1]
names = [name for name, cnt in s.items() if cnt == max_cnt]
names.sort()
print("\n".join(names))
|
[
"call.remove"
] | 571,149
| 571,150
|
u597455618
|
python
|
p02773
|
N=int(input())
S = {}
for i in range(N):
let = input()
try:
S[let] += 1
except:
S[let] = 1
max_val = max(S.values())
answers = []
for k,v in S.items():
if v == max_val:
answers.append(k)
ansewrs.sort()
for ans in ansewrs:
print(ans)
|
N=int(input())
S = {}
for i in range(N):
let = input()
try:
S[let] += 1
except:
S[let] = 1
max_val = max(S.values())
answers = []
for k,v in S.items():
if v == max_val:
answers.append(k)
answers.sort()
for ans in answers:
print(ans)
|
[
"identifier.change"
] | 571,151
| 571,152
|
u083494782
|
python
|
p02773
|
from sys import stdin, stdout
from collections import defaultdict
n = int(stdin.readline().strip())
word_map = defaultdict(lambda: 0)
maxi = 0
for i in range(n):
word = stding.readline().strip()
x = word_map[word]
word_map[word] = x + 1
maxi = max(maxi, x+1)
word_list = []
for key, value in word_map.items():
if value == maxi:
word_list.append(key)
word_list.sort()
for word in word_list:
stdout.write(word+'\n')
|
from sys import stdin, stdout
from collections import defaultdict
n = int(stdin.readline().strip())
word_map = defaultdict(lambda: 0)
maxi = 0
for i in range(n):
word = stdin.readline().strip()
x = word_map[word]
word_map[word] = x + 1
maxi = max(maxi, x+1)
word_list = []
for key, value in word_map.items():
if value == maxi:
word_list.append(key)
word_list.sort()
for word in word_list:
stdout.write(word+'\n')
|
[
"assignment.value.change",
"identifier.change"
] | 571,153
| 571,154
|
u435076592
|
python
|
p02773
|
import collections
from sys import stdin
N = int(stdin.readline().rstrip())
data = []
for i in range(N):
s = (stdin.readline().rstrip())
data.append(s)
c = collections.Counter(data)
maxc = max(c.values())
for j in c.keys():
if c[j] == maxc:
print(j)
|
import collections
from sys import stdin
N = int(stdin.readline().rstrip())
data = []
for i in range(N):
s = (stdin.readline().rstrip())
data.append(s)
c = collections.Counter(data)
maxc = max(c.values())
for j in sorted(c.keys()):
if c[j] == maxc:
print(j)
|
[
"call.add",
"call.arguments.change"
] | 571,159
| 571,160
|
u405256066
|
python
|
p02773
|
import sys
import collections
N = int(input())
strs = []
for _ in range(N):
s = input()
strs.append(s)
#print('strs', strs)
c = collections.Counter(strs)
maxv = -1
ans = []
for k , v in c.most_common():
if v != maxv and maxv != -1:
break
ans.append(k)
maxv = v
for a in sorted(ans, reverse=True):
print(a)
|
import sys
import collections
N = int(input())
strs = []
for _ in range(N):
s = input()
strs.append(s)
#print('strs', strs)
c = collections.Counter(strs)
maxv = -1
ans = []
for k , v in c.most_common():
if v != maxv and maxv != -1:
break
ans.append(k)
maxv = v
for a in sorted(ans):
print(a)
|
[
"call.arguments.change"
] | 571,164
| 571,165
|
u054622560
|
python
|
p02773
|
from collections import OrderedDict
#入力
N = int(input())
S = [input() for i in range(N)]
#出現回数のカウント
c = OrderedDict(collections.Counter(S))
ln = len(c.values())
#多い順に並べ替えた辞書をつくる
d = OrderedDict(sorted(c.items(), key = lambda x : x[1], reverse=True))
dval = list(d.values())
dkey = list(d.keys())
#回数が多い単語を抜き出したリストの制作
word = list()
word.append(dkey[0])
i=1
if ln>1:
while dval[i-1]==dval[i]:
word.append(dkey[i])
i+=1
if i==ln:
break
#辞書順に並べ替える
dic = sorted(word)
#表示
for i in range(len(dic)):
print(dic[i])
|
import collections
from collections import OrderedDict
#入力
N = int(input())
S = [input() for i in range(N)]
#出現回数のカウント
c = OrderedDict(collections.Counter(S))
ln = len(c.values())
#多い順に並べ替えた辞書をつくる
d = OrderedDict(sorted(c.items(), key = lambda x : x[1], reverse=True))
dval = list(d.values())
dkey = list(d.keys())
#回数が多い単語を抜き出したリストの制作
word = list()
word.append(dkey[0])
i=1
if ln>1:
while dval[i-1]==dval[i]:
word.append(dkey[i])
i+=1
if i==ln:
break
#辞書順に並べ替える
dic = sorted(word)
#表示
for i in range(len(dic)):
print(dic[i])
|
[] | 571,166
| 571,167
|
u436725550
|
python
|
p02773
|
N = int(input())
cdic = {}
for i in range(N):
si = input()
if si not in cdic.keys():
cdic[si] = 1
else:
cdic[si] += 1
spair = sorted(cdic.items(), key=lambda x:x[1], reverse=True)
vmax = -1
maxes = []
for pair in spair:
if pair[1] >= vmax:
maxes.append(pair[0])
else:
break
smaxes = sorted(maxes)
for s in smaxes:
print(s)
|
N = int(input())
cdic = {}
for i in range(N):
si = input()
if si not in cdic.keys():
cdic[si] = 1
else:
cdic[si] += 1
spair = sorted(cdic.items(), key=lambda x:x[1], reverse=True)
# print(cdic)
# print(spair)
vmax = -1
maxes = []
for pair in spair:
if pair[1] >= vmax:
maxes.append(pair[0])
vmax = pair[1]
else:
break
# print(maxes)
smaxes = sorted(maxes)
# print(smaxes)
# print('---')
for s in smaxes:
print(s)
|
[
"assignment.add"
] | 571,172
| 571,173
|
u398175819
|
python
|
p02773
|
N = int(input())
S = {}
name_list = []
for i in range(N):
name = input()
if name not in S:
S[name] = 1
name_list.append(name)
else:
S[name] += 1
sorted(name_list)
max_vote_name = []
max_vote = -float('inf')
for name in name_list:
if S[name] > max_vote:
max_vote = S[name]
max_vote_list = [name]
elif S[name] == max_vote:
max_vote_list.append(name)
for name in max_vote_list:
print (name)
|
N = int(input())
S = {}
name_list = []
for i in range(N):
name = input()
if name not in S:
S[name] = 1
name_list.append(name)
else:
S[name] += 1
name_list = sorted(name_list)
max_vote_name = []
max_vote = -float('inf')
for name in name_list:
if S[name] > max_vote:
max_vote = S[name]
max_vote_list = [name]
elif S[name] == max_vote:
max_vote_list.append(name)
for name in max_vote_list:
print (name)
|
[
"assignment.add"
] | 571,176
| 571,177
|
u243061947
|
python
|
p02773
|
n = int(input())
s = sorted([input() for i in range(n)])
s_ = list(set(s))
if len(s_) != n:
s.append(0)
co = [1] + [0 for i in range(len(s_)-1)]
ind = 0
for i in range(1, n):
if s[i-1] == s[i]:
co[ind] += 1
else:
ind += 1
co[ind] += 1
ma = max(co)
arg = [i for i in range(len(s_)) if co[i]==ma]
ans = [s_[i] for i in arg]
print("\n".join(sorted(ans)))
else:
print("\n".join(s))
|
n = int(input())
s = sorted([input() for i in range(n)])
s_ = sorted(list(set(s)))
if len(s_) != n:
s.append(0)
co = [1] + [0 for i in range(len(s_)-1)]
ind = 0
for i in range(1, n):
if s[i-1] == s[i]:
co[ind] += 1
else:
ind += 1
co[ind] += 1
ma = max(co)
arg = [i for i in range(len(s_)) if co[i]==ma]
ans = [s_[i] for i in arg]
print("\n".join(sorted(ans)))
else:
print("\n".join(s))
|
[
"call.add",
"call.arguments.change"
] | 571,179
| 571,180
|
u486065927
|
python
|
p02773
|
n = int(input())
s = sorted([input() for i in range(n)])
s_ = list(set(s))
if len(s_) != n:
s.append(0)
co = [1] + [0 for i in range(len(s_)-1)]
ind = 0
for i in range(1, n):
if s[i-1] == s[i]:
co[ind] += 1
else:
ind += 1
co[ind] += 1
ma = max(co)
arg = [i for i in range(len(s_)) if co[i]==ma]
ans = [s_[i] for i in arg]
print("\n".join(sorted(ans)))
else:
print("\n".join(s_))
|
n = int(input())
s = sorted([input() for i in range(n)])
s_ = sorted(list(set(s)))
if len(s_) != n:
s.append(0)
co = [1] + [0 for i in range(len(s_)-1)]
ind = 0
for i in range(1, n):
if s[i-1] == s[i]:
co[ind] += 1
else:
ind += 1
co[ind] += 1
ma = max(co)
arg = [i for i in range(len(s_)) if co[i]==ma]
ans = [s_[i] for i in arg]
print("\n".join(sorted(ans)))
else:
print("\n".join(s))
|
[
"call.add",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 571,181
| 571,180
|
u486065927
|
python
|
p02773
|
def main():
import sys
from collections import Counter
N = int(input())
S = [sys.stdin.readline().rstrip('\n') for _ in range(N)]
print(S)
c = Counter(S)
_max = max(c.values())
keys = [k for k, v in c.items() if v == _max]
print('\n'.join(sorted(keys)))
if __name__ == '__main__':
main()
|
def main():
import sys
from collections import Counter
N = int(input())
S = [sys.stdin.readline().rstrip('\n') for _ in range(N)]
c = Counter(S)
_max = max(c.values())
keys = [k for k, v in c.items() if v == _max]
print('\n'.join(sorted(keys)))
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 571,182
| 571,183
|
u868701750
|
python
|
p02773
|
i = int(input())
dic = {}
for j in range(i):
word = input()
if word in dic:
dic[word] += 1
else:
dic[word] = 1
dic2 = sorted(dic.items(), key=lambda x:x[1])
print(dic2)
k = len(dic2)-1
s = 0
ans = []
for p in range(len(dic2)):
t = dic2[k][1]
ans.append(dic2[k][0])
k -= 1
if t == dic2[k][1]:
s = 1
else:
break
ans.sort()
for ak in ans:
print(ak)
|
i = int(input())
dic = {}
for j in range(i):
word = input()
if word in dic:
dic[word] += 1
else:
dic[word] = 1
dic2 = sorted(dic.items(), key=lambda x:x[1])
k = len(dic2)-1
s = 0
ans = []
for p in range(len(dic2)):
t = dic2[k][1]
ans.append(dic2[k][0])
k -= 1
if t == dic2[k][1]:
s = 1
else:
break
ans.sort()
for ak in ans:
print(ak)
|
[
"call.remove"
] | 571,184
| 571,185
|
u867736259
|
python
|
p02773
|
import collections
N = int(input())
s = [input() for i in range(N)]
c = collections.Counter(s)
max_num = list(c.values())[0]
d = []
for key,value in c.items():
if value == max_num:
d.append(key)
for i in sorted(d):
print(i)
|
import collections
N = int(input())
s = [input() for i in range(N)]
c = collections.Counter(s)
max_num = max(c.values())
d = []
for key,value in c.items():
if value == max_num:
d.append(key)
for i in sorted(d):
print(i)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 571,190
| 571,191
|
u559196406
|
python
|
p02773
|
n = int(input())
b = {}
for i in range(n):
temp = input()
if temp not in b:
b[temp] = 1
else:
b[temp] += 1
list1 = sorted(b.items(), key=lambda x: x[1])
a = len(list1)-1
temp = len(list1)-1
list2 = []
while a > 0 and list1[temp][1] == list1[a][1]:
list2.append(list1[a][0])
a -= 1
list2.sort()
for a in list2:
print(a)
|
n = int(input())
b = {}
for i in range(n):
temp = input()
if temp not in b:
b[temp] = 1
else:
b[temp] += 1
list1 = sorted(b.items(), key=lambda x: x[1])
a = len(list1)-1
temp = len(list1)-1
list2 = []
while a >= 0 and list1[temp][1] == list1[a][1]:
list2.append(list1[a][0])
a -= 1
list2.sort()
for a in list2:
print(a)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 571,192
| 571,193
|
u283285729
|
python
|
p02773
|
n = int(input())
d = {}
for i in range(n):
t = input()
if t in d.keys():
d[t] += 0
else:
d[t] = 0
s = sorted(list(set(d.keys())))
m = max(d.values())
for s in s:
if d[s] == m:
print(s)
|
n = int(input())
d = {}
for i in range(n):
t = input()
if t in d.keys():
d[t] += 1
else:
d[t] = 0
s = sorted(list(set(d.keys())))
m = max(d.values())
for s in s:
if d[s] == m:
print(s)
|
[
"literal.number.integer.change"
] | 571,198
| 571,199
|
u337713602
|
python
|
p02773
|
import collections
n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
m = c.most_common()
maxn = m[0][1]
ans = []
for i in range(len(m)-1):
if m[i][1] == maxn:
ans.append(m[i][0])
else:
break
for i in sorted(ans):
print(i)
|
import collections
n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
m = c.most_common()
maxn = m[0][1]
ans = []
for i in range(len(m)):
if m[i][1] == maxn:
ans.append(m[i][0])
else:
break
for i in sorted(ans):
print(i)
|
[
"expression.operation.binary.remove"
] | 571,200
| 571,201
|
u937239245
|
python
|
p02773
|
n = int(input())
p = [input() for i in range(n)]
c = collections.Counter(p)
m = c.most_common()
most = m[0][1]
answer = []
answer.append(m[0][0])
for i in range(len(m)-1):
if m[i+1][1] == most:
answer.append(m[i+1][0])
else:
break
for output in sorted(answer):
print(output)
|
import collections
n = int(input())
p = [input() for i in range(n)]
c = collections.Counter(p)
m = c.most_common()
most = m[0][1]
answer = []
answer.append(m[0][0])
for i in range(len(m)-1):
if m[i+1][1] == most:
answer.append(m[i+1][0])
else:
break
for output in sorted(answer):
print(output)
|
[] | 571,202
| 571,203
|
u619084943
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.