Submission #1453392

---

Source Code Expand

#include<bits/stdc++.h>
#include<sstream>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(i=(ll)a;i<(ll)b;i++)
#define revrep(i,a,b) for(i=(ll)a;i>=(ll)b;i--)
#define strep(it,v) for(it=v.begin();it!=v.end();++it)
#define ii pair<pair<ll,ll>,pair<ll,ll> >
#define MP make_pair
#define pb push_back
#define f first
#define se second
#define ll long long int
#define vi vector<ll>
#define rs resize
int main()
{
   std::ios::sync_with_stdio(false);
   int n,i,sum = 0,avg,a1 = 0,a2 = 0;
   cin>>n;
   int a[n];
   rep(i,0,n) cin>>a[i],sum += a[i];
   avg = sum/n;
   rep(i,0,n)
   {
      a1 = a1 + pow(a[i] - avg,2);
      a2 = a2 + pow(a[i] - avg - 1,2);
   }
   cout<<min(a1,a2);
   return 0;
}

Submission Info

Judge Result