Pagini recente » Cod sursa (job #2844266) | Cod sursa (job #2187371) | Cod sursa (job #843042) | Cod sursa (job #203382) | Cod sursa (job #2967466)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[100001];
int cautbin(int st,int dr,int a, int b)
{
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]>=a-b && v[mij]<=a+b)
{
return 1;
}
else
{
if(v[mij]<a-b)
st=mij+1;
else if(v[mij]>a+b)
dr=mij-1;
}
}
return 0;
}
int main()
{
int n,rez=0;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n;i++)
{
for(int j=i+1;j<=n;j++)
rez+=cautbin(j+1,n,v[i],v[j]);
}
fout<<rez;
}