Pagini recente » Cod sursa (job #1575925) | Cod sursa (job #1507560) | Cod sursa (job #2004107) | Cod sursa (job #44829) | Cod sursa (job #2064780)
#include <fstream>
#include <algorithm>
#define Nmax 802
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int a[Nmax],n;
void Read(int a[Nmax],int &n)
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
}
int CautareBinara(int a[Nmax],int s,int d,int val)
{
if(s<d)
{
int m=s+(d-s)/2;
if(a[m]==val)return m;
else if(a[m]>val) return CautareBinara(a,s,m-1,val);
else return CautareBinara(a,m+1,d,val);
}
return d;
}
int main()
{
Read(a,n);
sort(a+1,a+n+1);
int i,j,raspuns,nr=0;
for(i=1;i<=n-2;++i)
for(j=i+1;j<=n-1;++j)
{
raspuns=CautareBinara(a,j+1,n,a[i]+a[j]);
while(raspuns>j&&a[raspuns]>a[i]+a[j])--raspuns;
if(a[i]+a[j]>=a[raspuns])nr=nr+raspuns-j;
}
fout<<nr;
return 0;
}