Pagini recente » Cod sursa (job #1900858) | Cod sursa (job #619061) | Cod sursa (job #1979550) | Cod sursa (job #105375) | Cod sursa (job #1570063)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
const int maxn = 20;
int top , st[maxn];
int n;
void back(int k){
if(k == n + 1){
if(top != 0)
for(int i = 1 ; i <= top ; i++) fout << st[i] << " ";
fout << '\n';
return;
}
back(k + 1);
st[++top] = k;
back(k + 1);
--top;
}
int main()
{
fin >> n;
back(1);
return 0;
}