Pagini recente » Cod sursa (job #1312898) | Cod sursa (job #1452973) | Cod sursa (job #2800630) | Cod sursa (job #2454830) | Cod sursa (job #239824)
Cod sursa(job #239824)
#include<algorithm>
using namespace std;
int n;
void solve(){
int i;
scanf("%d",&n);
if(n%4==0){
printf("0\n%d\n",n/2);
for(i=1; i<=n; i+=2)
printf("%d ",i);
printf("\n%d\n",n/2);
for(i=2; i<=n; i+=2)
printf("%d ",i);}
else if(n%4==3){
printf("0\n%d\n2 ",n/2);
for(i=3; i<=n; i+=2)
if(i!=n/2)
printf("%d ",i);
printf("\n%d\n1 ",n/2+1);
for(i=4; i<=n; i+=2){
if(i==n/2+1)
printf("%d ",i-1);
printf("%d ",i);}}}
int main(){
freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
solve();
return 0;}