Cod sursa(job #196408)
Utilizator | Data | 26 iunie 2008 12:52:07 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#define Nmax 18
long n,m,p[Nmax];
void back_comb(long k)
{ long i;
if (k==m+1)
{
for (i=1;i<=m;i++)
printf("%ld ",p[i]);
printf("\n");
}
else
for (i=p[k-1]+1;i<=n;i++);
{
p[k]=i;
back_comb(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld %ld",&n, &m);
back_comb(1);
return 0;
}