Problem:


Score : 300 points

Problem Statement

In AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:  

Rating 1-399 : gray

Rating 400-799 : brown

Rating 800-1199 : green

Rating 1200-1599 : cyan

Rating 1600-1999 : blue

Rating 2000-2399 : yellow

Rating 2400-2799 : orange

Rating 2800-3199 : red

Other than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.

Currently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.

Find the minimum and maximum possible numbers of different colors of the users.  

Constraints

1 ≤ N ≤ 100

1 ≤ a_i ≤ 4800

a_i is an integer.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.  

Sample Input 1

4
2100 2500 2700 2700

Sample Output 1

2 2

The user with rating 2100 is "yellow", and the others are "orange". There are two different colors.  

Sample Input 2

5
1100 1900 2800 3200 3200

Sample Output 2

3 5

The user with rating 1100 is "green", the user with rating 1900 is blue and the user with rating 2800 is "red".

If the fourth user picks "red", and the fifth user picks "blue", there are three different colors. This is one possible scenario for the minimum number of colors.

If the fourth user picks "purple", and the fifth user picks "black", there are five different colors. This is one possible scenario for the maximum number of colors.  

Sample Input 3

20
800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990

Sample Output 3

1 1

All the users are "green", and thus there is one color.



Sample input:
4
2100 2500 2700 2700


Sample output:
2 2

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
hai, tya midori = 0, 0, 0
mmiz, ao, ki = 0, 0, 0
yanagi, aka, got = 0, 0, 0

for i in a:
  if i<=399:
    hai = 1
  elif i<=799:
    tya = 1
  elif i<=1199:
    midori = 1
  elif i <= 1599:
    miz = 1
  elif i <= 1999:
    ao = 1
  elif i <= 2399:
      ki = 1
  elif i <= 2799:
      yanagi = 1
  elif i <= 3199:
      aka = 1
  elif i <= 4800:
    got += 1
minn = sum(hai+tya+midori+miz+ao+ki+yanagi+aka)
if minn + got >= 8:
  maxx = 8
else:
  maxx = minn+got
print(minn, maxx)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
hai, tya midori = 0, 0, 0
mmiz, ao, ki = 0, 0, 0
yanagi, aka, got = 0, 0, 0

for i in a:
  if i<=399:
    ai = 1
  elif i<=799:
    tya = 1
  elif i<=1199:
    midori = 1
  elif i <= 1599:
    miz = 1
  elif i <= 1999:
    ao = 1
  elif i <= 2399:
      ki = 1
  elif i <= 2799:
      yanagi = 1
  elif i <= 3199:
      aka = 1
  elif i <= 4800:
    got += 1
minn = sum(hai+tya+midori+miz+ao+ki+yanagi+aka)
if minn + got >= 8:
  maxx = 8
else:
  maxx = minn+got
