Cod sursa(job #3362878)
| Utilizator | Data | 12 august 2026 21:55:32 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
const int MAXN = 18;
int v[MAXN];
int nr, n;
FILE *fin, *fout;
void bkt(int poz) {
int i;
if (nr > 0 && v[nr - 1] == poz - 1) {
for (i = 0; i < nr; i++) {
fprintf(fout, "%d ", v[i]);
}
fprintf(fout, "\n");
}
if (poz <= n) {
v[nr] = poz;
nr++;
bkt(poz + 1);//daca il iau
nr--;
bkt(poz + 1);//daca nu il iau
}
}
int main()
{
fin = fopen("submultimi.in", "r");
fscanf(fin, "%d", &n);
fclose(fin);
fout = fopen("submultimi.out", "w");
bkt(1);
fclose(fout);
return 0;
}
