SUPyF Exam Preparation 1 - 02. Array Manipulator

"""
Basics OOP Principles
Check your solution: https://judge.softuni.bg/Contests/Practice/Index/967#1

SUPyF Exam Preparation 1 - 02. Array Manipulator

Problem:
Trifon has finally become a junior developer and has received his first task.
It’s about manipulating an array of integers. He is not quite happy about it, since he hates manipulating arrays.
They are going to pay him a lot of money, though,
and he is willing to give somebody half of it if to help him do his job.
You, on the other hand, love arrays (and money) so you decide to try your luck.
The array may be manipulated by one of the following commands
• exchange {index} – splits the array after the given index, and exchanges the places of the two resulting sub-arrays.
E.g. [1, 2, 3, 4, 5] -> exchange 2 -> result: [4, 5, 1, 2, 3]
o   If the index is outside the boundaries of the array, print “Invalid index”
• max even/odd– returns the INDEX of the max even/odd element -> [1, 4, 8, 2, 3] -> max odd -> print 4
• min even/odd – returns the INDEX of the min even/odd element -> [1, 4, 8, 2, 3] -> min even > print 3
o   If there are two or more equal min/max elements, return the index of the rightmost one
o   If a min/max even/odd element cannot be found, print “No matches”
• first {count} even/odd– returns the first {count} elements -> [1, 8, 2, 3] -> first 2 even -> print [8, 2]
• last {count} even/odd – returns the last {count} elements -> [1, 8, 2, 3] -> last 2 odd -> print [1, 3]
o   If the count is greater than the array length, print “Invalid count”
o   If there are not enough elements to satisfy the count, print as many as you can.
If there are zero even/odd elements, print an empty array “[]”
• end – stop taking input and print the final state of the array
Input
• The input data should be read from the console.
• On the first line, the initial array is received as a line of integers, separated by a single space
• On the next lines, until the command “end” is received, you will receive the array manipulation commands
• The input data will always be valid and in the format described. There is no need to check it explicitly.
Output
• The output should be printed on the console.
• On a separate line, print the output of the corresponding command
• On the last line, print the final array in square brackets with its elements separated by a comma and a space
• See the examples below to get a better understanding of your task
Constraints
• The number of input lines will be in the range [2 … 50].
• The array elements will be integers in the range [0 … 1000].
• The number of elements will be in the range [1 .. 50]
• The split index will be an integer in the range [-231 … 231 – 1]
• first/last count will be an integer in the range [1 … 231 – 1]
• There will not be redundant whitespace anywhere in the input
• Allowed working time for your program: 0.1 seconds. Allowed memory: 16 MB.

Examples
Input:
1 3 5 7 9
exchange 1
max odd
min even
first 2 odd
last 2 even
exchange 3
end
Output:
2
No matches
[5, 7]
[]
[3, 5, 7, 9, 1]

Input:
2
No matches
[5, 7]
[]
[3, 5, 7, 9, 1]
Output:
3
Invalid count
Invalid index
0
2
0
[10, 100, 1000, 1]

Input:
1 10 100 1000
exchange 3
first 2 odd
last 4 odd
end

Output:
[1]
[1]
[1, 10, 100, 1000]
"""

import sys
the_list = [int(item) for item in input().split()]

while True:
    command = input().split()
    if command[0] == "end":
        break

    elif command[0] == "exchange":
        index_to_exchange = int(command[1])
        if len(the_list) > index_to_exchange >= 0:
            the_list = the_list[index_to_exchange + 1:] + the_list[:index_to_exchange + 1]
        else:
            print("Invalid index")

    elif command[0] == "max":
        max_number = -sys.maxsize - 1
        index_of_number = -1
        if command[1] == "even":
            for number in range(len(the_list)):
                if the_list[number] % 2 == 0 and the_list[number] >= max_number:
                    max_number = the_list[number]
                    index_of_number = number
        elif command[1] == "odd":
            for number in range(len(the_list)):
                if the_list[number] % 2 != 0 and the_list[number] >= max_number:
                    max_number = the_list[number]
                    index_of_number = number
        if index_of_number == -1:
            print("no matches")
        else:
            print(index_of_number)

    elif command[0] == "min":
        min_number = sys.maxsize
        index_of_number = -1
        if command[1] == "even":
            for number in range(len(the_list)):
                if the_list[number] % 2 == 0 and the_list[number] <= min_number:
                    min_number = the_list[number]
                    index_of_number = number
        elif command[1] == "odd":
            for number in range(len(the_list)):
                if the_list[number] % 2 != 0 and the_list[number] <= min_number:
                    min_number = the_list[number]
                    index_of_number = number
        if index_of_number == -1:
            print("No matches")
        else:
            print(index_of_number)

    elif command[0] == "first":
        count_numbers = int(command[1])
        if count_numbers > len(the_list):
            print("Invalid count")
            continue
        if command[2] == "even":
            print([item for item in the_list if item % 2 == 0][:count_numbers])
        elif command[2] == "odd":
            print([item for item in the_list if item % 2 != 0][:count_numbers])

    elif command[0] == "last":
        count_numbers = int(command[1])
        if count_numbers > len(the_list):
            print("Invalid count")
            continue
        if command[2] == "even":
            print([item for item in the_list if item % 2 == 0][-count_numbers:])
        elif command[2] == "odd":
            print([item for item in the_list if item % 2 != 0][-count_numbers:])

print(the_list)