Cod sursa(job #2854323)
| Utilizator | Data | 21 februarie 2022 11:12:23 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,s,st,dr,mijl,sol;
int a[810];
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++){
s=a[i]+a[j];
st=j+1; dr=n;
while(st<=dr){
mijl=(st+dr)/2;
if(a[mijl]>s) dr=mijl-1;
else st=mijl+1;
}
sol+=(dr-j);
}
g<<sol<<'\n';
return 0;
}
