Submission #1333938
Source Code Expand
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = 99999999;
const ll linf = 999999999999999999;
const double pi = acos(-1);
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define P(p) cout<<(p)<<endl;
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.end(), v.begin());
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a,n,k) (lower_bound(a,a+n,k) - a)
#define vlb(a,k) (lower_bound(a.begin(),a.end(),k) - a.begin())
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
///////////////////////////////////////////////////////////////////////////
int main(){
int n;
map<string,int> m;
string s;
cin >> n;
rep(i,0,n){
cin >> s;
m[s]++;
}
string smax = "fjdahg;iruahg;arh;uhg;ihgora";
for(auto it:m){
if(m[smax] < it.sd )smax = it.ft;
}
cout << smax << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 投票 |
User |
hirata0517masato |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1827 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 |