Pagini recente » Cod sursa (job #8690) | Cod sursa (job #611115) | Cod sursa (job #935350) | Cod sursa (job #1387093) | Cod sursa (job #1348604)
//#include <iostream>
#include <fstream>
#include <algorithm>
const int maxn=805;
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[maxn];
int bin_sch(int x,int n)
{
int st=1;
int dr=n + 1;
while(dr-st>1)
{
int mij=(st+dr)/2;
if(v[mij]<=x)st=mij;
else if(v[mij]>x) dr=mij;
}
return st;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
v[n + 1] = 100000000;
int nr=0;
for(int i=1;i<=n-2;i++)
{
for(int j=i+1;j<=n-1;j++)
{
int cnt=bin_sch(v[i]+v[j],n)-j;
nr=nr+cnt;
}
}
cout<<nr;
return 0;
}