Solução: Problema do conjunto e seus elementos únicos (Bruno Barbosa)

From AdonaiMedrado.Pro.Br
Revision as of 16:21, 3 July 2009 by 200.17.147.2 (Talk) (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[...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
#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]);
}