Pagini recente » Cod sursa (job #1649197) | Cod sursa (job #2331883) | Cod sursa (job #2068392) | Cod sursa (job #1560643) | Cod sursa (job #713193)
Cod sursa(job #713193)
#include <iostream>
#include <cstdio>
using namespace std;
int n,k,sol[30],viz[30];
void afis(int p)
{
for (int i=0;i<p;i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int p)
{
if (p==k)
{
afis(p);
return;
}
for (int i=1;i<=n;i++)
if (p==0 || (p>0 && i>sol[p-1]))
{
sol[p]=i;
back(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0);
return 0;
}