Pagini recente » Cod sursa (job #599356) | Cod sursa (job #323521) | Cod sursa (job #2660289) | Cod sursa (job #2125634) | Cod sursa (job #1331960)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int sol,sol1,dr,st,j,i,mijl,v[801],n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
st=j+1;
dr=n;
while(st<=dr)
{
mijl=(st+dr)/2;
if(v[mijl]>v[i]&&v[mijl]>v[j]&&v[mijl]<=v[i]+v[j])
{
sol=mijl;
st=mijl+1;
}
else
dr=mijl-1;
}
sol1+=sol-j;
}
}
fout<<sol1;
return 0;
}