The problem statement contains superscripts and subscripts that can be seen in the applet.
Given a randomly generated sequence, it can be useful to know how unsorted it is. The sequence a_{1}, a_{2}, a_{3}, a_{4}, ... , a_{n}
gets 1 'unsortedness point' for every distinct pair (i,j) where i < j but a_{i} > a_{j}. The terms in the sequence are defined by the following formula: a_{1} = 1 and a_{k} = (m * a_{k1} + c) % (2^{31}  1)
Here % denotes the modulus or remainder operator. Return the number of unsortedness points scored by this nelement sequence.
