Pagini recente » Cod sursa (job #2667776) | Cod sursa (job #1436109) | Cod sursa (job #1370850) | Cod sursa (job #2310782) | Cod sursa (job #163486)
Cod sursa(job #163486)
#include<fstream.h>
int main()
{long s1,s2,d,n,i;
fstream f("multimi2.in", ios::in), g("multimi2.out", ios::out);
f>>n;
if(n%4==0)
{g<<"0"<<endl<<n/2<<endl;
for(i=1;i<=n/2;i+=2)
g<<i<<" "<<n-i+1<<" ";
g<<endl<<n/2<<endl;
for(i=2;i<=n/2;i+=2)
g<<i<<" "<<n-i+1<<" ";
g<<endl;
}
else
if(n%4==1)
{g<<"1"<<endl<<n/2+1<<endl<<"1";
for(i=2;i<=n/2;i+=2)
g<<i<<" "<<n-i+1<<" ";
g<<endl<<n/2<<endl;
for(i=3;i<=n/2;i+=2)
g<<i<<" "<<n-i+1<<" ";
}
if(n%4==2)
{g<<"1"<<endl<<n/2<<endl;
for(i=1;i<=n/2-1;i+=2)
g<<i<<" "<<n-i+1<<" ";
g<<n/2<<endl<<n/2<<endl;;
for(i=2;i<=n/2+1;i+=2)
if(i==n/2+1)
g<<i<<endl;
else
g<<i<<" "<<n-i+1<<" ";
}
if(n%4==3)
{g<<"0"<<endl<<n/2+1<<endl;
for(i=1;i<=n/2-1;i+=2)
g<<i<<" "<<n-i<<" ";
g<<n/2<<" "<<n/2+1<<endl;
g<<n/2<<endl;
for(i=2;i<=n/2;i+=2)
if(i==2 && n==3)
g<<n-i+1<<" ";
else
g<<i<<" "<<n-i<<" ";
g<<n;
}
f.close();
g.close();
return 0;
}