Cod sursa(job #466706)
| Utilizator | Data | 27 iunie 2010 13:31:06 | |
|---|---|---|---|
| Problema | Numarare | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Stelele Informaticii 2010, clasele X-XII, Ziua 1 | Marime | 0.44 kb |
#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;
}
