Given an unsorted array arr[] of n positive integers. Find the number of triangles that can be formed with three different array elements as lengths of three sides of triangles.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
3 <= n <= 10^3 1 <= arr[i] <= 10^3
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
5 6 4 9 7 8
Output
10