Cod sursa(job #1898854)
| Utilizator | Data | 2 martie 2017 12:16:26 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,ans;
int v[2005];
int bs(int arg)
{
int st,med,dr,last;
st=1; dr=n;
while(st<=dr)
{
med=(st+dr)/2;
if(v[med]>arg || v[med]==arg) dr=med-1;
else
{
last=med;
st=med+1;
}
}
return last;
}
int main()
{
in>>n;
for(int i=1; i<=n; i++) in>>v[i];
sort(v+1,v+n+1);
for(int i=1; i<n; i++)
for(int j=i+1; j<=n; j++)
{
ans+=bs(v[i]+v[j]+1);
ans-=j;
}
out<<ans;
return 0;
}
