Pagini recente » Borderou de evaluare (job #2626383) | Borderou de evaluare (job #1584605) | Borderou de evaluare (job #1549182) | Cod sursa (job #407801) | Cod sursa (job #3344501)
#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