Pagini recente » Cod sursa (job #168208) | Cod sursa (job #2421248) | Cod sursa (job #1622224) | Cod sursa (job #2775444) | Cod sursa (job #2075733)
#include <fstream>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,v[801],i,j,nr;
int triunghi(int i, int j, int m)
{
if(v[m]<=v[i]+v[j] && v[i]<=v[m]+v[j] && v[j]<=v[i]+v[m])
return 1;
return 0;
}
void cautare()
{
int p=1;
int u=n;
while(p<=n)
{
int m=(p+u)/2;
if((triunghi(i,j,m)==1 && v[m+1]>v[i]+v[j])||(m==n && triunghi(i,j,m)==1)&& m!=i && m!=j)
{
nr++;
return;
}
else
if(v[m]<=v[i]+v[j] && v[m+1]<=v[i]+v[j])
p=m+1;
else
u=m-1;
}
return;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
for(j=i+1;j<n;j++)
cautare();
fout<<nr;
return 0;
}