Submission #2865532

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#define REP(i, n) for(i=0; i<n; i++)
#define REPR(i, n) for(i=n; i>=0; i--)
#define FOR(i, m, n) for(i=m; i<n; i++)
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define INF 10000000000
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;

ll modpow(ll x, ll n) {
    ll res=1;
    while(n>0) {
        if(n&1) res=res*x%MOD;
        x=x*x%MOD;
        n>>=1;
    }
    return res;
}


int main() {
    ll n, ans=0;
    ll color[8]={0};
    cin >> n;
    ll a[n];
    ll i;
    ll pro=0;
    for(i=0; i<n; i++) {
        cin >> a[i];
        if(a[i]<3200)
            color[a[i]/400]=1;
        else
            pro++;
    }
    
    for(i=0; i<8; i++) {
        ans+=color[i];
    }
    cout << min(1, ans) << " " << min(8, ans+pro) << endl;
}

Submission Info

Judge Result