Cod sursa(job #304192)

Utilizator LuffyBanu Lavinia Luffy Data 11 aprilie 2009 11:53:29
Problema Multimi2 Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.91 kb
#include<fstream>
#define dim 500010
int a[dim],b[dim];
using namespace std;
int main()
{int i,m,n,ok,j,k;
long long s1,s2;

ifstream f("multimi2.in");
ofstream g("multimi2.out");
f>>n;
if(n%2==0)
{i=0; m=2; s1=0; ok=0;
 while(m<=n)
 {i++; a[i]=m; s1=s1+m;
  if(ok==0) {m=m+1;ok=1;}
  else {m=m+3;ok=0;}
 }

 j=0; m=1; ok=0; s2=0;
 while(m<=n)
 {j++; b[j]=m; s2=s2+m;
  if(ok==0) {m=m+3;ok=1;}
  else {m=m+1;ok=0;}
 }
}

if(n%2==1)
{i=0; m=3; s1=0; ok=0;
 while(m<=n)
 {i++; a[i]=m; s1=s1+m;
  if(ok==0) {m=m+1;ok=1;}
  else {m=m+3;ok=0;}
 }

 j=0; m=1; ok=0; s2=0;
 while(m<=n)
 {j++; b[j]=m; s2=s2+m;
  if(ok==0) {m=m+1;ok=1;}
  else {m=m+3;ok=0;}
 }
}	


 if(s1-s2<0) g<<-(s1-s2)<<'\n';
 else g<<s1-s2<<'\n';
 
 g<<i<<'\n';
 for(k=1;k<=i;k++)
  g<<a[k]<<" ";
  g<<'\n';
 
 g<<j<<'\n';
 for(k=1;k<=j;k++)
  g<<b[k]<<" ";
  g<<'\n';

f.close();
g.close();
return 0;
}