Pagini recente » Rating dimofte cosmin (cosmin395) | Cod sursa (job #426830) | Cod sursa (job #1374654) | Cod sursa (job #1334057) | Cod sursa (job #2314247)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("multimi2.in");
ofstream fout("multimi2.out");
vector<int>v1,v2;
int main()
{
int n,first,last,i;
fin>>n;
if(n&1)
{
v1.push_back(1);
v1.push_back(2);
v2.push_back(3);
first=4;
last=n;
n=n-3;
while(n>=4)
{
v1.push_back(first++);
v1.push_back(last--);
v2.push_back(first++);
v2.push_back(last--);
n=n-4;
}
if(n==2)
{
v1.push_back(first);
v2.push_back(last);
fout<<"1\n";
}
else
fout<<"0\n";
}
else
{
first=1;
last=n;
while(n>=4)
{
v1.push_back(first++);
v1.push_back(last--);
v2.push_back(first++);
v2.push_back(last--);
n=n-4;
}
if(n==2)
{
v1.push_back(first);
v2.push_back(last);
fout<<"1\n";
}
else
fout<<"0\n";
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
fout<<v1.size()<<"\n";
for(i=0;i<v1.size();++i)
fout<<v1[i]<<" ";
fout<<"\n"<<v2.size()<<"\n";
for(i=0;i<v2.size();++i)
fout<<v2[i]<<" ";
fout<<"\n";
return 0;
}