mockvita-2-inversion

mockvita-2-inversion.py

from numpy import base_repr

def sum_of_digits(array):
    digit_sum = []

    for i in range(len(array)):
        x = [int(x) for x in str(array[i])]
        digit_sum.append(sum(x))
    return digit_sum

def getInvCount(arr, n):
    inv_count = 0
    for i in range(n):
        for j in range(i + 1, n):
            if (arr[i] > arr[j]):
                inv_count += 1

def toStr(n, base):
    convertString = "0123456789ABCDEF"
    if n < base:
        return convertString[n]
    else:
        return toStr(n // base, base) + convertString[n % base]

    return inv_count

n = int(input())
array = list(input().split(','))


base_six_array = []

for i in range(n):
    base_six_array.append(toStr(int(array[i]),6))

digits = sum_of_digits(base_six_array)

print(getInvCount(digits,n))