Cod sursa(job #1570067)
Utilizator | Data | 16 ianuarie 2016 10:35:35 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
//stack <int> s;
int n, top, st[50];
void back(int k)
{ if (k==n+1)
{ //afisarea
if(top!=0)//multimea vida
{ for(int i=1;i<=top;i++)
g<<st[i]<<' ';
g<<'\n';
}
return;
}
//nu alegem elementul
back(k+1);
//alegem elementul
st[++top]=k;
back(k+1);
--top;
}
int main()
{ f>>n;
back(1);
return 0;
}