Pagini recente » Cod sursa (job #2590263) | Cod sursa (job #2865875) | Cod sursa (job #730246) | Cod sursa (job #1642970) | Cod sursa (job #2185728)
#include<fstream>
int n;
int sol[20],d[20];
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
d[i] = 1 << (n - i);
int lim = 1 << n;
for(int k = 1; k < lim; k++)
{
int x = 0, i;
int nr = 0;
for(int j = 1; j <= n && x < k; j++)
if(x < k - d[j])
x += d[j];
else
{
x++;
sol[++nr] = j;
}
for(int i = 1; i <= nr; i++)
out << sol[i] << " ";
out << "\n";
}
return 0;
}