* I decided to use this approach because it was the most intuitive to me, as the reversed array gets bigger the index position needed from the given array gets smaller, and so the equation for that is ...

# Given two integers n and k, find how many different arrays consist of numbers # from 1 to n such that there are exactly k inverse pairs. # We define an inverse pair as following: For ith and jth ...