Cod sursa(job #2395808)
| Utilizator | Data | 2 aprilie 2019 21:29:47 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<bits/stdc++.h>
using namespace std;
int main(){
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,mij,rez,st=1,dr,v[805],cont=0;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
sort(v+1, v+n+1);
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
st=j+1;
dr=n;
while(st<=dr){
mij=(st+dr)/2;
if(v[i]+v[j]>=v[mij]){
st=mij+1;
cont++;
}
else{
dr=mij-1;
}
}
//cont=cont+rez-j;
}
}
fout<<cont;
return 0;
}
