Cod sursa(job #2274684)
Utilizator | Data | 2 noiembrie 2018 12:17:59 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.13 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-2;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;
}
if (st>dr) {
sol+=n-dr+1;
}
}
}
fout<<sol;
/*for (i=1;i<n-1;i++) {
for (j=i+1;j<=n-1;j++) {
a=i+j;
st=j+1;
dr=n;
sol=0;
while (st<=dr) {
mij=(st+dr)/2;
if (v[mij]<a)
dr=mij-1;
else {
sol=mij;
break;
}
}
if (sol!=0)
sfin++;
}
}
fout<<sfin;*/
}