Envío 381

Código

def solve_horizon(input_list):
    if len(input_list) == 0:
        return
    case_list = []
    copy_list = input_list.copy()
    for idx, num in enumerate(input_list):
        if num == max(copy_list) or idx == len(input_list) - 1:
            copy_list.remove(num)
            case_list.append(-1)
        else:
            for idx2, num2 in enumerate(input_list):
                if idx2 > idx and num < num2:
                    case_list.append(num2)
                    break

    return case_list

if __name__ == "__main__":
    n = int(input())
    while (n != 0):
        case = 1
        input_list = input().split()
        solve = solve_horizon(input_list)
        print('Case #{}: '.format(case), end='')
        for idx, num in enumerate(solve):
            if idx != n:
                print(num, end=' ')
            else:
                print(num)
        case += 1
        print('')