COLONY - Linearian Colony

no tags 

Description

Linearians are peculiar creatures. They are odd in several ways:
  1. Every Linearian is either red or blue.
  2. A Linearian colony is a straight line, aligned N-S with the magnetic field.
  3. A colony starts with single red Linearian.
  4. Every year, each Linearian produces an offspring of the opposite color. After birth, the parent moves just south of the offspring. (Since everyone is born at once, this does make for a lot of jostling, but everyone stays in order.)
So a colony grows as follows:
N ----------- S

Year 0: R
Year 1: BR
Year 2: RBBR
Year 3: BRRBRBBR
Year 4: RBBRBRRBBRRBRBBR
Given a year and a position along the N-S axis, determine what the color of the Linearian there will be.

Input

The first line is the year Y (0 ≤ Y ≤ 51). The second line is the position P from north to south, 0-indexed (0 ≤ P < 2Y).

Output

The color of the Linearian, either red or blue.
Input Input
3
6
51
123456789012345
Output Output
blue
red

hide comments
BLANKRK: 2013-10-29 15:15:39

that ws realy silly mistake... this ezy one cost me 3 WA...

Akhilesh Anandh: 2013-10-29 14:22:24

Please tell me why I'm getting WA. Submission id 10375706
Edit: Found my mistake

Last edit: 2013-10-29 14:31:37
Ouditchya Sinha: 2013-10-26 15:54:05

Piece of Cake... :)

tuhin: 2013-10-26 10:50:04

defintely not a tutorial problem

Mahesh Mishra: 2013-10-26 07:31:29

Note that indexing is from zero not one..

Mitch Schwartz: 2013-10-25 00:40:28

Moved to classical, but it would have been better to include many test cases per input file.


Added by:BYU Admin
Date:2013-10-18
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET