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