## CCC '11 S3 - Alice Through the Looking Glass

View as PDF

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

Problem type
##### Canadian Computing Competition: 2011 Stage 1, Senior #3

Alice is looking at a crystal through a microscope. Alice's microscope has the interesting feature that it can superimpose grid lines over the image that she is looking at.

At level 1 of magnification, Alice sees the image as follows:

Notice that at level 1, there is a grid superimposed over the image.

However, as Alice increases the magnification, the leaf pattern becomes more intricate.

At level 2 of the magnification, Alice sees the image with a grid, and notices that three of the four larger squares in the original image have the small four square pattern on top. In fact, for this particular crystal, this self-similarity repeats for each magnification level.

Given that Alice's microscope has up to 13 levels of magnification, she would like to try to quantify the detail of each grid cell at every one of these magnification levels.

Specifically, since there is a grid at magnification level , Alice will call the bottom-left corner grid cell , the bottom-right grid cell , the top-left grid cell , and the top-right grid cell .

Given an integer magnification level () and a grid position (where and ), Alice would like to know if her crystal will fill that grid cell, or if that grid cell will be empty space.

#### Input Specification

The first line of input will be () which is the number of test cases. On each of the next lines there will be three integers: , the magnification level, followed by and , the position of the grid cell that Alice wishes to examine.

#### Output Specification

The output will be lines. Each line of output will either be empty, if the specified grid cell is empty, or crystal if that grid cell contains crystal.

#### Sample Input

4
1 1 1
1 1 0
1 2 1
2 8 5

#### Output for Sample Input

empty
crystal
crystal
crystal

Note: At least 40% of the test cases will have .

• commented on March 19, 2020, 11:22 p.m. edited

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on Oct. 30, 2021, 2:58 p.m.

it means you need to use recursion mate.

• commented on Oct. 15, 2021, 3:36 p.m. edited

Because you can use Recursion to solve it.

• commented on June 18, 2019, 6:46 p.m.

For m = 3, does the pattern recurse onto all of the non-encompassed squares on the top or only on the three local maximum squares?

• commented on Oct. 30, 2021, 2:56 p.m.

Only on top of the three local maximum squares. If you don't implement that right, test 5 won't work.