Submission #4743

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <utility>

using namespace std;
int d[10];
int main(){
	int n;
	string s;
	fill(d,d+10,0);
	cin >> n >> s;
	for(int i=0;i<s.size();i++){
		d[s[i]-'0'-1]++;
	}
	sort(d,d+10,greater<int>());
	cout<<d[0]<<" "<<d[3]<<endl;
	
	return 0;
}

Submission Info

Judge Result