Cod sursa(job #2395173)
| Utilizator | Data | 2 aprilie 2019 12:00:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream si("nrtri.in");
ofstream so("nrtri.out");
int v[805];
int main()
{
int n;
si>>n;
for(int i=1; i<=n; ++i) {
si>>v[i];
}
int sol=0;
sort(v+1, v+n+1);
for(int i=1; i<=n; ++i) {
for(int j=i+1; j<=n; ++j) {
int st=j+1, dr=n, mij, rez=j;
while(st<=dr) {
mij=(st+dr)/2;
if(v[mij]<=v[i]+v[j]) {
rez=mij;
st=mij+1;
}
else
dr=mij-1;
}
sol=sol+rez-j;
}
}
so<<sol<<'\n';
return 0;
}
