Pagini recente » Cod sursa (job #3268601) | Cod sursa (job #1078442) | Cod sursa (job #188369) | Cod sursa (job #2358759) | Cod sursa (job #799019)
Cod sursa(job #799019)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> k;
vector<vector<int> > v;
int main()
{
int n;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
cin>>n;
for(int i=1;i<=(1<<n);i++)
{
for(int j=1;j<=n;j++)
if(( i>>(j-1)& 1 )== 1)
{
k.push_back(j);
}
v.push_back(k);
k.clear();
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
{
for(int j=0;j<v[i].size();j++)
g<<v[i][j]<<" ";
g<<"\n";
}
return 0;
}