Language: C++

/*Function Template*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1e17;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a)  (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }

}
ll Len(ll n) {
  ll s=0;
  while(n!=0) s++, n/=10;
  return s;
}


ll Sint(ll n) {
  ll m=0,s=0,a=n;
  while(a!=0) s++, a/=10;
  for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
  return m;
}


ll Svec(vector<ll> v){
  ll n=0;
  for(ll i=0;i<v.size();i++) n+=v[i];
  return n;
}


ll GCD(ll a,ll b) {
  return b ? GCD(b,a%b) : a;
}


ll LCM(ll a,ll b){
  return a/GCD(a,b)*b;
}


ll Factorial(ll n){
  ll m=1;
  while(n>=1) m*=n,n--;
  return m;
}

void runlength(string s,vector<pair<char,ll>> &p){
  ll x=1;
  if(s.size()==1){
    p.push_back(pair<char,ll>(s[0],1));
  }
  for(ll i=0;i<s.size()-1;i++){
    if(s[i]==s[i+1]){
      x++;
      if(i==s.size()-2){
        p.push_back(pair<char,ll>(s[i],x));
      }
    }else{
      p.push_back(pair<char,ll>(s[i],x));
      x=1;
      if(i==s.size()-2){
        p.push_back(pair<char,ll>(s[s.size()-1],x));
      }
    }
  }
}




ll COM(ll n,ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
  vector<bool> isPrime(MAX_N+1,true);
  for(int i=2;i<=MAX_N;i++){
    if(isPrime[i]){
      for(int j=2*i;j<=MAX_N;j+=i){
        isPrime[j]=false;
      }
    }
  }
  return isPrime;
}



/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
  IOS;
  ll n;
  cin>>n;
  vector<ll> v(n);
  rep(i,n) cin>>v[i];
  ll ans=MOD,tmp=v[0],sum=Svec(v);
  rep(i,n-1){
    chmin(ans,abs(2*tmp-sum));
    
    tmp+=v[i+1];
    
  }
  chmin(ans,abs(2*tmp-sum));
  cout<<ans<<endl;
  
  
}
/*Function Template*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1e17;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a)  (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }

}
ll Len(ll n) {
  ll s=0;
  while(n!=0) s++, n/=10;
  return s;
}


ll Sint(ll n) {
  ll m=0,s=0,a=n;
  while(a!=0) s++, a/=10;
  for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
  return m;
}


ll Svec(vector<ll> v){
  ll n=0;
  for(ll i=0;i<v.size();i++) n+=v[i];
  return n;
}


ll GCD(ll a,ll b) {
  return b ? GCD(b,a%b) : a;
}


ll LCM(ll a,ll b){
  return a/GCD(a,b)*b;
}


ll Factorial(ll n){
  ll m=1;
  while(n>=1) m*=n,n--;
  return m;
}

void runlength(string s,vector<pair<char,ll>> &p){
  ll x=1;
  if(s.size()==1){
    p.push_back(pair<char,ll>(s[0],1));
  }
  for(ll i=0;i<s.size()-1;i++){
    if(s[i]==s[i+1]){
      x++;
      if(i==s.size()-2){
        p.push_back(pair<char,ll>(s[i],x));
      }
    }else{
      p.push_back(pair<char,ll>(s[i],x));
      x=1;
      if(i==s.size()-2){
        p.push_back(pair<char,ll>(s[s.size()-1],x));
      }
    }
  }
}




ll COM(ll n,ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
  vector<bool> isPrime(MAX_N+1,true);
  for(int i=2;i<=MAX_N;i++){
    if(isPrime[i]){
      for(int j=2*i;j<=MAX_N;j+=i){
        isPrime[j]=false;
      }
    }
  }
  return isPrime;
}



/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
  IOS;
  ll n;
  cin>>n;
  vector<ll> v(n);
  rep(i,n) cin>>v[i];
  ll ans=MOD,tmp=v[0],sum=Svec(v);
  rep(i,n-1){
    chmin(ans,abs(2*tmp-sum));
    
    tmp+=v[i+1];
    
  }
  chmin(ans,abs(2*tmp-sum));
  cout<<ans<<endl;
  
  
}


Compiler output:
a.cc:6:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+17' to '2147483647' [-Woverflow]
    6 | const int MOD = 1e17;
      |                 ^~~~
a.cc:146:11: error: redefinition of 'const int MAX'
  146 | const int MAX = 510000;
      |           ^~~
a.cc:5:11: note: 'const int MAX' previously defined here
    5 | const int MAX = 510000;
      |           ^~~
a.cc:147:11: error: redefinition of 'const int MOD'
  147 | const int MOD = 1e17;
      |           ^~~
a.cc:6:11: note: 'const int MOD' previously defined here
    6 | const int MOD = 1e17;
      |           ^~~
a.cc:152:4: error: redefinition of 'll fac [510000]'
  152 | ll fac[MAX], finv[MAX], inv[MAX];
      |    ^~~
a.cc:11:4: note: 'll fac [510000]' previously declared here
   11 | ll fac[MAX], finv[MAX], inv[MAX];
      |    ^~~
a.cc:152:14: error: redefinition of 'll finv [510000]'
  152 | ll fac[MAX], finv[MAX], inv[MAX];
      |              ^~~~
a.cc:11:14: note: 'll finv [510000]' previously declared here
   11 | ll fac[MAX], finv[MAX], inv[MAX];
      |              ^~~~
a.cc:152:25: error: redefinition of 'll inv [510000]'
  152 | ll fac[MAX], finv[MAX], inv[MAX];
      |                         ^~~
a.cc:11:25: note: 'll inv [510000]' previously declared here
   11 | ll fac[MAX], finv[MAX], inv[MAX];
      |                         ^~~
a.cc:155:31: error: redefinition of 'template<class T> bool chmin(T&, T)'
  155 | template<class T> inline bool chmin(T& a, T b) {
      |                               ^~~~~
a.cc:14:31: note: 'template<class T> bool chmin(T&, T)' previously declared here
   14 | template<class T> inline bool chmin(T& a, T b) {
      |                               ^~~~~
a.cc:162:31: error: redefinition of 'template<class T> bool chmax(T&, T)'
  162 | template<class T> inline bool chmax(T& a, T b) {
      |                               ^~~~~
a.cc:21:31: note: 'template<class T> bool chmax(T&, T)' previously declared here
   21 | template<class T> inline bool chmax(T& a, T b) {
      |                               ^~~~~
a.cc:170:6: error: redefinition of 'void COMinit()'
  170 | void COMinit() {
      |      ^~~~~~~
a.cc:29:6: note: 'void COMinit()' previously defined here
   29 | void COMinit() {
      |      ^~~~~~~
a.cc:181:4: error: redefinition of 'll Len(ll)'
  181 | ll Len(ll n) {
      |    ^~~
a.cc:40:4: note: 'll Len(ll)' previously defined here
   40 | ll Len(ll n) {
      |    ^~~
a.cc:188:4: error: redefinition of 'll Sint(ll)'
  188 | ll Sint(ll n) {
      |    ^~~~
a.cc:47:4: note: 'll Sint(ll)' previously defined here
   47 | ll Sint(ll n) {
      |    ^~~~
a.cc:196:4: error: redefinition of 'll Svec(std::vector<long long int>)'
  196 | ll Svec(vector<ll> v){
      |    ^~~~
a.cc:55:4: note: 'll Svec(std::vector<long long int>)' previously defined here
   55 | ll Svec(vector<ll> v){
      |    ^~~~
a.cc:203:4: error: redefinition of 'll GCD(ll, ll)'
  203 | ll GCD(ll a,ll b) {
      |    ^~~
a.cc:62:4: note: 'll GCD(ll, ll)' previously defined here
   62 | ll GCD(ll a,ll b) {
      |    ^~~
a.cc:208:4: error: redefinition of 'll LCM(ll, ll)'
  208 | ll LCM(ll a,ll b){
      |    ^~~
a.cc:67:4: note: 'll LCM(ll, ll)' previously defined here
   67 | ll LCM(ll a,ll b){
      |    ^~~
a.cc:213:4: error: redefinition of 'll Factorial(ll)'
  213 | ll Factorial(ll n){
      |    ^~~~~~~~~
a.cc:72:4: note: 'll Factorial(ll)' previously defined here
   72 | ll Factorial(ll n){
      |    ^~~~~~~~~
a.cc:219:6: error: redefinition of 'void runlength(std::string, std::vector<std::pair<char, long long int> >&)'
  219 | void runlength(string s,vector<pair<char,ll>> &p){
      |      ^~~~~~~~~
a.cc:78:6: note: 'void runlength(std::string, std::vector<std::pair<char, long long int> >&)' previously defined here
   78 | void runlength(string s,vector<pair<char,ll>> &p){
      |      ^~~~~~~~~
a.cc:243:4: error: redefinition of 'll COM(ll, ll)'
  243 | ll COM(ll n,ll k){
      |    ^~~
a.cc:102:4: note: 'll COM(ll, ll)' previously defined here
  102 | ll COM(ll n,ll k){
      |    ^~~
a.cc:249:11: error: redefinition of 'const int MAX_N'
  249 | const int MAX_N=100010;
      |           ^~~~~
a.cc:108:11: note: 'const int MAX_N' previously defined here
  108 | const int MAX_N=100010;
      |           ^~~~~
a.cc:250:14: error: redefinition of 'std::vector<bool> sieve_of_eratosthenes()'
  250 | vector<bool> sieve_of_eratosthenes(){
      |              ^~~~~~~~~~~~~~~~~~~~~
a.cc:109:14: note: 'std::vector<bool> sieve_of_eratosthenes()' previously defined here
  109 | vector<bool> sieve_of_eratosthenes(){
      |              ^~~~~~~~~~~~~~~~~~~~~
a.cc:265:5: error: redefinition of 'int main()'
  265 | int main() {
      |     ^~~~
a.cc:124:5: note: 'int main()' previously defined here
  124 | int main() {
      |     ^~~~