Cod sursa(job #205681)
Utilizator | Data | 2 septembrie 2008 15:46:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int n,m,i,j,a[30];
void afisare()
{ for(int z=1;z<=m;z++)
printf("%d ",a[z]);
printf("\n");
}
void comb(int k)
{
if(k==m+1)
afisare();
else
for(int y=a[k-1]+1;y<=n-m+k;y++)
{ a[k]=y;
comb(k+1);
}
}
int main()
{freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
comb(1);
return 0;
}