func_code_string: #include <bits/stdc++.h>   using namespace std;   template <class T>   inline T euclide(T a, T b, T& x, T& y) {     if (a < 0) {       T d = euclide(-a, b, x, y);       x = -x;       return d;     }     if (b < 0) {       T d = euclide(a, -b, x, y);       y = -y;       return d;     }     if (b == 0) {       x = 1;       y = 0;       return a;     } else {       T d = euclide(b, a % b, x, y);       T t = x;       x = y;       y = t - (a / b) * y;       return d;     }   }   template <class T>   inline void checkmin(T& a, T b) {     if (b < a) a = b;   }   template <class T>   inline void checkmax(T& a, T b) {     if (b > a) a = b;   }   template <class T>   T Abs(T x) {     return x > 0 ? x : -x;   }   template <class T>   inline T sqr(T x) {     return x * x;   }   template <class T>   inline bool isPrime(T n) {     if (n <= 1) return false;     for (T i = 2; i * i <= n; i++)       if (n % i == 0) return false;     return true;   }   template <class T>   inline T Mod(T n, T m) {     return (n % m + m) % m;   }   template <class T>   string toString(T n) {     ostringstream oss;     oss << n;     oss.flush();     return oss.str();   }   int toInt(string s) {     int r = 0;     istringstream sin(s);     sin >> r;     return r;   }   long long toLl(string s) {     long long r = 0;     istringstream sin(s);     sin >> r;     return r;   }   template <class T>   void debug(const T& e) {     cout << e << endl;   }   template <class T1, class T2>   void debug(const T1& e1, const T2& e2) {     cout << e1 <<   t  << e2 << endl;   }   template <class T1, class T2, class T3>   void debug(const T1& e1, const T2& e2, const T3& e3) {     cout << e1 <<   t  << e2 <<   t  << e3 << endl;   }   template <class T1, class T2, class T3, class T4>   void debug(const T1& e1, const T2& e2, const T3& e3, const T4& e4) {     cout << e1 <<   t  << e2 <<   t  << e3 <<   t  << e4 << endl;   }   template <class T1, class T2, class T3, class T4, class T5>   void debug(const T1& e1, const T2& e2, const T3& e3, const T4& e4,              const T5& e5) {     cout << e1 <<   t  << e2 <<   t  << e3 <<   t  << e4 <<   t  << e5 << endl;   }   template <class T>   void debug(vector<T>& e) {     int i;     for (i = 0; i < (int)e.size(); i++) cout << e[i] <<    ;     cout << endl;   }   template <class T>   void debug(vector<basic_string<T> >& e) {     int i, j;     for (i = 0; i < (int)e.size(); i++) {       for (j = 0; j < (int)e[i].size(); j++) cout << e[i][j];       cout << endl;     }     cout << endl;   }   template <class T>   void debug(vector<vector<T> >& e, int row, int col) {     int i, j;     for (i = 0; i < row; i++) {       for (j = 0; j < col; j++) cout << e[i][j] <<   t ;       cout << endl;     }     cout << endl;   }   template <class T>   void debug(T e[100010][100010], int row, int col) {     int i, j;     for (i = 0; i < row; i++) {       for (j = 0; j < col; j++) cout << e[i][j] <<    ;       cout << endl;     }   }   long long Pow(long long B, long long P) {     long long R = 1;     while (P > 0) {       if (P % 2 == 1) R = (R * B);       P /= 2;       B = (B * B);     }     return R;   }   int x[100010], y[100010], a[100010];   int main() {     int i, j, test, Case = 1, n, cnt;     while (scanf( %d , &n) == 1) {       for (i = 0; i < n; i++) scanf( %d , &a[i]);       x[0] = a[0];       for (i = 1; i < n; i++) x[i] = a[i] + x[i - 1];       y[n - 1] = a[n - 1];       for (i = n - 2; i >= 0; i--) y[i] = a[i] + y[i + 1];       cnt = 0;       for (i = 0; i < n - 1; i++)         if (x[i] == y[i + 1]) cnt++;       printf( %d n , cnt);     }     return 0;   }   