Submission #4154

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>

using namespace std;

#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(itr,c) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

int main(){
  int i,d[5];
  int N;
  string in;

  cin >> N;
  cin >> in;

  int mn = (1<<29), mx = 0;
  rep(i,5) d[i] = 0;
  rep(i,N) d[in[i]-'0']++;
  rep(i,5) if(i != 0){
    mx = max(mx,d[i]);
    mn = min(mn,d[i]);
  }

  cout << mx << ' ' << mn << endl;

  return 0;
}

Submission Info

Judge Result