Submission #2560082

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include<vector>
#include<math.h>
#include<bitset>
#include<string>
#include <deque>
#include<queue>
#include<map>
using namespace std;
int A[9];
int main() {
	int N;
	
	int a;
	cin >> N ;
	for (int i = 0; i < N; i++) {
		cin >> a;
		if (a <= 399)A[0]++;
		if (400 <= a && a <= 799)A[1]++;
		if (800 <= a && a <= 1199)A[2]++;
		if (1200 <= a && a <= 1599)A[3]++;
		if (1600 <= a && a <= 1999)A[4]++;
		if (2000 <= a && a <= 2399)A[5]++;
		if (2400 <= a && a <= 2799)A[6]++;
		if (2800 <= a && a <= 3199)A[7]++;
		if (a >= 3200)A[8]++;
	}
	int Y = 0;
	for (int i = 0; i < 8; i++) {
		if (A[i] > 0)Y++;
	}

	int Z = A[8] + Y;
	if (Y == 0)Y++;

	if (Z > 8)Z = 8;

	cout << Y << ' ' << Z << endl;


	return 0;
}

Submission Info

Judge Result