Cod sursa(job #819329)
| Utilizator | Data | 18 noiembrie 2012 20:16:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<stdio.h>
int n,m,st[25];
void afis()
{
int i;
for(i=1;i<=m;i++)
printf("%d ",st[i]);
printf("\n");
}
void backt(int k)
{
if(k==m+1)
afis();
else
for(int i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
backt(k+1);
st[k]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
backt(1);
return 0;
}
