Cod sursa(job #2874600)
Utilizator | Melvin Abibula MerlinTheWizard | Data | 19 martie 2022 18:38:35 |
---|---|---|---|
Problema | Multimi2 | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.65 kb |
#include<iostream>
#include<fstream>
#include<vector>
#include<math.h>
using namespace std;
ifstream f("multimi2.in");
ofstream g("multimi2.out");
int n;
vector<int> prima;
vector<int> doi;
int main()
{
f>>n;
int st=2;
int dr=n-1;
long long suma=1;
long long suma1=n;
prima.push_back(1);
doi.push_back(n);
if(n==3)
{
g<<"0"<<"\n";
g<<"2"<<"\n";
g<<"1 2"<<"\n";
g<<"1"<<"\n";
g<<"3";
}
else
{
while(st<=dr)
{
if(st==dr)
{
if(suma>=suma1)
{
prima.push_back(st);
suma=suma+st;
}
else
{
doi.push_back(st);
suma1=suma1+st;
}
}
else
{
if(suma>=suma1)
{
prima.push_back(st);
doi.push_back(dr);
suma=suma+st;
suma1=suma1+dr;
}
else
{
prima.push_back(dr);
doi.push_back(st);
suma=suma+dr;
suma1=suma1+st;
}
}
st++;
dr--;
}
g<<abs(suma-suma1)<<"\n";
g<<prima.size()<<"\n";
for(int i=0;i<prima.size();i++)
g<<prima[i]<<" ";
g<<"\n";
g<<doi.size()<<"\n";
for(int i=0;i<doi.size();i++)
g<<doi[i]<<" ";
}
}