Cod sursa(job #546906)
Utilizator | Tudor Siminic tudors | Data | 5 martie 2011 17:19:48 |
---|---|---|---|
Problema | Multimi2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
long long n,cn,p1,p2,p;
long long A[1000001],q,i;
int main()
{
ifstream f("multimi2.in");
ofstream g("multimi2.out");
f>>n;
p=(n*(n+1))/2;
p1=p/2;
p2=p-p1;
cn=n;
g<<abs(p2-p1)<<"\n";
while (p1>=n)
{
A[++q]=n;
p1-=n;
n--;
}
if (p1!=0)
A[++q]=p1;
g<<q<<"\n";
for (i=1;i<=q;++i)
g<<A[i]<<" ";
g<<"\n";
g<<cn-q<<"\n";
for (i=1;i<p1;++i)
g<<i<<" ";
for (i=p1+1;i<=n;++i)
g<<i<<" ";
f.close();
g.close();
return 0;
}