Cod sursa(job #486006)
Utilizator | Data | 20 septembrie 2010 12:21:38 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
int n,sol[11],k;
void bkt(int p)
{
if (p==k+1)
{
for (int i=1;i<=k;i++)
printf("%d ", sol[i]);
printf("\n");
return;
}
for(int i=sol[p-1]+1;i<=n;i++)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}