Pagini recente » Cod sursa (job #155353) | Cod sursa (job #2016611) | Cod sursa (job #1246146) | Cod sursa (job #850164) | Cod sursa (job #1035151)
/*
Keep It Simple!
*/
#include<stdio.h>
int n,q;
int v[20];
int valid(int k)
{
for(int i=1;i<k;i++)
if(v[i]==v[k])
return 0;
return 1;
}
void afis(int k)
{
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
void back(int k)
{
for(int i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
if(valid(k))
{
if(k == q)
afis(k);
else if(k<q)
back(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&q);
back(1);
}