Cod sursa(job #154775)
Utilizator | Savin Tiberiu devilkind | Data | 11 martie 2008 14:14:23 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
long int a[20];
long int n,k;
void back(long int nivel, long int mx)
{
long int i;
if (nivel==k+1)
{
for (i=1;i<nivel;i++) printf("%ld ",a[i]);
printf("\n");
return;
}
for (i=mx+1;i<=n;i++)
{
a[nivel]=i;
back(nivel+1,i);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld %ld",&n,&k);
back(1,0);
return 0;
}