Pagini recente » Borderou de evaluare (job #2007250) | Cod sursa (job #550608) | Cod sursa (job #710597) | Cod sursa (job #909173) | Cod sursa (job #1193242)
#include <cstdio>
using namespace std;
#define NMAX 25
int sol[NMAX];
int N,K;
void afis()
{
for (int i=2;i<=K+1;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if (k>K)
{
afis();
return ;
}
for (int i=sol[k]+1;i<=N;++i)
{
sol[k+1]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&K);
back(1);
return 0;
}