ZOJ-2481

#include<stdio.h>
#include<stdlib.h>

int cmpint(const void *i1, const void *i2)
{
return *(int *) i1 - *(int *) i2;
}

int main()
{
int n, *array;
while (scanf("%d", &n), n)
{
array = (int *) malloc(n * sizeof(int));
int i = 0, total = n;
while (n--)
scanf("%d", array + i++);
qsort(array, total, sizeof(int), cmpint);

int prev = *array;
printf("%d", *array);
for (i = 1; i < total; i++)
if (*(array + i) != prev)
{
printf(" %d", *(array + i));
prev = *(array + i);
}
printf("\n");
free(array);
}
return 0;
}