Cod sursa(job #1570071)
Utilizator | Data | 16 ianuarie 2016 10:37:26 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <stack>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
const int maxn=20;
int top,st[maxn],n;
void back(int k)
{
if(k==n+1)
{
if(top!=0)
{
for(int i=1;i<=top;++i)
g<<st[i]<<' ';
g<<'\n';
}
return;
}
back(k+1);
st[++top]=k;
back(k+1);
--top;
}
int main()
{
f>>n;
back(1);
return 0;
}