Pagini recente » Cod sursa (job #2971185) | Cod sursa (job #24980) | Cod sursa (job #2964462) | Cod sursa (job #3859) | Cod sursa (job #1491825)
#include<stdio.h>
using namespace std;
int x[20], uz[20], n, k;
void afis()
{
int i;
for(i = 1; i <= k; i++)
printf("%d ",x[i]);
printf("\n");
}
void backt(int p)
{
int i;
if(p > k)
afis();
else
for(i = x[p - 1] + 1; i <= n; i++)
{
x[p] = i;
backt(p + 1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
backt(1);
fclose(stdin);
fclose(stdout);
return 0;
}