Pagini recente » Cod sursa (job #3184838) | Cod sursa (job #1770956) | Cod sursa (job #2378421) | Cod sursa (job #2502761) | Cod sursa (job #1167432)
#include<cstdio>
using namespace std;
const int NMAX = 18+5;
void Read(),Back(int),Print();
int N,K;
int St[NMAX];
int main()
{
Read();
Back(1);
return 0;
}
void Read()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&K);
}
void Back(int top)
{
int i;
for(i = St[top-1]+1; i <= N; i++)
{
St[top] = i;
if(top < K) Back(top+1);
else Print();
}
}
void Print()
{
int i;
for(i = 1; i <= K; i++)
printf("%d ",St[i]);
printf("\n");
}