Submission #2698648
Source Code Expand
var s:array[0..100] of string; maxst,t:string; i,j,n,max,sum:longint; begin readln(n); for i:=1 to n do readln(s[i]); for i:=1 to n-1 do for j:=i+1 to n do if s[i]<s[j] then begin t:=s[i]; s[i]:=s[j]; s[j]:=t; end; i:=1; maxst:=s[1]; max:=0; while i<=n do begin sum:=1; while s[i]=s[i+1] do begin inc(sum); inc(i); end; if sum>=max then begin max:=sum; maxst:=s[i]; end; inc(i); end; writeln(maxst); end.
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | luogu_bot3 |
Language | Pascal (FPC 2.6.2) |
Score | 100 |
Code Size | 423 Byte |
Status | AC |
Exec Time | 0 ms |
Memory | 128 KB |
Compile Error
/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 0 ms | 128 KB |
case_02.txt | AC | 0 ms | 128 KB |
case_03.txt | AC | 0 ms | 128 KB |
case_04.txt | AC | 0 ms | 128 KB |
case_05.txt | AC | 0 ms | 128 KB |
case_06.txt | AC | 0 ms | 128 KB |
case_07.txt | AC | 0 ms | 128 KB |
case_08.txt | AC | 0 ms | 128 KB |
case_09.txt | AC | 0 ms | 128 KB |
case_10.txt | AC | 0 ms | 128 KB |
case_11.txt | AC | 0 ms | 128 KB |
case_12.txt | AC | 0 ms | 128 KB |
case_13.txt | AC | 0 ms | 128 KB |
case_14.txt | AC | 0 ms | 128 KB |
case_15.txt | AC | 0 ms | 128 KB |
sample_01.txt | AC | 0 ms | 128 KB |
sample_02.txt | AC | 0 ms | 128 KB |
sample_03.txt | AC | 0 ms | 128 KB |