Cod sursa(job #2354654)
Utilizator | Data | 25 februarie 2019 14:31:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int v[800];
int cautbin(int val, int marime)
{
int pos =0 ;
for(int msk=1<<9; msk>0; msk/=2)
if(msk+pos<=marime && v[msk+pos]<=val)
pos += msk;
return pos;
}
int main()
{
int n, nrt=0, nr, k;
cin >> n;
for(int i=1; i<=n; i++)
cin >> v[i];
sort(v+1, v+n+1);
for(int i=1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
nr = cautbin(v[i] + v[j], n);
if(nr>j)
nrt += nr-j;
}
}
cout << nrt;
return 0;
}