Cod sursa(job #227233)
Utilizator | Puni Andrei Paul crawler | Data | 3 decembrie 2008 22:59:26 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int n,k,v[128],x[16],N,K;
void back()
{
++k;
if (k>K)
{
for(char j=1;j<k;++j)
printf("%d ", x[j]);
printf("\n");
} else
for(x[k]=x[k-1]+1;x[k]<=N;++x[k]) back();
--k;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &N,&K);
back();
return 0;
}