Pagini recente » Cod sursa (job #2233426) | Cod sursa (job #1050056) | Cod sursa (job #99528) | Cod sursa (job #2866112) | Cod sursa (job #3277114)
#include <bits/stdc++.h>
using namespace std;
/// O(n^2)
const int MAX = 100005;
int a[MAX];
int main()
{
ifstream cin("numarare.in");
ofstream cout("numarare.out");
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int ans = 0;
for (int i = 1; i <= n; ++i)
{
int left = i, right = i+1;
while (left >= 1 && right <= n && a[left]+a[right] == a[i]+a[i+1])
{
++ans;
--left;
++right;
}
}
cout << ans;
return 0;
}