Pagini recente » Cod sursa (job #804151) | Istoria paginii utilizator/kemkriszt | Istoria paginii utilizator/mihaipescaru | Cod sursa (job #2980179) | Cod sursa (job #1184773)
#include <stdio.h>
FILE *input;
FILE *output;
int n, k;
int stiva[20];
void afisare()
{
int i;
for (i = 1; i <= k; i++)
fprintf(output, "%d ", stiva[i]);
fprintf(output, "\n");
}
void backtrack(int p)
{
int i;
if (p > k) afisare();
else
for (i = stiva[p-1] + 1; i <= n; i++)
{
stiva[p] = i;
backtrack(p+1);
}
}
int main()
{
input = fopen("combinari.in", "r");
output = fopen("combinari.out", "w");
fscanf(input, "%d%d", &n, &k);
backtrack(1);
return 0;
}