QOJ.ac

QOJ

Limite de temps : 1 s Limite de mémoire : 32 MB Points totaux : 10

#10377. 郁金香

Statistiques

在 Byteland,已知有 15000 种郁金香(现实世界中已知的郁金香品种数量大致相同)。多年来,Byteasar 一直在维护他的私人郁金香索引,其中每种华丽的花卉都被分配了一个 1 到 15000 之间的目录编号。

最近,Bytean 植物园的董事会对 Byteasar 的索引产生了兴趣。花园里种植了许多不同种类的郁金香。董事会认为,如果他们能够收集到所有不同种类的郁金香,将会大大提高花园的知名度。他们请 Byteasar 找出花园里还缺少多少种郁金香。

Byteasar 已经设法识别出了花园中各个花坛里种植的郁金香种类。不幸的是,他很难计算出还缺少多少种郁金香。你能帮帮他吗?

输入格式

标准输入的第一行包含一个整数 $n$ ($1 \le n \le 20\,000$),表示花园中郁金香花坛的数量。第二行包含 $n$ 个整数,取值范围在 $[1,15\,000]$ 之间,表示花园中各个花坛里种植的郁金香种类的目录编号。

输出格式

你的程序应向标准输出打印一行,包含一个整数:董事会为了使花园拥有所有种类的郁金香,还需要购买的郁金香种类数量。

样例

输入 1

8
3 6 2 2 4 6 3 7

输出 1

14995

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.