Cod sursa(job #2628201)
| Utilizator | Data | 14 iunie 2020 21:53:51 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[805];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;++i)
cin>>v[i];
sort(v+1,v+n+1);
int ans=0;
for(int i=1;i<n-1;++i)
for(int j=i+1;j<n;++j)
{
int l=j,r=n,med;
while(l<r)
{
if(r==l+1)
med=r;
else med=(l+r)/2;
if(v[med]>v[i]+v[j])
r=med-1;
else l=med;
}
ans+=l-j;
}
cout<<ans<<'\n';
return 0;
}
