Pagini recente » Cod sursa (job #2966012) | Cod sursa (job #2505070) | Cod sursa (job #2937243) | Cod sursa (job #1396597) | Cod sursa (job #109374)
Cod sursa(job #109374)
#include<fstream.h>
ifstream f("multimi2.in");
ofstream g("multimi2.out");
int n,k;
int main()
{
f>>n;
if(n%2==0)
if(n%4==0)
{g<<0<<'\n'<<n/2<<'\n';
for(k=1;k<=n/2;k+=2)
g<<k<<' '<<n-k+1<<' ';
g<<'\n'<<n/2<<'\n';
for(k=2;k<=n/2;k+=2)
g<<k<<' '<<n-k+1<<' ';
}
else
{ g<<1<<'\n'<<n/2<<'\n';
for(k=1;k<n/2;k+=2)
g<<k<<' '<<n-k+1<<' ';
g<<n/2<<'\n'<<n/2<<'\n';
for(k=2;k<n/2;k+=2)
g<<k<<' '<<n-k+1<<' ';
g<<n/2+1;
}
else
if((n-1)%4==0)
{g<<1<<'\n'<<(n-1)/2+1<<'\n'<<1<<' ';
for(k=2;k<=(n+1)/2;k+=2)
g<<k<<' '<<n-k+2<<' ';
g<<'\n'<<(n-1)/2<<'\n';
for(k=3;k<=(n+1)/2;k+=2)
g<<k<<' '<<n-k+2<<' ';
}
else
if((n-1)%2==0)
{g<<0<<'\n'<<(n+1)/2<<'\n'<<1<<' ';
for(k=2;k<(n+1)/2;k+=2)
g<<k<<' '<<n-k+2<<' ';
g<<(n+1)/2<<'\n'<<(n-1)/2<<'\n';
for(k=3;k<(n+1)/2;k+=2)
g<<k<<' '<<n-k+2<<' ';
g<<(n+1)/2+1;
}
return 0;
}