100642: [AtCoder]ABC064 C - Colorful Leaderboard

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

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.

Input

题意翻译

(ABC064 Task - C) ## 多彩排行榜 ### 题目描述 在AtCoder中,参加比赛的人名字会变成一种颜色,对应于该人的评级如下: ``` Rating 1 - 399:灰名 Rating 400 - 799:棕名 Rating 800 - 1199:绿名 Rating 1200 - 1599:青名 Rating 1600 - 1999:蓝名 Rating 2000 - 2399:黄名 Rating 2400 - 2799:橙名 Rating 2800 - 3199:红名 ``` 除了上述之外,Rating 为 3200 及以上的人可以自由地选择 TA 的颜色,可以是上面八种颜色中的一种颜色。 目前,有 $N$ 个用户参加过 AtCoder 的比赛,第i个用户的评分是 $a_i$。 查找用户的不同颜色的最小和最大可能数量。 ### 输入格式 输入由标准输入以下列格式给出: $ N $ $ a_1 $ $ a_2 $ $ ... $ $ a_N $ ### 输出格式 输出不同名字颜色的用户的最小可能数量,以及不同颜色的最大可能数量,中间有空格。 ### 数据范围 $1≤n≤100$ $1≤a_i≤4800$ $a_i$ 是一个整数。 ## Markdown 源码 ``` (ABC064 Task - C) ## 多彩排行榜 ### 题目描述 在AtCoder中,参加比赛的人名字会变成一种颜色,对应于该人的评级如下: Rating 1 - 399:灰名 Rating 400 - 799:棕名 Rating 800 - 1199:绿名 Rating 1200 - 1599:青名 Rating 1600 - 1999:蓝名 Rating 2000 - 2399:黄名 Rating 2400 - 2799:橙名 Rating 2800 - 3199:红名 除了上述之外,Rating 为 3200 及以上的人可以自由地选择 TA 的颜色,可以是上面八种颜色中的一种颜色。 目前,有 $N$ 个用户参加过 AtCoder 的比赛,第i个用户的评分是 $a_i$。 查找用户的不同颜色的最小和最大可能数量。 ### 输入格式 输入由标准输入以下列格式给出: $ N $ $ a_1 $ $ a_2 $ $ ... $ $ a_N $ ### 输出格式 输出不同名字颜色的用户的最小可能数量,以及不同颜色的最大可能数量,中间有空格。 ### 数据范围 $1≤n≤100$ $1≤a_i≤4800$ $a_i$ 是一个整数。 ```

加入题单

上一题 下一题 算法标签: