Pagini recente » Cod sursa (job #524342) | Cod sursa (job #2185998) | Cod sursa (job #2650097) | Cod sursa (job #2377608) | Cod sursa (job #2128798)
/*#include <iostream>
#include <fstream>
using namespace std;
int n, i, j, k = 1;
int v[18];
bool gata = 0;
int main()
{
ifstream f("submultimi.in");
ofstream g("submultimi.out");
f >> n;
v[1] = 1;
g << 1 << '\n';
while(!gata)
{
gata=1;
k=1;
for(i=1;i<=n;i++)
{
if(v[i] == 1 && k == 1)
v[i] = 0;
else
{
v[i]+=k;
k = 0;
}
if(v[i] == 1)
g << i << ' ';
else
gata = 0;
}
g << '\n';
}
return 0;
}*/
#include <fstream>
using namespace std;
int n,i,t,k;
bool v[20];
int main()
{
ifstream f("submultimi.in");
ofstream g("submultimi.out");
f>>n;
v[1]=1;
g<<1<<'\n';
while(k==0)
{
k=1;t=1;
for(i=1;i<=n;i=i+1)
{
if(v[i]==1&&t==1)
v[i]=0;
else
{
v[i]+=t;
t=0;
}
if(v[i]==1)
g<<i<<' ';
else
k=0;
}
g<<'\n';
}
return 0;
}