print(minn, maxx)

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))
count= [0 for _ in range(9)]
for i in range(n):
    if a[i] // 400 >= 8:
        count[8] += 1
    elif count[a[i] // 400] == 0:
        count[a[i] // 400] += 1

if count[8] == sum(count):
    print(1, sum(count))
else:
    print(sum(count)-count[8], sum(count))

Submission status: Runtime Error

Solution code:
N=int(input())
a=list(map(int,input().split()))
count_color=[0]*8
wild_color=0
for i in range (N):
    if a[i]<400:
        count_color[0]=1
    elif a[i]<800:
        count_color[1]=1
    elif a[i]<1200:
        count_color[2]=1
    elif a[i]<1600:
        count_color[3]=1
    elif a[i]<2000:
        count_color[4]=1
    elif a[i]<2400:
        count_color[5]=1
    elif a[i]<2800:
        count_color[6]=1
    elif a[i]<3200:
        count_color[7]=1
    else:
        wild_color+=1
color=count_color.count(1)
print (color, min(color+wild_color))

Submission status: Runtime Error

Solution code:
n = int(input())
a = map(int, input().split(" "))

color_types = [False]*8
pro_count = 0
for a_i in a:
	if a_i < 3200:
		color_types[a_i//400] = True
	else:
		pro_count += 1
print(max(1,　sum(color_types)), min(8, sum(color_types)+pro_count))

Submission status: Runtime Error

Solution code:
n = int(input())
a = map(int, input().split(" "))

color_types = [False]*8
pro_count = 0
for a_i in a:
	if a_i < 3200:
		color_types[a_i//400] = True
	else:
		pro_count += 1
print(color_types)
print(sum(max(1,　color_types)), min(8, sum(color_types)+pro_count))

Submission status: Runtime Error

Solution code:
n = int(input())
a = map(int, input().split(" "))

color_types = [False]*7
pro_count = 0
for a_i in a:
	if a_i < 3200:
		color_types[a_i//400] = True
	else:
		pro_count += 1
print(sum(color_types), min(8, sum(color_types)+pro_count))

Submission status: Runtime Error

Solution code:
n = int(input())
a = tuple(map(int, input().split(" ")))

color_types = [False]*7
pro_count = 0
if a < 3200:
	color_types[a//400] = True
else:
	pro_count += 1
print(min(8, sum(color_types)+pro_count))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))

p_num = [0]*9

for a in A:
    p_num[a//400] += 1
    
ans = 0
for p in p_num[:-1]:
    if p:
        ans +=1
        
ans_min = ans
ans_max = ans + p_num[-1]

print(ans_min, ans_max)

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
r = list(map(int, input().split()))
if min(r) >= 3200:
  print(str(1)+' '+str(N))
  sys.exit()
li = [0 for i in range(9)]
for rates in r:
  n = rates//400
  li[n] += 1
p = 0
for nums in li[0:8]:
  if nums !=0:
    p += 1
print(str(p)+' '+str(p+li[8]))

Submission status: Runtime Error

Solution code:
# input
N = int(input())
A = list(map(int, input().split()))

count = [0, 0, 0, 0, 0, 0, 0, 0, 0]

for i in range(N):
    if A[i] < 400:
        count[0] = 1
    elif A[i] < 800:
        count[1] = 1
    elif A[i] < 1200:
        count[2] = 1
    elif A[i] < 1600:
        count[3] = 1
    elif A[i] < 2000:
        count[4] = 1
    elif A[i] < 2400:
        count[5] = 1
    elif A[i] < 2800:
        count[6] = 1
    elif A[i] < 3200:
        count[7] = 1
    else:
        count[8] += 1

color_max = sum(count)
if count[8] == 0:
    count_min = sum(count)
else:
    count_min = sum(count[:7]) + 1

print(count_min, count_max)

Submission status: Runtime Error

Solution code:
from collections import Counter

N, K = map(int, input().split())
input_list = [[int(i) for i in input().split()] for j in range(N)]
input_list.sort()

input_counter = Counter()

for element in input_list:
    input_counter[element[0]] += element[1]

for element in input_list:
    K -= element[1]
    if K <= 0:
        print(element[0])
        break

Submission status: Runtime Error

Solution code:
N=int(input())
 
flag=[0]*8
 
a=list(map(int,input().split()))
 
count=0
 
for i in range(N):
 if 1<=a[i]<=399:
  flag[0]=1
 if 400<=a[i]<=799:
  flag[1]=1
 if 800<=a[i]<=1199:
  flag[2]=1
 if 1200<=a[i]<=1599:
  flag[3]=1
 if 1600<=a[i]<1999:
  flag[4]=1
 if 2000<=a[i]<2399:
  flag[5]=1
 if 2400<=a[i]<2799:
  flag[6]=1
 if 2800<=a[i]<3199:
  flag[7]=1
 if 3200<=a[i]:
  count+=1
 
print(min(sum(flag),1),sum(flag)+count)
N=int(input())
 
flag=[0]*8
 
a=list(map(int,input().split()))
 
count=0
 
for i in range(N):
 if 1<=a[i]<=399:
  flag[0]=1
 if 400<=a[i]<=799:
  flag[1]=1
 if 800<=a[i]<=1199:
  flag[2]=1
 if 1200<=a[i]<=1599:
  flag[3]=1
 if 1600<=a[i]<1999:
  flag[4]=1
 if 2000<=a[i]<2399:
  flag[5]=1
 if 2400<=a[i]<2799:
  flag[6]=1
 if 2800<=a[i]<3199:
  flag[7]=1
 if 3200<=a[i]:
  count+=1
 
print(max(sum(flag),1),sum(flag)+count)

Submission status: Runtime Error

Solution code:
l = [0,0,0,0,0,0,0,0,0]
n = int(input())
a = list(map(int,input().split()))

for i in range(len(a)):
    if 1 <=  a[i] <= 399:
        l[0] = l[0] + 1
    elif 400 <=  a[i] <= 799:
        l[1] = l[1] + 1
    elif 800 <=  a[i] <= 1199:
        l[2] = l[2] + 1
    elif 1200 <=  a[i] <= 1599:
        l[3] = l[3] + 1
    elif 1600 <=  a[i] <= 1999:
        l[4] = l[4] + 1
    elif 2000 <=  a[i] <= 2399:
        l[5] = l[5] + 1
    elif 2400 <=  a[i] <= 2799:
        l[6] = l[6] + 1
    elif 2800 <=  a[i] <= 3199:
        l[7] = l[7] + 1
    else:
        l[8] = l[8] + 1
        
tokurei = 0        
for i in range(7):
    tokurei = tokurei + l[i]

if tokurei = 0:
    print('1 ' + str(l[8]) )
else:
    flag = 0
    for i in range(7):
        if l[i] > 0:
            flag = flag + 1
    print(str(flag) + ' ' + str(flag + l[8]))

Submission status: Runtime Error

Solution code:
for i in range(n):
    b.append(a[i]//400)
for i in range(13):
    if b.count(i) >=1:
        if i<= 7:
            countmax +=1
            countmin +=1
        else:
            countmax += b.count(i)
print(countmin,countmax)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(4800//400)]
for i in a:
    b[i//400] += 1;
t = 0
ans = 0
for i in range(4800//400):
    if b[i] > 0:
        if i < 3200//400:
            ans+=1
        else:
            t+=b[i]
if ans > 0:
    print(ans,t+ans)
else:
    print(1,t)

Submission status: Runtime Error

Solution code:
n=int(input())
l=[int(i) for i in input().split()]
cnt=[0]*9
ans=0
for i in l:
    if i>3199:
        i=3200
    cnt[i//400]+=1
for p in range(n-1):
    i=cnt[p]
    if i!=0:
        ans+=1
print(ans if ans!=0 else 1,ans+cnt[-1])

Submission status: Runtime Error

Solution code:
n=int(input())
n,k=map(int,input().split())
l=[int(i) for i in input().split()]
cnt=[0]*9
ans=0
for i in l:
    if i>3199:
        i=3200
    cnt[i//400]+=1
for p in range(n-1):
    i=cnt[p]
    if i!=0:
        ans+=1
print(ans if ans!=0 else 1,ans+cnt[-1])

Submission status: Runtime Error

Solution code:
N=int(input())
a=[int(i)//400 for i in input().split()]
s=set()
r=0
for i in range(N):
    if a[i]==7:
        r+=1
    else:
        s.add(a[i])
print("{0} {1}".format(min([1,len(s)]),len(s)+r)

Submission status: Runtime Error

Solution code:
N = int(input())
a =  list(map(int,input().split(" ")))

free = 0
arr = [0] * 8

for i in a:
	limit = 400
	while (limit <= 3200):
		if i < limit:
			arr[(limit // 400)-1] +=  1
			break
		else:
			limit += 400

	if limit== 3600:
		free += 1

color =  0
for i in arr:
	if i > 0:
		color += 1


print(str(max(1,str(color))) + " " + str(min(color + free,8)))

Submission status: Runtime Error

Solution code:
N = int(input())
a =  list(map(int,input().split(" ")))

free = 0
arr = [0] * 8

for i in a:
	limit = 400
	while (limit <= 3200):
		if i < limit:
			arr[(limit // 400)-1] +=  1
			break
		else:
			limit += 400

	if limit== 3600:
		free += 1

color =  0
for i in arr:
	if i > 0:
		color += 1


print(max(1,str(color)) + " " + str(min(color + free,8)))

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#define rep(i, m, n) for(int i = m;i < n;i++)
#define repr(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define INF 999999999
using namespace std;

int main(){
    int n; cin >> n;
    int color[8] = {0}; //最初ブールでやったら失敗した
    int wild_card = 0;
    int rate;

    rep(i, 0, n){
        cin >> rate;
        if(rate <= 399) color[0] = 1;
        else if(rate <= 799) color[1] = 1;
        else if(rate <= 1199) color[2] = 1;
        else if(rate <= 1599) color[3] = 1;
        else if(rate <= 1999) color[4] = 1;
        else if(rate <= 2399) color[5] = 1;
        else if(rate <= 2799) color[6] = 1;
        else if(rate <= 3199) color[7] = 1;
        else wild_card += 1;
    }
    //色の種類数を求める
    int min = 0;
    rep(i, 0, 8) if(color[i] == 1) min += 1;

    int max;
    max = min + wild_card;
    if(max > 8) max = 8;

    cout << min << " " << max << endl;

    //rep(i, 0, 8) cout << color[i] << " ";

    return 0;
}

Submission status: Runtime Error

Solution code:
n = input()
a = map(int, raw_input().split())
color = [0 for _ in range(9)]
for item in a:
    i = item / 400
    i = max(i, 8)
    color[i] += 1

ans = 0
for num in color[0:8]:
    if num != 0:
        ans += 1

min_ans = max(ans, 1)
max_ans = ans + color[8]
max_ans = min(max_ans, 9)

print min_ans, max_ans

Submission status: Runtime Error

Solution code:
n = input()
a = map(int, raw_input().split())
color = [0 for _ in range(9)]
for item in a:
    i = item / 400
    color[i] += 1

ans = 0
for num in color[0:8]:
    if num != 0:
        ans += 1

min_ans = ans
max_ans = ans + color[8]
max_ans = max(min(max_ans, 9), 1)

print min_ans, max_ans

Submission status: Runtime Error

Solution code:
N = int(input())
a = [int(i) for i in input().split()]
rank = [0]*9
ans = [0]*2
for i in range(len(a)):
    if a[i] < 400:
        rank[0] = 1
    elif a[i] < 800:
        rank[1] = 1
    elif a[i] < 1200:
        rank[2] = 1
    elif a[i] < 1600:
        rank[3] = 1
    elif a[i] < 2000:
        rank[4] = 1
    elif a[i] < 2400:
        rank[5] = 1
    elif a[i] < 2800:
        rank[6] = 1
    elif a[i] < 3200:
        rank[7] = 1
    else:
        rank[8] += 1
ans[0] = sum(rank)
if 8 < ans[0]:
    ans[0] = 8
if rank[9] != 0 and (sum(rank[0:8])) == 0:
    ans[1] = 1
else:
    ans[1] = sum(rank[0:8])

[print(ans[i], end=' ') for i in reversed(range(len(ans)))]

Submission status: Runtime Error

Solution code:
n=int(input())
pr=list(map(int,input().split()))
rate_color=[]
suge=0
for i in range(n):
    if pr[i]>=3200:
        suge+=1
def cl(x):
    if x<=399:
        return [0]
    elif 400<=x<=799:
        return [1]
    elif 800 <=x<=1199:
        return [2]
    elif 1200 <=x<=1599:
        return [3]
    elif 1600<=x<= 1999:
        return [4]
    elif 2000 <=x<=2399:
        return [5]
    elif 2400 <=x<=2799:
        return [6]
    elif 2800 <=x<=3199:
        return [7]

for i in range(n):
    x=pr[i]
    rate_color+=cl(x)
color=list(set(rate_color))
color_num=len(color)


max_num=color_num+suge
if color_num==0:
    mini_num=1
else:
    mini_num=color_num
print(mini_num,max_num)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split(" ")))

colors=[]
if list(filter(lambda x:x<3200, a)):
    f=lambda x:x<400
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:400<=x<800
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:800<=x<1200
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:1200<=x<1600
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:1600<=x<2000
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:2000<=x<2400
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:2400<=x<2800
    colors.append(1 if list(filter(f, a)) else 0)
    f=lambda x:2800<=x<3200
    colors.append(1 if list(filter(f, a)) else 0)

    print(sum(colors), sum(colors)+len(list(filter(lambda x:3200<=x, a)))

else:
    print(1, n)

Submission status: Runtime Error

Solution code:
#Colorful Leaderboard
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))
b = sorted (a//400)
cnt = 0
for i in range(len(b)):s
    if b[i]  < 8:
        None
    else:
        b[i]+=i
        cnt+=1
c = len(list(set(b)))

print(str(c-cnt) + " " + str(c))

Submission status: Runtime Error

Solution code:
#Colorful Leaderboard
import numpy as np
import math as m
n = int(input())
a = np.array(list(map(int, input().split())))
b = sorted (a//400)
cnt = 0
for i in range(len(b)):s
    if b[i]  < 8:
        None
    else:
        b[i]+=i
        cnt+=1
c = len(list(set(b)))

print(str(c-cnt) + " " + str(c))

Submission status: Runtime Error

Solution code:
    import numpy as np
    n=input()
    n=int(n)
    a=input().split()
    b=np.zeros(n)
    div=0
    num_8=0
    for i in range(n):
     a[i]=int(a[i])
     if a[i]<=399 and a[i]>=1:
      b[i]=0
     elif a[i]>=400 and a[i]<=799:
      b[i]=1
     elif a[i]>=800 and a[i]<=1199:
      b[i]=2
     elif a[i]>=1200 and a[i]<=1599:
      b[i]=3
     elif a[i]>=1600 and a[i]<=1999:
      b[i]=4
     elif a[i]>=2000 and a[i]<=2399:
      b[i]=5
     elif a[i]>=2400 and a[i]<=2799:
      b[i]=6
     elif a[i]>=2800 and a[i]<=3199:
      b[i]=7
     else:
      b[i]=8
      num_8=num_8+1
    for i in range(8):
     if i in b:
      div=div+1
    min=div
    max=div+num_8
    if min==0:
     min=1
    print(min,max)

Submission status: Runtime Error

Solution code:
number = int(input())
rate = [int(i) for i in input().split()]


# In[7]:

counter = {}
for r in rate:
    if 1 <= r < 400:
        counter["grey"] = counter.get("grey", 0) + 1
    if 400 <= r < 800:
        counter["brown"] = counter.get("brown", 0) + 1
    if 800 <= r < 1200:
        counter["green"] = counter.get("green", 0) + 1
    if 1200 <= r < 1600:
        counter["sky"] = counter.get("sky", 0) + 1
    if 1600 <= r < 2000:
        counter["blue"] = counter.get("blue", 0) + 1
    if 2000 <= r < 2400:
        counter["yellow"] = counter.get("yellow", 0) + 1
    if 2400 <= r < 2800:
        counter["orange"] = counter.get("orange", 0) + 1
    if 2800 <= r < 3200:
        counter["red"] = counter.get("red", 0) + 1
    if 3200 <= r:
        counter["color"] = counter.get("color", 0) + 1

answer = 0
for k, v in counter.items():
    if not v == 0:
        answer += 1
        
if counter.get("color", 0) == 0:
    print(str(answer) + " " + str(answer))
else:
    if answer == 1:
        print("1 " + str(counter["colors"]))
    else:
        print(str(answer-1) + " " + str(answer-1+counter["color"]))

Submission status: Runtime Error

Solution code:
number = int(input())
rate = [int(i) for i in input().split()]


# In[7]:

counter = {}
for r in rate:
    if 1 <= r < 400:
        counter["grey"] = counter.get("grey", 0) + 1
    if 400 <= r < 800:
        counter["brown"] = counter.get("brown", 0) + 1
    if 800 <= r < 1200:
        counter["green"] = counter.get("green", 0) + 1
    if 1200 <= r < 1600:
        counter["sky"] = counter.get("sky", 0) + 1
    if 1600 <= r < 2000:
        counter["blue"] = counter.get("blue", 0) + 1
    if 2000 <= r < 2400:
        counter["yellow"] = counter.get("yellow", 0) + 1
    if 2400 <= r < 2800:
        counter["orange"] = counter.get("orange", 0) + 1
    if 2800 <= r < 3200:
        counter["red"] = counter.get("red", 0) + 1
    if 3200 <= r:
        counter["color"] = counter.get("color", 0) + 1

answer = 0
for k, v in counter.items():
    if not v == 0:
        answer += 1
        
if counter.get("color", 0) == 0:
    if answer == 1:
        print("1 " + str(counter["colors"]))
    else:
        print(str(answer) + " " + str(answer))
else:
    print(str(answer-1) + " " + str(answer-1+counter["color"]))

Submission status: Runtime Error

Solution code:
import sys


if __name__ == "__main__":
    N = int(input())

    rates = [map(int, raw_input().split()) for i in range(N)]
    # tasks = np.array(tasks)
    normal_colors = int(3200/400)
    colors = [None] * normal_colors
    any = 0
    for rate in rates:
        if rate >= 3200:
            any +=1
        else:
            colors[rate/400] = 1
    print(sum(colors), sum(colors)+any)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
#レート 1-399：灰色 :gray
#レート 400-799：茶色 :brown
#レート 800-1199：緑色 : green
#レート 1200-1599：水色 :skyblue
#レート 1600-1999：青色 :blue
#レート 2000-2399：黄色 :yellow
#レート 2400-2799：橙色 :orange
#レート 2800-3199：赤色 :red

x = int(input())

y = input().split()

gray = 0
brown = 0
green = 0
skyblue = 0
blue = 0
yellow = 0
orange = 0
red = 0
other = 0

for i in range(x):
    z = int(y[i]) 
    if z < 400:
       gray = 1 
    elif z < 800:
        brown = 1
    elif z < 1200:
        green = 1
    elif z < 1600:
        skyblue = 1
    elif z < 2000:
        blue = 1
    elif z < 2400:
        yellow = 1
    elif z < 2800:
        orange = 1
    elif z < 3200:
        red = 1
    else:
        other = other + 1

if other > 1:
    ans_max = gray + brown + green + skyblue + blue + yellow + orange + red + other
    ans_min = gray + brown + green + skyblue + blue + yellow + orange + red + 1
    
    print(ans_min & " " & ans_max)

else:
    ans = gray + brown + green + skyblue + blue + yellow + orange + red + other
    
    print(ans & " " & ans)

Submission status: Runtime Error

Solution code:
N = input()
a = [int(int(i)/400) for i in input().split()]
scores = [0,0,0,0,0,0,0,0]
score8 = 0
for i,v in enumerate(a):
    if v > 7:
        score8 += 1
    else:
        scores[i] = 1
score1to7 = sum(scores)
saidai = min(score1to7 + score8, 8)
saisho = min(max(score1to7, score8), 8)
print(str(saisho) + " " + str(saidai))

Submission status: Runtime Error

Solution code:
N = input()
a = [int(int(i)/400) for i in input().split()]
print(a)
scores = [0,0,0,0,0,0,0,0]
score8 = 0
for i,v in enumerate(a):
    if v > 7:
        score8 += 1
    else:
        scores[i] = 1
score1to7 = sum(scores)
saidai = min(score1to7 + score8, 8)
saisho = min(max(score1to7, score8), 8)
print(str(saisho) + " " + str(saidai))

Submission status: Runtime Error

Solution code:
def hantei(num):
    if num>0 and num<400:
        return 1
    elif num>=400 and num<800:
        return 2
    elif num>=800 and num<1200:
        return 3
    elif num>=1200 and num<1600:
        return 4
    elif num>= 1600 and num<2000:
        return 5
    elif num>=2000 and num<2400:
        return 6
    elif num>=2400 and num<2800:
        return 7
    elif num>=2800 and num<3200:
        return 8
    else:
        return 0

N = input()
l = input().split()
tmp_list = []
num=0
for i in l:
    hoge = hantei(int(i))
    if hoge == 0:
        num+=1
    else:
        tmp_list.append(hoge)
min = len(set(tmp_list))
max = min + num
print(min + ' ' + max)

Submission status: Runtime Error

Solution code:
N=input()
nlist= [int(l) for l in raw_input().split(' ')]

rate= [0,0,0,0,0,0,0]
max = 0
for n in nlist:
	if n/400>=8:
		max += 1
	else:
		rate[n/400]=1

print(sum(rate)),
if sum(rate)+max > 8:
	print(8)
else:
	print(sum(rate)+max)

Submission status: Runtime Error

Solution code:
N=input()
nlist= [int(l) for l in raw_input().split(' ')]

rate= [0,0,0,0,0,0,0]
max = 0
for n in nlist:
	if n/400>=8:
		max += 1
	rate[n/400]=1

print(sum(rate)),
if sum(rate)+max > 8:
	print(8)
else:
	print(sum(rate)+max)

Submission status: Runtime Error

Solution code:
N=input()

A=list(map(int,input().split()))

Rate=[]
for i in range(9):
    Rate.append(0)

for i in A:
    index=i/400
    if index>8:
        index=8
    Rate[index]=Rate[index]+1

a=0

for i in range(8):
    if Rate[i]>0:
        a=a+1

Max=a+Rate[8]
Min=min(a,1)

print(Min, Max)

Submission status: Runtime Error

Solution code:
n = input()
a = [int(num) for num in input().split()]
colors = [0 for i in range(8)]
borders = [1,400,800,1200,1600,2000,2400,2800,3200]
alpha = 0
for i in a:
    for j in range(1,n):
        if borders[j-1]<=i<borders[j]:
            colors[j-1] = 1
            break
    if i>3200:
        alpha +=1
col_min = colors.count(1)
col_max = colors.count(1) + alpha
if col_max>8:
    col_max = 8
print(str(col_min)+' '+str(col_max))

Submission status: Runtime Error

Solution code:

N=int(input())

a=[int(i) for i in input().split()]

color=[0,0,0,0,0,0,0,0]
alles=0

for i in range(N) :
    
    if a[i]<400 :
        color[0]+=1
    elif a[i]<800 :
        color[1]+=1
    elif a[i]<1200 :
        color[2]+=1
    elif a[i]<1600 :
        color[3]+=1
    elif a[i]<2000 :
        color[4]+=1
    elif a[i]<2400 :
        color[5]+=1
    elif a[i]<2800 :
        color[6]+=1
    elif a[i]<3200 :
        color[7]+=1
    else :
        alles+=1

        
while 0 in color :color.remove(0)
eight=int(8)

if alles>=8 :
    print(eight," ",eight)
elif alles+len(color)>8 :
    if alles>=len(color) :
        print(alles," ",eight)
    else :
        print(len(color)," ",eight)
else :
    if alles>=len(color) :
        print(alles," ",lem(color)+alles)
    else :
        print(len(color)," ",len(color)+alles)

Submission status: Runtime Error

Solution code:
a=[0]*9;input()
for x in list(map(int,input().split())):a[x//400]=1 if x<3200 else a[8]+1
b=sum(a[:8]);print(b,b*(b in[0,8])ora=[0]*9;input()
for x in list(map(int,input().split())):
    if x<3200:a[x//400]=1
    else:a[8]+=1
b=sum(a[:8]);print(b,b*(b==8)or b+a[8]) b+a[8])

Submission status: Runtime Error

Solution code:
a=[0]*9;input()
for x in list(map(int,input().split())):a[x//400]=1 if x<3200 else a[8]+1
b=sum(a[:8]);print(b,b*(b in[0,8])or b+a[8])

Submission status: Runtime Error

Solution code:
a=[0]*9;input()
for x in list(map(int,input().split())):
    if x<3200:a[x//400]=1
    else:a[x//400]+=1
b=sum(a[:8]);print(b,b*(b==8)or b+a[8])

Submission status: Runtime Error

Solution code:
a=[0]*9;input()
for x in list(map(int,input().split())):
    if x<3200:a[x//400]=1
    else:a[x//400]+=1
b=sum(a[:8]);print((b,b)*(b==8)or b,b+a[8])

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys

N = input()
an = input()
lit = sorted(map(int, an.split()))
color = {}

for i in range(400, 3199, 399):
    color[i] = filter(lambda x: i-400 < x <i , lit)
color[3200] = filter(lambda x: x>=3200, lit)

c = len(color)
if color.has_key(3200):
    c -= - 1

if c >= 8:
    print('8 8')
else:
    rainbow = len(color[3200])
    mini = c
    c += rainbow
    maxi = 8 if c >= 8 else c
    print('{} {}'.format(mini, maxi))

Submission status: Runtime Error

Solution code:
N = int(input())
a = [int(n) for n in input().split()]
a = sorted(a)

colors = [0,0,0,0,0,0,0,0]
free = 0

for i in a:
    if i < 400:
        colors[0] = 1
    elif i < 800:
        colors[1] = 1
    elif i < 1200:
        colors[2] = 1
    elif i < 1600:
        colors[3] = 1
    elif i < 2000:
        colors[4] = 1
    elif i < 2400:
        colors[5] = 1
    elif i < 2800:
        colors[6] = 1
    elif i < 3200:
        colors[7] = 1
    else:
        free += 1

print(str(sum(colors)) + " " + str(min(sum(colors) + free, 8)))
N = int(input())
a = [int(n) for n in input().split()]
a = sorted(a)

colors = [0,0,0,0,0,0,0,0]
free = 0

for i in a:
    if i < 400:
        colors[0] = 1
    elif i < 800:
        colors[1] = 1
    elif i < 1200:
        colors[2] = 1
    elif i < 1600:
        colors[3] = 1
    elif i < 2000:
        colors[4] = 1
    elif i < 2400:
        colors[5] = 1
    elif i < 2800:
        colors[6] = 1
    elif i < 3200:
        colors[7] = 1
    else:
        free += 1

print(str(sum(colors)) + " " + str(min(sum(colors) + free, 8)))

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int, input().split()))
flag = [0]*9
ans = 0
ans_max =0
for i in range(N):
    num = a[i]//400
    if num>=8:
        flag[num]+=1
    else:
        flag[num]=1
ans = sum(flag[:-1])
if ans + flag[8]>=8:
    ans_sum = 8
else: 
    ans_sum= ans+flag[8]
    
print(ans, ans_sum)

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int, input().split()))
flag = [0]*9
ans = 0
ans_max =0
for i in range(N):
    num = a[i]//400
    if num>8:
        flag[num]+=1
    else:
        flag[num]=1
ans = sum(flag[:-1])
if flag[8]>8:
    ans_sum = ans + 8
else:
    ans_sum = ans + flag[8]
    
print(ans, ans_sum)

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int, input().split()))
flag = [0]*9
ans = 0
ans_max =0
for i in range(N):
    num = int(a[i]/400)
    flag[num]+=1
for i in range(len(flag)-1):
    if flag[i]>=1:
        ans += 1
if flag[8]>8:
    ans_sum = ans + 8
else:
    ans_sum = ans + flag[8]
    
print(ans, ans_sum)

Submission status: Runtime Error

Solution code:
n=int(input())
aa=map(int,input().split())
aa=list(aa)
memo=[]
count=0
for a in aa:
    if a<400:memo.append(1)
    elif a<800:memo.append(2)
    elif a<1200:memo.append(3)
    elif a<1600:memo.append(4)
    elif a<2000:memo.append(5)
    elif a<2400:memo.append(6)
    elif a<2800:memo.append(7)
    elif a<3200:memo.append(8)
    else:count+=1

memo=set(memo)
min=len(memo)
if min=0:min=1
max=len(memo)+count
if max>8: max=8
print(min,max)

Submission status: Runtime Error

Solution code:
input()
rates = sorted([int(x) for x in input().split()])
counts = []
for boundary in [399, 799, 1199, 1599, 1999, 2399, 2799, 3199]:
    counts.append(1 if rates[0] <= boundary else 0)
    rates = [rate for rate in rates if rate > boundary]
higher = len(rates)
least = sum(counts)
print("{} {}".format(1 if least == 0 else least, least+higher))

Submission status: Runtime Error

Solution code:
boundaries = [399, 799, 1199, 1599, 1999, 2399, 2799, 3199, 4800]
input()
rates = sorted([int(x) for x in input().split()])
counts = []
for boundary in boundaries:
    tmp = 0
    while rates[0] <= boundary:
        tmp += 1
        rates.pop(0)
    counts.append(tmp)
least = sum([x > 0 for x in counts[:-1]])
print("{} {}".format(1 if least == 0 else least, counts[-1]+least))

Submission status: Runtime Error

Solution code:
def c():
    n = int(input())
    a = list(map(int, input().split()))
    l = list(map(lambda i: min(8, i//400), a))
    over_rate = l.count(8)
    res = set(l)
    try: res.remove(8)

    mi = max(1, len(res))
    ma = len(res) + over_rate
    print(mi, ma)

c()

Submission status: Runtime Error

Solution code:
def c():
    n = int(input())
    a = list(map(int, input().split()))
    l = list(map(lambda i: min(8, i//400), a))
    over_rate = l.count(8)
    res = set(l)
    try: res.remove(8)

    mi = max(1, len(res))
    ma = len(res) + over_rate
    print(mi, ma)

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
a_int = list(map(int,a))
col = 400
all_col = 0 
c= [0,0,0,0,0,0,0,0]
for i in range(n):
    if a_int[i] > 8 * col:
        all_col += 1
    else:
        ii = int(a_int[i]/col)
        if c[ii] < 1:
            c[ii] += 1
        
cnt = c.count(1)
min_c = max(cnt, 1)
max_c = min_c + all_col
if max_c > 8:
    max_c -= max_c -8
print(str(min_c)+' ' +str(max_c))

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
a_int = list(map(int,a))
col = 400
all_col = 0 
c= [0,0,0,0,0,0,0,0]
for i in range(n):
    if a_int[i] > max_c * col:
        all_col += 1
    else:
        ii = int(a_int[i]/col)
        if c[ii] < 1:
            c[ii] += 1
        
cnt = c.count(1)
min_c = max(cnt, 1)
max_c = min_c + all_col
if max_c > 8:
    max_c -= max_c -8
print(str(min_c)+' ' +str(max_c))

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
a_int = list(map(int,a))
col = 400
all_col = 0 
max_c = 8
c= [0,0,0,0,0,0,0,0]
for i in range(n):
    if a_int[i] > max_c * col:
        all_col += 1
    else:
        ii = int(a_int[i]/col)
        if c[ii] < 1:
            c[ii] += 1
        
cnt = c.count(1)
min_c = max(cnt, 1)
 
print(str(min_c)+' ' +str(max_c))

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
a_int = list(map(int,a)
col = 400
all_col = 0 
max_c = 8
for i in range(n):
    if a_int > max_c * col:
        all_col += 1
    else:
        ii = int(a_int/col)
        if c[ii] < 1
            c[ii] += 1
        
cnt = c.count(1)
min_c = max(cnt, 1)

print(str(min_c)+' ' +str(max_c))

Submission status: Runtime Error

Solution code:
from collections import Counter
input()
c = Counter([min(int(i)//400,8) for i in input().split()])
lt3200 = [bool(c[i]) for i in range(8)].count(True)
print(max(1, lt3200), lt3200+d[8])

Submission status: Runtime Error

Solution code:
from collections import Counter
input()
scores = [min(int(i)//400, 8) for i in input().split()]
c = Counter([min(int(i)//400,8) for i in input().split()])
lt3200 = [bool(i) for i in c[:8]].count(True)
print(max(1, lt3200), lt3200+d[8])