Pagini recente » Cod sursa (job #359790) | Cod sursa (job #2298299) | Cod sursa (job #1712083) | Cod sursa (job #1535470) | Cod sursa (job #782372)
Cod sursa(job #782372)
#include <fstream>
using namespace std;
int n;
int main()
{
ifstream in("multimi2.in"); in>>n; in.close();
ofstream out("multimi2.out");
int val = n % 4, kMax = n / 4;
if(val == 0)
{
out<<"0\n"<<n / 2<<"\n";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 1<<" "<<i * kMax + 4<<" ";
out<<"\n"<<n / 2<<"\n";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 2<<" "<<i * kMax + 3<<" ";
}
else if(val == 1)
{
out<<"1\n"<<n / 2 + 1<<"\n"<<"1 ";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 2<<" "<<i * kMax + 5<<" ";
out<<"\n"<<n / 2<<"\n";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 3<<" "<<i * kMax + 4<<" ";
}
else if(val == 2)
{
out<<"1\n"<<n / 2<<"\n";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 1<<" "<<i * kMax + 4<<" ";
out<<n<<"\n"<<n / 2<<"\n";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 2<<" "<<i * kMax + 3<<" ";
out<<n - 1;
}
else
{
out<<"0\n"<<n / 2 + 1<<"\n1 2 ";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 4<<" "<<i * kMax + 7<<" ";
out<<"\n"<<n / 2<<"\n"<<"3 ";
for(int i = 0; i < kMax; i++)
out<<i * kMax + 5<<" "<<i * kMax + 6<<" ";
}
out.close();
return 0;
}