Cod sursa(job #3276956)
| Utilizator | Data | 15 februarie 2025 10:48:16 | |
|---|---|---|---|
| Problema | Numarare | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | vs11_12_vine_oji_2025 | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
int a[100001];
int n, m, k;
void Citire()
{
fin >> n;
for(int i = 1; i <= n;i++)
fin >> a[i];
}
void Rezolvare()
{
int i, j, p, cnt = 0;
for(p = 1;p <= n;p++)
{
i = p;
j = p + 1;
while(i > 0 && j <= n && (a[i] + a[j]) == (a[p] + a[p+1]))
i--, j++;
cnt += (j - i) / 2;
}
fout << cnt;
}
int main()
{
Citire();
Rezolvare();
return 0;
}