Hashing

def solve(size, nums):
    size = int(size)
    nums = list(map(int, nums.split(',')))
    table = [-1] * size
    for n in nums:
        pos = n % size
        if table[pos] == -1:
            table[pos] = n
        else:
            step = 0
            while step < size:
                new_pos = (pos + step * step) % size
                if table[new_pos] == -1:
                    table[new_pos] = n
                    break
                step += 1
            if step >= size:
                print('-', end=' ')
                continue
        print(pos, end=' ')
    print()