Pagini recente » Cod sursa (job #252663) | Cod sursa (job #2608127) | Cod sursa (job #2161235) | Cod sursa (job #1797694) | Cod sursa (job #110388)
Cod sursa(job #110388)
#include <stdio.h>
int m1[500010], m2[500010], n, n1, n2, x, d;
int main()
{
freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
scanf("%d",&n);
int i;
x = n % 4;
switch (x)
{
case 0:
{
for (i=1; i<n/2; i+=2)
{
m1[i] = i; m1[i + 1] = n - i + 1;
m2[i] = i + 1; m2[i + 1] = n - i;
}
d = 0;
n1 = n2 = n/2;
break;
}
case 1:
{
for (i=1; i<n/2; i+=2)
{
m1[i] = i + 1; m1[i + 1] = n - i + 1;
m2[i] = i + 2; m2[i + 1] = n - i ;
}
d = 1;
n1 = n2 = n/2;
m1[++n1] = 1;
break;
}
case 2:
{
for (i=1; i<n/2; i+=2)
{
m1[i] = i + 2; m1[i + 1] = n - i + 1;
m2[i] = i + 3; m2[i + 1] = n - i ;
}
d = 1;
n1 = n2 = n/2 - 1;
m1[++n1] = 1;
m2[++n2] = 2;
break;
}
case 3:
{
for (i=1; i<n/2; i+=2)
{
m1[i] = i + 3; m1[i + 1] = n - i + 1;
m2[i] = i + 4; m2[i + 1] = n - i ;
}
d = 0;
n1 = n2 = n/2 - 1;
m1[++n1] = 1;
m1[++n1] = 2;
m2[++n2] = 3;
break;
}
}
printf("%d\n",d);
printf("%d\n",n1);
for (i = 1; i <= n1; i++) printf("%d ",m1[i]);
printf("\n%d\n",n2);
for (i = 1; i <= n2; i++) printf("%d ",m2[i]);
printf("\n");
return 0;
}