QOJ.ac

QOJ

Süre Sınırı: 2 s Bellek Sınırı: 1024 MB

#23934. 出現嘅數字

İstatistikler

題目描述

畀定一個由 $0$ 以上 $9$ 以下嘅整數組成、長度為 $N$ 嘅數列 $A = (A_1, A_2, \dots, A_N)$。請由細到大順序輸出喺數列 $A$ 入面至少出現過 $1$ 次嘅所有整數。

數據範圍

  • $1 \le N \le 100$。
  • $0 \le A_i \le 9$($1 \le i \le N$)。
  • 輸入嘅所有數值都係整數。

輸入格式

輸入會按以下格式畀出:

$N$ $A_1$ $A_2$ $\dots$ $A_N$

輸出格式

請將數列 $A$ 入面至少出現過 $1$ 次嘅所有整數由細到大順序、用換行隔開輸出。

除咗結果之外唔好輸出任何嘢。(亦都唔好輸出提示輸入嘅句子等等。)

關於作答格式,亦都可以參考練習題同埋解答範例。

範例 1

範例輸入 1

8
2 0 2 3 0 9 1 6

範例輸出 1

0
1
2
3
6
9
  • 將至少出現過 $1$ 次嘅整數由細到大排好係 $0, 1, 2, 3, 6, 9$,所以分 $6$ 行輸出佢哋。

範例 2

範例輸入 2

3
9 9 9

範例輸出 2

9
  • 至少出現過 $1$ 次嘅整數得 $9$ 一個,所以用 $1$ 行輸出佢。

範例 3

範例輸入 3

10
3 1 4 1 5 9 2 6 5 3

範例輸出 3

1
2
3
4
5
6
9
  • 將至少出現過 $1$ 次嘅整數由細到大排好係 $1, 2, 3, 4, 5, 6, 9$,所以分 $7$ 行輸出佢哋。

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.