Pagini recente » Cod sursa (job #2072341) | Cod sursa (job #3280764) | Cod sursa (job #2035845) | Borderou de evaluare (job #2116727) | Cod sursa (job #263438)
Cod sursa(job #263438)
#include<stdio.h>
int n,m,sol[20];
void afisare()
{
for(int i=1;i<=m;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if(k==m+1)
{
afisare();
return;
}
for(int i=sol[k-1]+1;i<=n;++i)
{
sol[k]=i;
back(k+1);
}
/*
for(int i=1;i<=n;++i)
if(marc[i]==0)
{
marc[i]=1;
sol[k]=i;
back(k+1);
marc[i]=0;
}
*/
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}