Создание массива на 10**18 элементов (cannot fit 'int' into an index-sized integer)

n = int(input())
k = int(input())
a = [0] * n
maximum = 0
end_ind = 0
current = 0
last_ind = 0
left = 0
right = 0
for i in range(k):
    maximum = 0
    end_ind = 0
    current = 0
    for j in range(n):
        if a[j] == 1:
            if current >= maximum:
                maximum = current
                end_ind = j - 1
            current = 0    
        elif j == n - 1:
            if current + 1 >= maximum:
                maximum = current + 1
                end_ind = j
        else:
            current += 1
 
    last_ind = end_ind - maximum // 2
    a[last_ind] = 1
    
left = last_ind - 1
right = last_ind + 1
while a[right] != 1 and right != n - 1:
    right += 1
    
while a[left] !=1 and left != 0:
    left -= 1
 
if left == 0:
    left = last_ind - left
else:
    left = last_ind - left - 1
if right == n - 1:
    right -= last_ind
else:
    right = right - last_ind - 1
print(min(left, right), max(left, right))

n = int(input())
k = int(input())
worklist = list()
worklist.append(n)
while k > 0:
    if worklist[0] % 2 == 1:
        tmp = int((worklist[0] - 1) / 2)
        del worklist[0]
        worklist.append(tmp)
        worklist.append(tmp)
    else:
        tmp = int(worklist[0] / 2)
        del worklist[0]
        worklist.append(tmp)
        worklist.append(tmp-1)
    k = k-1
print(worklist[len(worklist)-2], worklist[len(worklist)-1])

worklist = [n]

print(worklist[-2], worklist[-1])

n = int(input())
k = int(input())
worklist = [n]
while k > 0:
    temp = worklist.pop(0)
    worklist.append((temp - temp % 2) // 2)
    worklist.append((temp - temp % 2) // 2 - (1 - temp % 2))
    k -= 1
print(worklist[-1], worklist[-2])

def maxkeyindict(x):
    # Максимальное значение ключа в словаре
    a = [i for i in x.keys()]
    if max(a) > 0:
        return max(a)
    else:
        return 0
 
def createnewkeyorinc(x, y):
    # Если ключ имеется в словаре, то его значение уменьшается на один
    # Если ключа нет - то создается пара (ключ:1)
    if y in x.keys():
        x[y] += 1
    else:
        x[y] = 1
 
n = int(input())
k = int(input())
workdict = {n:1}
maxkeys = n
while k > 0:
    temp = maxkeys
    if workdict[maxkeys] > 1:
        workdict[maxkeys] -= 1
    else:
        workdict.pop(maxkeys)
    createnewkeyorinc(workdict, (temp - temp % 2) // 2)
    createnewkeyorinc(workdict, (temp - temp % 2) // 2 - (1 - temp % 2))
    k -= 1
    maxkeys = maxkeyindict(workdict)
# Вывод ответа
a = [i for i in workdict.keys()]
a.sort()
if workdict[a[0]] >= 2:
    print(a[0], a[0])
else:
    print(a[1], a[0])

import math
 
n = 100
k = 3
level = int(math.log2(k)) 
z = (n-k)/(2**level)
left = int(z//2)
right = int(z - left)
print('Left: ', left)
print('Right: ', right)