Pagini recente » Cod sursa (job #1967533) | Cod sursa (job #2201450) | Cod sursa (job #2149679) | Cod sursa (job #591768) | Cod sursa (job #883975)
Cod sursa(job #883975)
#include <stdio.h>
#include <stdlib.h>
#define MAX 800
void quicksort(int x[],int first,int last){
int pivot,j,temp,i;
if(first<last){
pivot=first;
i=first;
j=last;
while(i<j){
while(x[i]<=x[pivot]&&i<last)
i++;
while(x[j]>x[pivot])
j--;
if(i<j){
temp=x[i];
x[i]=x[j];
x[j]=temp;
}
}
temp=x[pivot];
x[pivot]=x[j];
x[j]=temp;
quicksort(x,first,j-1);
quicksort(x,j+1,last);
}
}
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int v[MAX];
int n, i, a, b, c, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d ", &v[i]);
quicksort(v,1,n);
i = 0;
for (a = 1; a < n; a++)
for (b = a+1; b <= n; b++)
{
k = v[a] + v[b];
for (c = b+1; c <= n ;c++)
if (k >= v[c]) i++;
}
printf("%d", i);
return 0;
}