Submission #1573352

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <list>
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
using namespace std;
typedef pair<int,int> P;

int main(void){
    int n;
    cin>>n;
    string s;
    cin>>s;
    int Max=-INF,Min=INF;
    for(int i=1;i<=4;i++){
        int tmp=0;
        for(int j=0;j<s.size();j++){
            if(s[j]-'0'==i)tmp++;
        }
        Max=max(Max,tmp);
        Min=min(Min,tmp);
    }
    printf("%d %d\n",Max,Min);
    return 0;
}

Submission Info

Judge Result