Submission #1706212

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
 
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#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
#define C(i) cin>>i
#define C2(i,j) cin>>i>>j
#define C3(i,j,k) cin>>i>>j>>k
#define C4(i,j,k,m) cin>>i>>j>>k>>m
////////////////////////////////////////////////////////////

int main(){
  map<string,long> mp = {};
  
  long n;
  cin >> n;

  for(long i = 0 ; i < n ; i++ ){
    long a,b;
    cin >> a >> b;
    
    for(long c = a ; c <= b ; c++ ){
      
      string s = to_string(c);
      
      mp[s]++;
      //printf("s:%s c:%ld mp[s]:%ld\n",s.c_str(),c,mp[s]);
    }

  }
  
  long max_count = 0;
  for(auto itr = mp.begin() ; itr != mp.end() ; ++itr){
    long num = itr->second;
    max_count = max(max_count , num);
  }

  P(max_count);
  ret 0;
}

Submission Info

Judge Result