Submission #1534128

---

Source Code Expand

#include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <functional>
#include <cstdlib>
#include <queue>
#include <tuple>
#include <map>
#include <cmath>

typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define SORT(v, n) sort(v, v+n)

using namespace std;

const double EPS =1e-9;
const long INF =999999999;
const long MINF =-999999999;


int main(){
	int i,j,p;
	int N,answers[5]={},max=0,min=100;
	string answer;

	cin>>N>>answer;
	
	FOR(i,0,N){
		j=answer[i]-'0';
		answers[j]++;
	}	

	FOR(i,1,5){
		if(answers[i]>max) max=answers[i];
		if(answers[i]<min) min=answers[i];
	}

	printf("%d %d\n",max,min);
	
	return 0;
}

Submission Info

Judge Result