Cod sursa(job #196411)
Utilizator | Diaconeasa Andrei AndreiD | Data | 26 iunie 2008 12:59:16 |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
#define Nmax 21
int n,m,p[Nmax],i,j;
void back_comb(int k)
{
if(k==m+1)
{for(j=1;j<=m;j++)
printf("%d ",p[j]);
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("%d %d",&n,&m);
back_comb(1);
return 0;
}