Cod sursa(job #2417955)
| Utilizator | Data | 2 mai 2019 15:41:07 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int main()
{
int n,v[805],i,j,x,st,dr,mij,nr=0;
fin >> n;
for (i=1;i<=n;i++)
{
fin >> v[i];
}
sort(v+1,v+n+1);
for (i=1;i<=n-2;i++)
{
for (j=i+1;j<=n-1;j++)
{
x=v[i]+v[j];
st=j+1;
dr=n;
while (st<dr)
{
mij=(st+dr+1)/2;
if (v[mij]<=x)
{
nr=nr+mij-st+1;
st=mij;
}
else dr=mij-1;
}
if (dr==j+1 && v[dr]<=x) nr=nr+1;
}
}
fout << nr;
}
