1030 : Count Different Numbers O
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 59 次Times
- 通过次数Solved
- 26 次Times
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
Given a series of n numbers, find the total number of different numbers.
For example: the numbers are {2, 2, 1, 3, 4, 4, 5}, and different numbers are {2, 1, 3, 4, 5}. The answer is 5.
输入格式Input
There are no more than 100 test cases. Each case contains two lines.
The first line is integer number 1 <= n <= 100.
The second line are the n integer numbers which are in range [1, 10^4].
输出格式Output
The total number of different numbers.
样例Sample
出题Author
CSGrandeur
来源Source
深圳技术大学第一届程序设计竞赛(SZTUCPC2021)
题目到此结束End of problem