Pagini recente » Cod sursa (job #310434) | Cod sursa (job #2973689) | Cod sursa (job #1711383) | Cod sursa (job #2599951) | Cod sursa (job #291711)
Cod sursa(job #291711)
#define endl '\n'
#include <fstream.h>
int main()
{
ifstream f("multimi2.in");
ofstream g("multimi2.out");
long n,i;
f>>n;
if((n%4==1)||(n%4==2))
g<<1;
else
g<<0;
if(n%4==0)
{
g<<0<<endl;
g<<n/2<<endl;
for(i=1;i<=n/2;i+=2)
g<<i<<' ';
for(i=(n/2)+2;i<=n;i+=2)
g<<i<<' ';
g<<endl<<n/2<<endl;
for(i=2;i<=n/2;i+=2)
g<<i<<' ';
for(i=(n/2)+1;i<=n;i+=2)
g<<i<<' ';
}
if(n%4==1)
{
g<<1<<endl;
g<<(n+1)/2<<endl;
g<<1;
for(i=2;i<=(n+1)/2;i+=2)
g<<i<<' ';
for(i=(n+1)/2+2;i<=n;i+=2)
g<<i<<' ';
g<<endl<<(n-1)/2<<endl;
for(i=3;i<=(n+1)/2;i+=2)
g<<i<<' ';
for(i=(n+1)/2+1;i<=n;i+=2)
g<<i<<' ';
}
if(n%4==2)
{
g<<1<<endl;
g<<n/2<<endl;
g<<1;
for(i=3;i<=n/2+1;i+=2)
g<<i<<' ';
for(i=n/2+3;i<=n;i+=2)
g<<i<<' ';
g<<endl<<n/2<<endl;
for(i=4;i<=n/2+1;i+=2)
g<<i<<' ';
for(i=n/2+2;i<=n;i+=2)
g<<i<<' ';
}
if(n%4==3)
{
g<<0<<endl;
g<<(n+1)/2<<endl;
g<<1<<' '<<2<<endl;
for(i=4;i<=(n+1)/2+1;i+=2)
g<<i<<' ';
for(i=(n+1)/2+3;i<=n;i+=2)
g<<i<<' ';
g<<endl<<(n-1)/2<<endl;
for(i=3;i<=(n+1)/2+1;i+=2)
g<<i<<' ';
for(i=(n+1)/2+2;i<=n;i+=2)
g<<i<<' ';
}
return 0;
}