#include <stdio.h>
#include <string.h>
int find_same_num(int *num_arr, int num, int arr_len)
{
int i;
for (i = 0; i < arr_len; i++) {
if (num_arr[i] == num)
return 1;
}
return 0;
}
int main(void)
{
int sample_arr[1024] = {0};
int demo_num = 0, count = 0;
int i, j, tmp, value;
while(scanf("%d", &demo_num) != EOF)
{
count = 0;
memset(sample_arr, 0, sizeof(sample_arr));
while (demo_num--) {
scanf("%d", &value);
if (!find_same_num(sample_arr, value, count)) {
sample_arr[count] = value;
count++;
}
}
for (i = 0; i < count - 1; i++) {
for (j = 0; j < count - i - 1; j++) {
if (sample_arr[j] > sample_arr[j+1]) {
sample_arr[j+1] = sample_arr[j] ^ sample_arr[j+1]; // 1ms 356KB
sample_arr[j] = sample_arr[j] ^ sample_arr[j+1];
sample_arr[j+1] = sample_arr[j] ^ sample_arr[j+1];
//tmp = sample_arr[j+1]; // 2ms 376KB
//sample_arr[j+1] = sample_arr[j];
//sample_arr[j] = tmp;
}
}
}
for (i = 0; i < count; i++)
printf("%d\n", sample_arr[i]);
}
return 0;
}
#include <string.h>
int find_same_num(int *num_arr, int num, int arr_len)
{
int i;
for (i = 0; i < arr_len; i++) {
if (num_arr[i] == num)
return 1;
}
return 0;
}
int main(void)
{
int sample_arr[1024] = {0};
int demo_num = 0, count = 0;
int i, j, tmp, value;
while(scanf("%d", &demo_num) != EOF)
{
count = 0;
memset(sample_arr, 0, sizeof(sample_arr));
while (demo_num--) {
scanf("%d", &value);
if (!find_same_num(sample_arr, value, count)) {
sample_arr[count] = value;
count++;
}
}
for (i = 0; i < count - 1; i++) {
for (j = 0; j < count - i - 1; j++) {
if (sample_arr[j] > sample_arr[j+1]) {
sample_arr[j+1] = sample_arr[j] ^ sample_arr[j+1]; // 1ms 356KB
sample_arr[j] = sample_arr[j] ^ sample_arr[j+1];
sample_arr[j+1] = sample_arr[j] ^ sample_arr[j+1];
//tmp = sample_arr[j+1]; // 2ms 376KB
//sample_arr[j+1] = sample_arr[j];
//sample_arr[j] = tmp;
}
}
}
for (i = 0; i < count; i++)
printf("%d\n", sample_arr[i]);
}
return 0;
}