Submission #1752613
Source Code Expand
#include <cstdio> #include <cstdlib> #include <iostream> #include <fstream> #include <sstream> #include <set> #include <map> #include <vector> #include <list> #include <algorithm> #include <cstring> #include <cmath> #include <string> #include <queue> #include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic #include <cassert> #include <iomanip> //do setprecision #include <ctime> #include <complex> using namespace std; #define FOR(i,b,e) for(int i=(b);i<(e);++i) #define FORQ(i,b,e) for(int i=(b);i<=(e);++i) #define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i) #define REP(x, n) for(int x = 0; x < (n); ++x) #define ST first #define ND second #define PB push_back #define MP make_pair #define LL long long #define ULL unsigned LL #define LD long double const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342; const int mod=1000000007; int main(){ int n,t[51]={},i,j,idx=0; string st[51]={},in; cin>>n; FOR(i,0,n){ cin>>in; int f=0; FOR(j,0,idx){ if(in==st[j]){ f=1; t[j]++; break; } } if(f==0){ t[idx]++; st[idx]=in; idx++; } } int max=0; FOR(i,0,idx){ //cout<<st[i]<<": "<<t[i]<<endl; if(t[i]>max){ max=t[i]; j=i; } } cout<<st[j]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | kt_tenel |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1418 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
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 | 1 ms | 256 KB |
case_02.txt | AC | 1 ms | 256 KB |
case_03.txt | AC | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 256 KB |
case_06.txt | AC | 1 ms | 256 KB |
case_07.txt | AC | 1 ms | 256 KB |
case_08.txt | AC | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | AC | 1 ms | 256 KB |
case_12.txt | AC | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 1 ms | 256 KB |
case_15.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |