Pagini recente » Monitorul de evaluare | Istoria paginii utilizator/nastika | Monitorul de evaluare | Clasament dupa rating | Cod sursa (job #304296)
Cod sursa(job #304296)
#include<stdio.h>
#define max 3000
int x,m,nr=0,n,k,b,a,v[max+1],in[max],poza,pozb;
void aranjare()
{int i,aux,j;
for(i=1;i<x;i++)
for(j=i+1;j<=x;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
int caut(int m,int k)
{ int lo=1,i,j,hi=x,mid;
while(lo<=hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<k+m&&v[mid]!=k&&v[mid]!=m) ++nr,hi=mid-1;
else if(m+k>=v[mid]) lo=mid+1;
}
return -1;
}
int main()
{int i,j;
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
scanf("%d",&x);
for(i=1;i<=x;i++)
scanf("%d",&v[i]);
aranjare();
for(i=1;i<=x;i++)
for(j=i+1;j<x;j++)
{
a=v[i];b=v[j];poza=i;pozb=j;caut(a,b);
}
printf("%d",nr);
return 0;
}