Cod sursa(job #3157699)
| Utilizator | Data | 16 octombrie 2023 17:30:03 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <bits/stdc++.h>
#define MAX 800
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[MAX+1], n, S;
int CB(int i, int j)
{
int st=1;
int dr=n;
int rez=0;
while(st<=dr)
{
int mij = (st+dr)/2;
if(v[i]+v[j]>=v[mij])
{
rez=mij;
st=mij+1;
}
else dr=mij-1;
}
return rez;
}
int main()
{
fin >> n;
for(int i=1; i<=n; i++)fin >> v[i];
sort(v+1,v+1+n);
for(int i=1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
S+=CB(i,j)-j;
}
}
fout << S;
return 0;
}
