def split_list(lst, n):
division = len(lst) // n
modulus = len(lst) % n
return [lst[i * division + min(i, modulus):(i + 1) * division + min(i + 1, modulus)] for i in range(n)]
05-12
255

def split_list(lst, n):
division = len(lst) // n
modulus = len(lst) % n
return [lst[i * division + min(i, modulus):(i + 1) * division + min(i + 1, modulus)] for i in range(n)]