Pagini recente » Cod sursa (job #2725061) | Cod sursa (job #905151) | Cod sursa (job #1663038) | Cod sursa (job #480242) | Cod sursa (job #150811)
Cod sursa(job #150811)
#include<fstream.h>
long n,i=1,m;
int main()
{
ifstream f("multimi2.in");
ofstream g("multimi2.out");
f>>n;
if(n%4==0)
{g<<"0"<<'\n'<<n/2<<'\n';
m=n;
while(i<m)
{g<<i<<" "<<m<<" ";
i+=2;m-=2;
}
g<<'\n'<<n/2<<'\n';
i=2;n--;
while(i<n)
{g<<i<<" "<<n<<" ";
i+=2;n-=2;
}
}
else if(n%4==1)
{ g<<"1"<<'\n'<<n/2+1<<'\n'<<"1"<<" "<<"2"<<" ";
m=n;i=4;
while((i+1)!=m)
{g<<i<<" "<<m<<" ";
i+=2;m-=2;
}
g<<i;
g<<'\n'<<n/2<<'\n'<<"3"<<" ";
i=5;n--;
while(i<n)
{g<<i<<" "<<n<<" ";
i+=2;n-=2;
}
g<<n;
}
else if(n%4==2)
{ g<<"1"<<'\n'<<n/2<<'\n';
m=n;
while((i+1)!=m)
{g<<i<<" "<<m<<" ";
i+=2;m-=2;
}
g<<i;
g<<'\n'<<n/2<<'\n';
i=2;n--;
while(i<n)
{g<<i<<" "<<n<<" ";
i+=2;n-=2;
}
g<<n;
}
else
{ g<<"0"<<'\n'<<n/2+1<<'\n'<<"1"<<" "<<"2"<<" ";
m=n;i=4;
while(i<m)
{g<<i<<" "<<m<<" ";
i+=2;m-=2;
}
g<<'\n'<<n/2<<'\n'<<"3"<<" ";
i=5;n--;
while(i<n)
{g<<i<<" "<<n<<" ";
i+=2;n-=2;
}
}
f.close();
g.close();
return 0;
}