Pagini recente » Cod sursa (job #1313323) | Cod sursa (job #680687) | Cod sursa (job #537242) | Cod sursa (job #3184742) | Cod sursa (job #466706)
Cod sursa(job #466706)
#include <stdio.h>
#include <algorithm>
using namespace std;
#define maxn 100010
long n, i, j, sol, v[maxn];
int main()
{
freopen("numarare.in", "r", stdin);
freopen("numarare.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++)
scanf("%d", &v[i]);
for(i=1; i<n; i++)
{
for(j=0; v[i]+v[i+1]==v[i-j]+v[i+j+1] && i-j>0 && i+j+1<=n; ++j);
sol+=j;
}
printf("%d\n", sol);
return 0;
}