Difference between revisions of "Solução: Problema do conjunto e seus elementos únicos (Bruno Barbosa)"
From AdonaiMedrado.Pro.Br
(New page: <code lang = "c"> #include <stdio.h> #include <stdlib.h> int comparar(const void *a, const void *b) { return *(int *)a-*(int *)b; } int main(){ int i, n; scanf("%d", &n); int k[...) |
|||
Line 19: | Line 19: | ||
scanf("%d", k+i); | scanf("%d", k+i); | ||
− | + | printf("\n"); | |
qsort(k, n, sizeof(int), comparar); | qsort(k, n, sizeof(int), comparar); |
Revision as of 16:22, 3 July 2009
#include <stdio.h> #include <stdlib.h> int comparar(const void *a, const void *b) { return *(int *)a-*(int *)b; } int main(){ int i, n; scanf("%d", &n); int k[n]; for(i=0;i<n;i++) scanf("%d", k+i); printf("\n"); qsort(k, n, sizeof(int), comparar); printf("%d\n", *k); for(i=1;i<n;i++) if(*(k+i)!=*(k+i-1)) printf("%d\n", *(k+i)); while(!key[KEY_ESC]); }