Pagini recente » Cod sursa (job #2596709) | Cod sursa (job #930001) | Cod sursa (job #779135) | Cod sursa (job #3234754) | Cod sursa (job #947691)
Cod sursa(job #947691)
#include<stdio.h>
int n,k,v[20];
int valid(int a)
{
for(int o=1;o<a;o++)
if(v[o]>=v[a])
return 0;
return 1;
}
void afis()
{
for(int j=1;j<=k;j++)
printf("%d ",v[j]);
printf("\n");
}
void bk(int x)
{
for(int i=1;i<=n;i++)
{
v[x]=i;
if(valid(x))
if(x<k)
bk(x+1);
else
if(x==k)
afis();
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bk(1);
return 0;
}