Pagini recente » Cod sursa (job #287298) | Cod sursa (job #110516) | Cod sursa (job #2688793) | Borderou de evaluare (job #220154) | Cod sursa (job #466587)
Cod sursa(job #466587)
#include<fstream>
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
int a[100001];
int main()
{
int n,k,i,j,nr,S; bool ok;
fin>>n;
for(i=1;i<=n;i++) fin>>a[i];
nr=n-1;//pt k=1
for(k=2;k<=n/2;k++)
for(i=1;i<=n-2*k+1;i++)
{
S=a[i]+a[i+2*k-1]; ok=true;
for(j=i+1;j<=i+k-1 && ok;j++)
if(a[j]+a[2*(i+k)-j-1]!=S) ok=false;
if(ok) nr++;
}
fout<<nr;
fin.close(); fout.close();
return 0;
}