Problem:
Score : 400 points

Problem Statement

Takahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.

He is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:

a < b + c

b < c + a

c < a + b

How many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.

Constraints

All values in input are integers.

3 \leq N \leq 2 \times 10^3

1 \leq L_i \leq 10^3

Input

Input is given from Standard Input in the following format:

N
L_1 L_2 ... L_N

Constraints

Print the number of different triangles that can be formed.

Sample Input 1

4
3 4 2 1

Sample Output 1

1

Only one triangle can be formed: the triangle formed by the first, second, and third sticks.

Sample Input 2

3
1 1000 1

Sample Output 2

0

No triangles can be formed.

Sample Input 3

7
218 786 704 233 645 728 389

Sample Output 3

23

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Text.RegularExpressions;
using static System.Console;

namespace AtCoder_1
{
    class Program
    {
        static void Main(string[] args)
        {
            var N = CinT();
            var L = CinTAr();
            Array.Sort(L);
            Array.Reverse(L);
            long t = 0;
            bool blf;
            int rc;
            for (int a = 0; a < N - 2; a++)
            {
                blf = false;
                for (int b = a + 1; b < N - 1; b++)
                {
                    rc = L[a] - L[b] + 1;
                    for (int c = b + 1; c < N; c++)
                    {
                        if(L[b] == L[c]) { continue; }
                        if(rc <= L[c]) { 
                            t++; 
                        } 
                        else
                        {
                            blf = true;
                            break;
                        }
                    }

                    if (blf) { break; }
                }


            }
            Cout(t);
            Cin();
        }

        static int loop(int num, int max)
        {
            if (num > max)
            {
                return 0;
            }
            else if (num < 0)
            {
                return max;
            }
            else
            {
                return num;
            }
        }
        static long GCD(long a, long b)
        {
            if (a < b) { swap(ref a, ref b); }
            if (a % b == 0) { return b; }
            else { return GCD(b, a % b); }
        }

        static void swap<T>(ref T a, ref T b)
        {
            T t = a;
            a = b;
            b = t;
        }

        static readonly int MOD10E9 = (1000000000 + 7);
        static bool isInt(double d) { return (int)d == d; }
        static string Cin() { return ReadLine(); }
        static string[] CinAr() { return ReadLine().Split(' '); }
        static int CinT() { return S2i(Cin()); }
        static int[] CinTAr() { return CinAr().Select((x, i) => { return S2i(x); }).ToArray(); }
        static long CinL() { return S2L(Cin()); }
        static long[] CinLAr() { return CinAr().Select((x, i) => { return S2L(x); }).ToArray(); }
        static double CinD() { return S2D(Cin()); }
        static double[] CinDAr() { return CinAr().Select((x, i) => { return S2D(x); }).ToArray(); }
        static int S2i(string s) { return int.Parse(s); }
        static long S2L(string s) { return long.Parse(s); }
        static double S2D(string s) { return double.Parse(s); }
        static void Cout(object s) { WriteLine(s); }
        static long[] yakusuu(long n)
        {
            if(n == 1) { return new long[] { 1}; }
            List<long> res = new List<long>();
            res.Add(1);
            for (long i = 2; i <= n / 2 + 1; i++)
            {
                if (n % i == 0)
                {
                    res.Add(i);
                }
            }
            res.Add(n);
            return res.ToArray();
        }
        static bool isPrime(long num)
        {
            if(num == 1) { return false; }
            for(long i = 2; i <= Math.Sqrt(num) + 1; i++)
            {
                if(num % i == 0) { return false; }
            }
            return true;
        }

        static void CoutAr<Type>(IEnumerable<Type> types)
        {
            string text = string.Join(" ", types);
            WriteLine(text);
        }

        public static long nCr(int n, int r)
        {
            // naive: return Factorial(n) / (Factorial(r) * Factorial(n - r));
            return nPr(n, r) / Factorial(r);
        }

        public static long nPr(int n, int r)
        {
            // naive: return Factorial(n) / Factorial(n - r);
            return FactorialDivision(n, n - r);
        }

        private static long FactorialDivision(int topFactorial, int divisorFactorial)
        {
            long result = 1;
            for (int i = topFactorial; i > divisorFactorial; i--)
                result *= i;
            return result;
        }

        private static long Factorial(int i)
        {
            if (i <= 1)
                return 1;
            return i * Factorial(i - 1);
        }
    }

    public struct Pair<T>
    {
        public T a;
        public T b;
        public Pair(T _a, T _b) { a = _a; b = _b; }
    }
}