Cod sursa(job #1976540)
| Utilizator | Data | 3 mai 2017 17:24:40 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int n,i,ii,u,a,m;
int main()
{
ifstream f ("submultimi.in");
ofstream g ("submultimi.out");
f>>n;
u=pow(2,n)-1;
for(i=u;i>=1;i--){
a=i;
m=(1<<(n-1));
for(ii=1;ii<=n;ii++){
if((a&m)==m)g<<ii<<" ";
//cout<<((a&m)==m)<<" ";
a=(a<<1);
}
//cout<<'\n';
g<<'\n';
}
f.close ();
g.close ();
return 0;
}
