Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- void boostear()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- }
- void files()
- {
- freopen("input.txt", "r", stdin); // redirects standard input
- freopen("output.txt", "w", stdout); // redirects standard output
- }
- int main()
- {
- boostear();
- int n;
- cin >> n;
- if(n==1)
- {
- cout << 1;
- return 0;
- }
- else if(n==2)
- {
- cout << 0;
- return 0;
- }
- vector<int> c(n);
- for(int i=0; i<n; i++)
- cin >> c[i];
- vector<int> odd(n), even(n);
- even[0]=0;
- if(n>2)
- odd[0]=c[0], odd[1]=odd[0];
- for(int i=2; i<n; i+=2)
- odd[i]=odd[i-1]+c[i], odd[i+1]=odd[i];
- for(int i=1; i<n; i+=2)
- even[i]=even[i-1]+c[i], even[i+1]=even[i];
- int res=0;
- if(odd[n-1]-c[0] == even[n-1])
- res++;
- if(n%2 != 0)
- if(odd[n-1]-c[n-1] == even[n-1])
- res++;
- else if(n%2 == 0)
- if(even[n-1]-c[n-1] == odd[n-1])
- res++;
- for(int i=1; i<n-1; i++)
- {
- int suma1=odd[i-1]+(even[n-1]-even[i]);
- int suma2=even[i-1]+(odd[n-1]-odd[i]);
- if(suma1==suma2)
- res++;
- }
- cout << res;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement