Pagini recente » Cod sursa (job #2675468) | Cod sursa (job #2768963) | Cod sursa (job #3267207) | Cod sursa (job #2150146) | Cod sursa (job #1746411)
#include <cstdio>
#include <algorithm>
#include <ctime>
using namespace std;
int v[20],n,k;
void back(int poz)
{
if(poz==k+1)
{
for(int i=1;i<=k;i++) printf("%d ",v[i]);
printf("\n");
}
else
{
for(int i=v[poz-1]+1;i<=n;i++)
{
v[poz]=i;
back(poz+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}