ZOJ 2481 Unique Ascending Array

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)         
	{
		return *(int *)a-*(int *)b;
	}
int main()
{

	int a[101],n,i,x,k,flag,count;
	while(scanf("%d",&n)!=EOF&&n)
	{
		count=0;
		   for(i=0; i<n; i++)  
        {  
            flag = 0;  
            scanf("%d",&x);  
            for(k=0; k<=count; k++)  
                if( a[k] == x )  
                {  
                    flag = 1;  
                    break;  
                }  
            if( !flag ) a[count++] = x;  
        }  

		qsort(a,n,sizeof(int),cmp);   /*快排，qsort函数在库stdlib中*/
       
        printf("%d",a[0]);
        for(i=1;i<count;i++)           /*输出*/
		{
		
				printf(" %d",a[i]);
		
		}
		printf("\n");
	}

	return 0;
}