Pagini recente » Cod sursa (job #68952) | Cod sursa (job #2021960) | Cod sursa (job #1181315) | Cod sursa (job #2436438) | Cod sursa (job #2635233)
#include <stdio.h>
#define NMAX 18
using namespace std;
FILE* fin, * fout;
int n, k;
int sol[NMAX + 1], viz[NMAX + 1] = { 0 };
void afis() {
for (int i = 1;i <= k;++i)
fprintf(fout,"%i ", sol[i]);
fprintf(fout,"\n");
}
void combinari(int count = 1) {
if (count == k + 1) { afis();return; }
int x = (count > 1) ? sol[count - 1] + 1 : 1;
for (int i = x;i <= n;++i)
if (!viz[i]) {
sol[count] = i;
combinari(count + 1);
}
}
int main()
{
fin = fopen("combinari.in", "r");
fout = fopen("combinari.out", "w");
fscanf(fin, "%i %i", &n, &k);
combinari();
return 0;
}