Cod sursa(job #264533)
| Utilizator | Data | 22 februarie 2009 11:41:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int n,k,a[20];
void afisare()
{
for(int i=1;i<=k;++i)
printf("%d ",a[i]);
printf("\n");
}
void back(int x)
{
if (x==k+1)
{
afisare();
return;
}
for (int i=a[x-1]+1;i<=n+x-k;++i)
{
a[x]=i;
back(x+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}