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