Cod sursa(job #3328966)
| Utilizator | Data | 11 decembrie 2025 13:28:06 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
const int nMax = 20;
int n;
int submul[nMax];
void bkt (int pos) {
if (pos <= n) {
for (int i = submul[pos - 1] + 1; i <= n; i += 1) {
submul[pos] = i;
for (int j = 1; j <= pos; j += 1)
fout << submul[j] << ' ';
fout << '\n';
bkt (pos + 1);
}
}
}
int main () {
fin >> n;
bkt (1);
return 0;
}