Cod sursa(job #780768)
| Utilizator | Data | 21 august 2012 12:27:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 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;
}
