• 454通过
• 797提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 桶排 概率论,统计 素数判断,质数,筛法
• 难度 入门难度
• 时空限制 1000ms / 256MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

题意：

现在有n个人，每个人都有一些分数（0<=a[i]<=600）,你要做的是统计有多少种分数（0和重复的都不算）。

输入格式：

第一行：一个n，接下来的一行里有n个数。

输出格式：

输出分数的种类。

感谢 @（T_T） 提供的翻译。

## 题目描述

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.

1. Only participants with 3 points will get diplomas.
2. Participants with 2 or 3 points will get diplomas.
3. 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.

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。