Cod sursa(job #2444851)
| Utilizator | Data | 1 august 2019 16:43:37 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n,v[800];
int cb(int x)
{
int st=1,dr=n;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]>x){dr=mij-1;}
else st=mij+1;
}
return dr;
}
int main()
{
int i,j,k=0;
cin>>n;
for(i=0;i<n;i++)
cin>>v[i];
sort(v,v+n);
for(i=0;i<n-2;i++)
for(j=i+1;i<n-1;j++)
k+=cb(v[i]+v[j])-j;
cout<<k;
return 0;
}
