Pagini recente » Cod sursa (job #1346726) | Cod sursa (job #2706537) | Cod sursa (job #1858594) | Cod sursa (job #26469) | Cod sursa (job #2019578)
#include <fstream>
#include <bitset>
using namespace std;
int n;
bitset <17> st;
ofstream g("submultimi.out");
inline void Read()
{
ifstream f("submultimi.in");
f >> n;
f.close();
}
void Solution()
{
bool ok = false;
for (int i = 1;i <= n;++i)
if(st[i] == true)
ok = true;
if (ok)
{
for (int i = 1;i <= n;++i)
if(st[i] == true)
g << i << " ";
g << "\n";
}
}
inline void Back(int k)
{
if(k > n)
{
Solution();
return;
}
st[k] = false;
Back(k + 1);
st[k] = true;
Back(k + 1);
}
int main()
{
Read();
Back(1);
g.close();
return 0;
}