Pagini recente » Cod sursa (job #1218475) | Cod sursa (job #2218199) | Cod sursa (job #2669060) | Cod sursa (job #1353499) | Cod sursa (job #3257279)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n, k, nr;
int d[20], sol[20];
void make()
{
for(int i=1; i<=n; ++i)
d[i]=1<<(n-i);
}
void solve()
{
int x=0;
nr=0;
for(int i=1; i<=n && x<k; ++i)
{
if(x<k-d[i])
x+=d[i];
else
{
x++;
sol[++nr]=i;
}
}
}
int main()
{
in>>n;
make();
int lim=1<<n;
for(k=1; k<lim; ++k)
{
solve();
for(int i=1; i<=nr; ++i)
out<<sol[i]<<" ";
out<<'\n';
}
return 0;
}