Cod sursa(job #352516)
| Utilizator | Data | 2 octombrie 2009 09:20:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#define N 101
int n,k,sol[N];
void afis()
{
for (int i=1;i<=k;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
if (p==k+1)
{
afis();
return;
}
for (int i=1+sol[p-1];i<=n-k+p;++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;
}
