CF937A.Olympiad

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The recent All-Berland Olympiad in Informatics featured $n$ participants with each scoring a certain amount of points.

As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria:

At least one participant should get a diploma.
None of those with score equal to zero should get awarded.
When someone is awarded, all participants with score not less than his score should also be awarded.

Determine the number of ways to choose a subset of participants that will receive the diplomas.

输入格式

The first line contains a single integer $n$ ( $1<=n<=100$ ) — the number of participants.

The next line contains a sequence of $n$ integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=600$ ) — participants' scores.

It's guaranteed that at least one participant has non-zero score.

输出格式

Print a single integer — the desired number of ways.

输入输出样例

输入#1
```
4
1 3 3 2
```
输出#1
```
3
```
输入#2
```
3
1 1 1
```
输出#2
```
1
```
输入#3
```
4
42 0 0 42
```
输出#3
```
1
```

说明/提示

There are three ways to choose a subset in sample case one.

Only participants with 3 points will get diplomas.
Participants with 2 or 3 points will get diplomas.
Everyone will get a diploma!

The only option in sample case two is to award everyone.

Note that in sample case three participants with zero scores cannot get anything.

首页