包牌問題2(樂透)c074

#include<stdio.h>
#include<stdlib.h>
#define m 6
int n;
int number[15],record[15];
int cmp(const void *a,const void *b)
{
    int x=*(int *)a;
    int y=*(int *)b;
    return(x<y?-1:x>y?1:0);
}
void search(int take_point,int star)
{
    int j,i;
    if(take_point==m)
    {
        for(i=0;i<m;i++) printf("%d ",number[record[i]]);
        printf("\n");
    }
    else
    {
        for(j=star;j<n;j++)
        {
            record[take_point]=j;
            search(take_point+1,j+1);
        }
    }
}
int main(i)
{
    while(scanf("%d",&n)!=EOF&&n!=0)
    {
        for(i=0;i<n;i++) scanf("%d",&number[i]);
        qsort(number,n,4,cmp);
        search(0,0);
    }
    return 0;
}