Cod sursa(job #2516268)
Utilizator | bety bety bety | Data | 30 decembrie 2019 20:57:43 |
---|---|---|---|
Problema | Submultimi | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n;
int pow2(int exp)
{
int p=1;
for(int i=1;i<=exp;++i)
p*=2;
return p;
}
int main()
{
ios_base::sync_with_stdio(false);
in.tie(0),out.tie(0);
in>>n;
for(int j=1;j<=pow2(n)-1;++j)
{
int kk=j;
for(int i=1;i<=n;++i)
{
if(kk%2==1)
out<<i<<" ";
kk/=2;
}
out<<endl;
}
return 0;
}