Pagini recente » Istoria paginii runda/a_short_round | Autentificare | Istoria paginii runda/4_ian_2014 | Istoria paginii runda/simulare_oji_2023_clasa_10_11_martie/clasament | Cod sursa (job #179987)
Cod sursa(job #179987)
#include<stdio.h>
#include<stdlib.h>
int v[1000],n,i,j,r;
int cmp(const void*a,const void*b)
{return *(int*)a-*(int*)b;}
int cb(int x,int y)
{int m=(x+y)/2;
while(x<=y)
if((v[m]<=v[i]+v[j]&&v[i]+v[j]<v[m+1])||(v[m]<=v[i]+v[j]&&m==n-1)) return m;
else if(v[m]<=v[i]+v[j]&&v[m+1]<=v[i]+v[j]) {x=m+1;
m=(x+y)/2;}
else {y=m-1;
m=(x+y)/2;}
}
int main()
{int t;
FILE*f=fopen("nrtri.in","r");
FILE*g=fopen("nrtri.out","w");
fscanf(f,"%d",&n);
for(i=0;i<n;i++)
fscanf(f,"%d",&v[i]);
//qsort(v,n,sizeof(v[0]),cmp);
for(i=0;i<n-2;i++)
for(j=1;j<n-1;j++)
{t=cb(1,n);
r+=t-j;}
fprintf(g,"%d",r);
fcloseall();
return 0;
}