Submission #14174735

Source Code Expand

from collections import Counter

N=int(input())
S=[]

for _ in range(N):
    s=input()
    S.append(s)

c=Counter(S)
arr=c.most_common()

maxnum=arr[0][1]
ans=[]

for i in range(len(arr)):
    if arr[i][1]==maxnum:
        ans.append(arr[i][0])        
    else:
        break
FA=sorted(ans)
for j in FA:
    print(j)

Submission Info

Submission Time
Task C - Poll
User negibose2020
Language Python (3.4.3)
Score 300
Code Size 339 Byte
Status AC
Exec Time 731 ms
Memory 49228 KiB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt
Case Name Status Exec Time Memory
sample_01.txt AC 20 ms 3316 KiB
sample_02.txt AC 20 ms 3316 KiB
sample_03.txt AC 20 ms 3316 KiB
sample_04.txt AC 20 ms 3316 KiB
sub1_01.txt AC 652 ms 45420 KiB
sub1_02.txt AC 375 ms 27896 KiB
sub1_03.txt AC 731 ms 49172 KiB
sub1_04.txt AC 727 ms 49152 KiB
sub1_05.txt AC 42 ms 5244 KiB
sub1_06.txt AC 396 ms 28272 KiB
sub1_07.txt AC 313 ms 25852 KiB
sub1_08.txt AC 131 ms 8952 KiB
sub1_09.txt AC 35 ms 4084 KiB
sub1_10.txt AC 267 ms 16124 KiB
sub1_11.txt AC 147 ms 11780 KiB
sub1_12.txt AC 59 ms 6660 KiB
sub1_13.txt AC 413 ms 31856 KiB
sub1_14.txt AC 314 ms 21376 KiB
sub1_15.txt AC 164 ms 11264 KiB
sub1_16.txt AC 248 ms 14844 KiB
sub1_17.txt AC 312 ms 17152 KiB
sub1_18.txt AC 301 ms 17408 KiB
sub1_19.txt AC 85 ms 6656 KiB
sub1_20.txt AC 224 ms 13568 KiB
sub1_21.txt AC 277 ms 17152 KiB
sub1_22.txt AC 289 ms 17152 KiB
sub1_23.txt AC 701 ms 49228 KiB
sub1_24.txt AC 679 ms 49140 KiB