Pagini recente » Cod sursa (job #1930876) | Cod sursa (job #2297128) | Statistici Francis Hendrix (francishendrix1432) | Istoria paginii utilizator/angelina_panescu | Cod sursa (job #110180)
Cod sursa(job #110180)
#include <cstdio>
#define maxn 1000001
int a[maxn], b[maxn];
int n;
inline int sgn(int a)
{
if(a<0) return -a;
return a;
}
int main()
{
freopen("multimi2.in","r",stdin);
scanf("%d\n", &n);
int sol=0;
int r=n%4;
int p=n/4, i, na=0, nb=0;
int P=1, Q=n;
for(i=1, P=1, Q=n;i<=p;++i)
{
a[++na]=P++;
a[++na]=Q--;
b[++nb]=P++;
b[++nb]=Q--;
}
if(r==0) sol=0;
if(r==1){ a[++na]=(n/2)+1; sol=(n/2)+1;}
if(r==2)
{
a[++na]=n/2;
b[++nb]=n/2+1;
sol=1;
}
if(r==3)
{
a[++na]=n/2;
a[++na]=n/2+1;
b[++nb]=n/2+2;
sol=n/2+n/2+1-(n/2+2);
}
freopen("multimi2.out","w",stdout);
printf("%d\n", sol);
printf("%d\n", na);
for(i=1;i<=na;++i) printf("%d ", a[i]);
printf("\n");
printf("%d\n", nb);
for(i=1;i<=nb;++i) printf("%d ", b[i]);
printf("\n");
return 0;
}