Cod sursa(job #3344501)
| Utilizator | Data | 2 martie 2026 10:33:50 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int st[20],n;
void afis(int top) {
for (int i=1; i<=top; i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void back(int top) {
for (int i=st[top-1]+1; i<=n; i++) {
st[top]=i;
afis(top);
back(top+1);
}
}
int main() {
fin>>n;
back(1);
return 0;
}
// 2 0 3 -1 7 -4
