Cod sursa(job #2111407)
Utilizator | Data | 21 ianuarie 2018 23:25:41 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
short n;
int main()
{
f>>n;
unsigned long long x=pow(2,n);
for(unsigned long long i=1;i<=x;i++)
{
unsigned long long ii=i;
short j=n;
while(ii!=0 && j!=0)
{
if(ii & 1) g<<j<<" ";
ii=ii>>1;
j--;
}
g<<'\n';
}
return 0;
}