fork download
  1. #include <stdio.h>
  2.  
  3. void quicksort(int *arr,int start ,int end)
  4. {
  5. int i, j,key;
  6. key = arr[(start + end)/2];
  7. i = start;
  8. j = end;
  9. do
  10. {
  11. while( arr[i] < key )
  12. i++;
  13. while(arr[j] > key)
  14. j--;
  15. if(i<=j)
  16. {
  17. int temp = arr[i];
  18. arr[i] = arr[j];
  19. arr[j] = temp;
  20. i++;
  21. j--;
  22. }
  23. }while(i<=j);
  24. if(start < j)
  25. quicksort(arr,start,j);
  26. if(i<end)
  27. quicksort(arr,i,end);
  28. }
  29.  
  30. int main()
  31. {
  32. int N,L[2001],W,i,j,k;
  33. scanf("%d",&N);
  34. while(N!=0)
  35. {
  36. for(i=1;i<=N;i++)
  37. scanf("%d",&L[i]);
  38. quicksort(L,1,N);
  39. W=0;
  40. for(i=N;i>=3;i--)
  41. {
  42. j=1;
  43. k=i-1;
  44. while(j<k)
  45. if(L[j]+L[k]<L[i])
  46. {
  47. W+=k-j;
  48. j++;
  49. }
  50. else
  51. k--;
  52. }
  53. printf("%d\n",W);
  54. }
  55. return 0;
  56. }
  57.  
Success #stdin #stdout 0s 9432KB
stdin
Standard input is empty
stdout
Standard output is empty