题库练习 Remove Duplicates
← 上一题 下一题 →

A11678 | Remove Duplicates

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Petya has an array $a$ consisting of $n$ integers. He wants to remove duplicate (equal) elements.

Petya wants to leave only the rightmost entry (occurrence) for each element of the array. The relative order of the remaining unique elements should not be changed.

输入格式

The first line contains a single integer $n$ ( $1 \le n \le 50$ ) — the number of elements in Petya's array.

The following line contains a sequence $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 1\,000$ ) — the Petya's array.

输出格式

In the first line print integer $x$ — the number of elements which will be left in Petya's array after he removed the duplicates.

In the second line print $x$ integers separated with a space — Petya's array after he removed the duplicates. For each unique element only the rightmost entry should be left.

输入输出样例

输入 #1
6
1 5 5 1 6 1
输出 #1
3
5 6 1 
输入 #2
5
2 4 2 4 4
输出 #2
2
2 4 
输入 #3
5
6 6 6 6 6
输出 #3
1
6 
C++ 编辑器
输入
输出