Submission #4175

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<" "; cout<<endl; }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;

int main(){
  int n;
  cin>>n;
  int c[4] = {};
  string t;
  cin>>t;
  REP(i,n){
    c[t[i]-'1']++;
  }
  int a1=INF ,a2 = 0;
  REP(i,4){
    a1 = min(a1, c[i]);
    a2 = max(a2, c[i]);
  }
  printf("%d %d\n",a2, a1);
  return 0;
}

Submission Info

Judge Result