Pagini recente » Cod sursa (job #1848751) | Istoria paginii runda/23dezile_2 | Istoria paginii runda/nimi/clasament | Autentificare | Cod sursa (job #2012943)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("multimi2.in");
ofstream fout("multimi2.out");
int n,i,ok,k1,k2;
int a[600000],b[600000];
int main()
{
fin >> n;
if (n%4 == 0 || n%4 == 3)
fout << 0 << "\n";
else
fout << 1 << "\n";
ok = 0;
for (i=n; i>=1; i-=2)
{
if (ok == 0)
{
a[++k1] = i;
if (i-1 != 0)
b[++k2] = i-1;
}
else
{
b[++k2] = i;
if (i-1 != 0)
a[++k1] = i-1;
}
ok = 1-ok;
}
sort(a+1, a+k1+1);
sort(b+1, b+k2+1);
fout << k1 << "\n";
for (i=1; i<=k1; i++)
fout << a[i] << " ";
fout << "\n";
fout << k2 << "\n";
for (i=1; i<=k2; i++)
fout << b[i] << " ";
return 0;
}