Cod sursa(job #263435)
Utilizator | Matei-Dan Epure motty | Data | 20 februarie 2009 13:03:07 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
int n,m,sol[20];
void afisare()
{
for(int i=1;i<=m;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if(k==m+1)
{
afisare();
return;
}
for( int i=sol[k-1]+1;i<=n;++i)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}