26 Jun Tuesday Python Homework 18:30 – 22.06.21.
Stuart the Minion was kidnapped!!
he miss his friends minions very much and is very scare now. You can’t image how dark the room he was put into is, so poor :(.
As a smart Minions, you want to get Stuart out of the monster’s labyrinth(maze). But when you arrive at the gate of the maze, the monster say :” I have heard that you are very clever, but if can’t solve my problems, you will die with Stuart.”
The problems of the monster is shown on the wall:
Each problem’s first line is a integer N(the number of commands), and a word “FIFO” or “FILO”. (you are very happy because you know “FIFO” stands for “First In First Out”, and “FILO” means “First In Last Out”). and the following N lines, each line is “IN M” or “OUT”, (M represent a integer). and the answer of a problem is a password of a door, so if you want to rescue Stuart, answer the problem carefully!
The input contains multiple test cases.
The first line has one integer, represent the number of test cases. And the input of each subproblem are described above.
For each command “OUT”, you should output a integer depend on the word is “FIFO” or “FILO”, or a word “None” if you don’t have any integer.
Sample Input 4 4 FIFO IN 1 IN 2 OUT OUT 4 FILO IN 1 IN 2 OUT OUT 5 FIFO IN 1 IN 2 OUT OUT OUT 5 FILO IN 1 IN 2 OUT IN 3 OUT Sample Output 1 2 2 1 1 2 None 2 3
Sorry, the comment form is closed at this time.