Pagini recente » Cod sursa (job #2487708) | Cod sursa (job #110564) | Cod sursa (job #1998804) | Cod sursa (job #1504645) | Cod sursa (job #998230)
Cod sursa(job #998230)
#include<cstdio>
using namespace std;
int i,n,st,dr;
int main()
{
//freopen("input","r",stdin);
//freopen("output","w",stdout);
freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
scanf("%d",&n);
if(n==1)
{
printf("1\n");
printf("1\n1\n0\n");
return 0;
}
if(n%2==0)
{
printf("%d\n",(n%4==2));
printf("%d\n",n/2);
st=0;
dr=n+1;
for(i=1;i<=n/2;i++)
{
if(i&1)
{
st+=2;
if(i==n/2&&n%4==2) printf("%d ",n/2);
else printf("%d ",st);
}
else
{
dr-=2;
printf("%d ",dr);
}
}
printf("\n");
printf("%d\n",n/2);
st=-1;
dr=n+2;
for(i=1;i<=n/2;i++)
{
if(i%2==0)
{
st+=2;
printf("%d ",st);
}
else
{
dr-=2;
printf("%d ",dr);
}
}
printf("\n");
}
printf("%d\n",(n%4==1));
if(n%4==3)
{
printf("%d\n",n/2+1);
printf("1 2 ");
st=2;
dr=n+2;
for(i=1;i<n/2;i++)
{
if(i&1)
{
st+=2;
printf("%d ",st);
}
else
{
dr-=2;
printf("%d ",dr);
}
}
printf("\n%d\n",n/2);
printf("3 ");
st=3;
dr=n+1;
for(i=1;i<n/2;i++)
{
if(i&1)
{
st+=2;
printf("%d ",st);
}
else
{
dr-=2;
printf("%d ",dr);
}
}
printf("\n");
}
return 0;
}