Pagini recente » Cod sursa (job #2458146) | Cod sursa (job #938625) | Cod sursa (job #2533417) | Cod sursa (job #792068) | Cod sursa (job #332241)
Cod sursa(job #332241)
#include "fstream"
#include "math.h"
std::ifstream in("nrtri.in");
std::ofstream out("nrtri.out");
int poz1,poz2,i,j,n;
int cautareBinara(int vect[],int val1,int val2,int stanga,int dreapta)
{
int z=0;
for(int p=dreapta;p<n;p++)
if(val1+val2>vect[p])
z++;
return z;
}
void qSort(int vect[], int stanga, int dreapta) {
int i = stanga, j = dreapta;
int tmp;
int pivot = vect[(stanga + dreapta) / 2];
while (i <= j) {
while (vect[i] < pivot)
i++;
while (vect[j] > pivot)
j--;
if (i <= j) {
tmp = vect[i];
vect[i] =vect[j];
vect[j] = tmp;
i++;
j--;
}
};
if (stanga < j)
qSort(vect, stanga, j);
if (i < dreapta)
qSort(vect, i, dreapta);
}
int main ()
{
int k=0;
in>>n;
int *a=new int[n];
for(i=0;i<n;i++)
in>>a[i];
qSort(a,0,n-1);
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
k+=(cautareBinara(a,a[i],a[j],j+1,n-1));
out<<k;
in.close ();
out.close ();
return 0;
}