Cod sursa(job #2975173)
| Utilizator | Data | 5 februarie 2023 17:51:50 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | r2-2023 | Marime | 0.72 kb |
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,i,j,nr,a,b,st,dr,mij;
int v[1000];
int main()
{
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
sort(v+1,v+1+n);
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
{
st=1;
dr=n;
b=v[i]+v[j];
a=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>b)
dr=mij-1;
else
{
a=mij;
st=mij+1;
}
}
nr=nr+a-j;
}
out<<nr;
return 0;
}
