Pagini recente » Cod sursa (job #1458951) | Cod sursa (job #128169) | Cod sursa (job #1597603) | Cod sursa (job #1130592) | Cod sursa (job #1129311)
/*
Keep It Simple!
*/
#include<stdio.h>
int v[20],N,M;
int valid(int k)
{
for(int i=1;i<k;i++)
if(v[i] == v[k])
return 0;
return 1;
}
void Print(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(k == M)
Print(k);
else if( k<M )
Back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&M);
Back(1);
}