Pagini recente » Cod sursa (job #2032705) | Cod sursa (job #1267297) | Cod sursa (job #2166915) | Cod sursa (job #1200409) | Cod sursa (job #1573194)
#include <fstream>
#include <algorithm>
using namespace std;
int v[870],x;
int main()
{
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n;
fin>>n;
int a,b,c,s,counte=0,e,val,raspuns;
for (int i=0;i<n;++i)
{
fin>>v[i];
}
sort (v,v+n);
for (int i=0;i<n-2;++i)
{
a=v[i];
for (int j=i+1;j<n-1;++j)
{
raspuns=0;
b=v[j];
s=j+1;
e=n-1;
val=v[i]+v[j];
while (s<=e)
{
int mijloc=(s+e)/2;
if (val>=v[mijloc])
{
raspuns=mijloc;
s=mijloc+1;
}
else
{
e=mijloc-1;
}
}
if (raspuns!=0){counte+=raspuns-j;}
}
}
fout<<counte;
}