Cod sursa(job #404559)
| Utilizator | Data | 26 februarie 2010 12:22:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<cstdio>
const int N=100;
int sol[N],n,k;
void afisare()
{
for (int i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
if (p==k+1)
{
afisare();
return ;
}
for (int i=1+sol[p-1];i<=n;++i)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bkt(1);
return 0;
}
