Subscribe Us

Responsive Advertisement

Advertisement

1206B Make Product Equal One codeforces solution in cpp

 1206B  Make Product Equal One codeforces solution in cpp

by ujjal roy




#include<bits/stdc++.h>

using namespace std;

main()

{

    long long int n,i,ans=0,a,nc=0;

    vector<long long int> positive,negative,zero;

    cin>>n;

    for(i=0;i<n;i++)

   {

       cin>>a;

       if(a==0) zero.push_back(a);

       else if(a>0) positive.push_back(a);

       else

       {

           negative.push_back(a);

           nc++;

       }

   }

   for(i=0;i<positive.size();i++) ans+=positive[i]-1;

   for(i=0;i<negative.size();i++) ans+=-1-negative[i];

   ans+=zero.size();

   if(zero.size()==0&&nc%2!=0) ans+=2;

   cout<<ans<<endl;



    return 0;

}


Post a Comment

0 Comments