Pagini recente » Borderou de evaluare (job #2705087) | Cod sursa (job #568213) | Cod sursa (job #1800804) | Cod sursa (job #479000) | Cod sursa (job #2207322)
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <ctime>
using namespace std;
int v[801];
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int n,mij,st,dr,i,y,x,cnt=0,j,random;
srand(time(NULL));
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
for(i=1;i<n-1;i++)
{
x=v[i];
for(j=i+1;j<n;j++)
{
y=v[j];
st=j+1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(x+y<v[mij])
dr=mij-1;
else
if(x+v[mij]<y || y+v[mij]<x)
st=mij+1;
else
{
cnt++;
if(st==dr)
st=dr+1;
else
{
random=rand()%100;
if(random<=50)
st=mij+1;
else
dr=mij-1;
}
}
}
}
}
printf("%d",cnt);
return 0;
}