Cod sursa(job #779663)
Utilizator | Popescu Silviu crushack | Data | 18 august 2012 14:35:33 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#define NMax 20
const char IN[]="combinari.in",OUT[]="combinari.out";
int N,K;
int v[NMax];
void bkt(int x,int k){
if (k==0){
for (int i=1;i<=x;++i) if(v[i]) printf("%d ",i); printf("\n");
return;
}
if (x>=N+1) return;
v[x]=true;
bkt(x+1,k-1);
v[x]=false;
bkt(x+1,k);
}
int main()
{
freopen(IN,"r",stdin);
scanf("%d%d",&N,&K);
fclose(stdin);
freopen(OUT,"w",stdout);
bkt(1,K);
fclose(stdout);
return 0;
}