## CCC '08 S5 - Nukit

View as PDF

Points: 10 (partial)
Time limit: 1.0s
Memory limit: 64M

Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
##### Canadian Computing Competition: 2008 Stage 1, Senior #5

Canada's top two nuclear scientists, Patrick and Roland, have just completed the construction of the world's first nuclear fission reactor. Now it is their job to sit and operate the reactor all day, every day. Naturally they got a little bored after doing this for a while and as a result, two things have happened. First, they can now control the individual reactions that happen inside the reactor. Second, to pass the time, they have invented a new game called Nukit.

At the beginning of Nukit, a number of particles are put in the reactor. The players take alternating turns, with Patrick always going first. When it is a player's turn to move, they must select some of the remaining particles to form one of the possible reactions. Then those particles are destroyed. Eventually there will be so few particles that none of the reactions can be formed; at this point, the first person who is unable to form a reaction on their turn loses.

In our universe you can assume that there are only 4 types of particles: A, B, C, D. Each reaction is a list of particles that can be destroyed on a single turn. The five reactions are:

1. AABDD
2. ABCD
3. CCD
4. BBB
5. AD

For example, the first reaction AABDD says that it is allowable to destroy two A, one B, and two D particles all at the same time on a turn.

It turns out that, no matter how many particles start off in the reactor, exactly one of Patrick or Roland has a perfect winning strategy. By player X has a perfect winning strategy, we mean that no matter what the other player does, player X can always win by carefully choosing reactions. For example, if the reactor starts off with one A, five B, and three D particles then Roland has the following perfect winning strategy: "if Patrick forms reaction BBB initially, then form reaction AD afterward; if Patrick forms reaction AD initially, then form reaction BBB afterward." (The strategy works because either way, on Patrick's second turn, there are not enough particles left to form any reactions.)

Given the number of each type of particle initially in the reactor, can you figure out who has a perfect winning strategy?

#### Input Specification

The first line of input contains , the number of test cases . Each test case consists of 4 integers separated by spaces on a single line; they represent the initial number of A, B, C and D particles. You can assume that there are initially between and (inclusive) of each type of particle.

For test cases worth 75% of points there will initially be between and (inclusive) of each type of particle.

#### Output Specification

For each test case, output the player who has a perfect winning strategy, either Roland or Patrick.

#### Sample Input

6
0 2 0 2
1 3 1 3
1 5 0 3
3 3 3 3
8 8 6 7
8 8 8 8

#### Output for Sample Input

Roland
Patrick
Roland
Roland
Roland
Patrick

#### Partial Explanation for Sample Output

The first output occurs since Patrick loses immediately, since he cannot form any reaction. (Roland's perfect winning strategy is "do nothing.")

The second output occurs since Patrick has the perfect winning strategy "form reaction ABCD," which makes Roland lose on his first turn.

The third output is explained in the problem statement.