Submission #2865199

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
using ll = long long;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=int(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
const ll mod = 1000000007;
using namespace std;

int main() {
    int N;
    string s; cin >> N >> s;
    int a[5]={10000, 0, 0, 0, 0};
    for(int i=0; i<N; ++i){
        a[s[i]-'0']++;
    }
    sort(a, a+5);
    cout << a[3] <<" " <<a[0] << endl; 
	return 0;
}

Submission Info

Judge Result