import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()){
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if(a[i] == a[j]){
a[i] = -1;
}
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if(a[i] != -1) {
cnt++;
}
}
System.out.println(cnt);
for (int i = 0; i < n; i++) {
if(a[i] != -1) {
if(i != n-1)
System.out.print(a[i]+" ");
else System.out.println(a[i]);
}
}
}
}
}
CodeForces-978A
最新推荐文章于 2024-06-20 19:01:05 发布