Cod sursa(job #1822309)
Utilizator | Data | 4 decembrie 2016 18:44:50 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
int a[805],n,ans,r,y;
int main()
{ifstream fin( "nrtri.in");
ofstream fout("nrtri.out");
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
sort(a+1,a+n+1);
for(int i=1;i<=n-2;i++)
for(int j=i+1;j<=n-1;j++)
{
int x=lower_bound(a+j,a+n+1,a[i]+a[j]) -a;
if (a[x]==a[i]+a[j] && x!=1) ans++;
}
fout<<ans+1;
return 0;
}