Cod sursa(job #788696)

Utilizator round2Test P round2 Data 15 septembrie 2012 16:51:05
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <cstdio>

int n,k,x[20];

void next_comb(int p)
{
    if(x[p]+1<=p+n-k)
    {
        x[p]++;
        return;
    }
        next_comb(p-1);
        x[p]=x[p-1]+1;
}

int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
        scanf("%d %d",&n,&k);

        for(int i=1;i<=k;i++)x[i]=i;

        do{
            for(int i=1;i<=k;i++)printf("%d ",x[i]);
            printf("\n");
            next_comb(k);
        }while(x[0]==0);
    return 0;
}