Cod sursa(job #2405687)
| Utilizator | Data | 14 aprilie 2019 19:06:18 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,a,st,dr,mij,sol,v[900];
int main () {
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++) {
a=v[i]+v[j];
st=j+1;
dr=n;
while (st<=dr) {
mij=(st+dr)/2;
if (v[mij]>a)
dr=mij-1;
else
st=mij+1;
}
sol+=dr - j;
}
}
fout<<sol;
}
