NYOJ255 C小加 之 随机数

原题链接

简单题。

附ac代码：

#include <stdio.h>#include <stdlib.h>int cmp(const void *a, const void *b){return *(int *)a - *(int *)b;}int main(){int t, n, i, *a, flag;scanf("%d", &t);while(t-- && scanf("%d", &n)){a = (int *)malloc(sizeof(int) * n);for(i = 0; i != n; ++i)scanf("%d", &a[i]);qsort(a, n, sizeof(int), cmp);flag = 1;for(i = 1, flag = 1; i != n; ++i){if(a[i] == a[i - 1]) continue;++flag;}printf("%d\n%d", flag, a[0]);for(i = 1; i != n; ++i){if(a[i] == a[i - 1]) continue;printf(" %d", a[i]);}printf("\n");free(a);}return 0;}