Pagini recente » Cod sursa (job #1629156) | Cod sursa (job #698816) | Cod sursa (job #2116142) | Cod sursa (job #1459673) | Cod sursa (job #1070240)
#include <fstream>
using namespace std;
ifstream f("multimi2.in");
ofstream g("multimi2.out");
long long n,i;
int main()
{
f>>n;
if (n%4==1 || n%4==2)
g<<"1\n";
else
g<<"0\n";
if (n%4==1)
{
g<<n/2+1<<'\n'<<"1 ";
for (i=2;i<=n;i++)
{
if (i<=n/2+1 && i%2==0)
g<<i<<" ";
if (i>n/2+1 && i%2)
g<<i<<" ";
}
g<<'\n'<<n/2<<'\n';
for (i=2;i<=n;i++)
{
if (i<=n/2+1 && i%2)
g<<i<<" ";
if (i>n/2+1 && i%2==0)
g<<i<<" ";
}
}
if (n%4==2)
{
g<<n/2<<'\n'<<"1 ";
for (i=2;i<=n;i++)
{
if (i<=n/2 && i%2)
g<<i<<" ";
if (i>n/2+1 && i%2==0)
g<<i<<" ";
}
g<<'\n'<<n/2<<'\n';
for (i=2;i<=n;i++)
{
if (i<=n/2+1 && i%2==0)
g<<i<<" ";
if (i>n/2 && i%2)
g<<i<<" ";
}
}
if (n%4==3)
{
g<<n/2+1<<'\n'<<"1 2 ";
for (i=4;i<=n;i++)
{
if (i<=n/2+1 && i%2==0)
g<<i<<" ";
if (i>n/2+2 && i%2)
g<<i<<" ";
}
g<<'\n'<<n/2<<"\n3 ";
for (i=4;i<=n;i++)
{
if (i<=n/2+2 && i%2)
g<<i<<" ";
if (i>n/2+1 && i%2==0)
g<<i<<" ";
}
}
if (n%4==0)
{
g<<n/2<<'\n';
for (i=1;i<=n;i++)
{
if (i<=n/2 && i%2)
g<<i<<" ";
if (i>n/2 && i%2==0)
g<<i<<" ";
}
g<<'\n'<<n/2<<'\n';
for (i=1;i<=n;i++)
{
if (i<=n/2 && i%2==0)
g<<i<<" ";
if (i>n/2 && i%2)
g<<i<<" ";
}
}
f.close();
g.close();
}