Pagini recente » Cod sursa (job #2948024) | Cod sursa (job #1842868) | eusebiu_oji_2012_cls9 | Cod sursa (job #2134890) | Cod sursa (job #713267)
Cod sursa(job #713267)
#include <iostream>
#include <stdio.h>
using namespace std;
int n,k,sol[20];
void back(int lg, int ls)
{
if(lg == k+1)
{
for(int i=1;i<=k;++i)
printf("%d ", sol[i]);
printf("\n");
return;
}
for(int c=ls;c<=n;c++)
{
sol[lg] = c;
back(lg+1, c+1);
}
}
int main()
{
freopen ("combinari.in","r",stdin);
freopen ("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
back(1,1);
return 0;
}