Cod sursa(job #2324921)
| Utilizator | Data | 21 ianuarie 2019 18:48:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[805];
int main()
{
int n,a,cnt=0;
cin >> n;
for(int i=0; i<n; i++)
{
cin >> a;
v[i]=a;
}
sort(v,v+n);
for(int m=0; m<n; m++)
{
for(int k=m+1; k<n; k++)
{
int st=k+1,dr=n-1,mij,last=k;
while(st<=dr)
{
mij=st+(dr-st)/2;
if(v[mij]>v[m]+v[k])
dr=mij-1;
else
{
st=mij+1;
last=mij;
}
}
cnt+=last-k;
}
}
cout << cnt;
return 0;
}
