Pagini recente » Cod sursa (job #223460) | Cod sursa (job #478364) | Cod sursa (job #2043944) | Cod sursa (job #365592) | Cod sursa (job #261350)
Cod sursa(job #261350)
#include<stdio.h>
int sol[16];
int n,m;
int v[16];
void afisare()
{
for(int i=1;i<=m;++i)
printf("%d ",sol[i]);
printf("\n");
}
/*
bool verif(int x)
{
int i;
for(i=1;i<x;++i)
if(sol[x]==sol[i])
return 0;
return 1;
}
*/
int back(int k)
{
int i;
if(k==m+1)
{
afisare();
return 0;
}
for(i=sol[k-1]+1;i<=n;++i)
{
sol[k]=i;
if(!v[i])
{
v[i]=1;
back(k+1);
v[i]=0;
}
}
return 0;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}