Pagini recente » Cod sursa (job #2927761) | Cod sursa (job #621118) | Cod sursa (job #1312552) | Cod sursa (job #3126749) | Cod sursa (job #3276983)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
int n, a[100003];
long long s, cnt;
int main()
{
int i, x, y;
fin >> n;
for (i = 1; i <= n; i++)
fin >> a[i];
for (i = 1; i < n; i++)
{
x = i;
y = i + 1;
s = a[x] + a[y];
while (x > 1 && y < n && a[x-1] + a[y+1] == s)
{
x--;
y++;
}
cnt += (y - x + 1) / 2;
}
fout << cnt << "\n";
return 0;
}