SPOJ.com - Problem COLONY

COLONY - Linearian Colony

no tags

Description

Linearians are peculiar creatures. They are odd in several ways:

Every Linearian is either red or blue.
A Linearian colony is a straight line, aligned N-S with the magnetic field.
A colony starts with single red Linearian.
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 < 2^Y).

Output

The color of the Linearian, either red or blue.

Input	Input
3 6	51 123456789012345
Output	Output
blue	red

Submit solution!

hide comments

< Previous 1 2 3 4 Next >

	VIVEK GARG: 2015-02-18 14:57:09 Just manipulate with the indices correctly.
	devil: 2014-12-13 21:30:37 i keep getting WA...although my code is perfectly fine i hav checked it for all critical cases like 0 0, 51 2^51-1,51 2^51-3,etc
	.::Austin::.: 2014-11-14 09:16:34 using the logic similar to Indian Connection, giving WA here :(
	Nishanth Vijayan: 2014-09-18 14:36:04 DCEPC504 similar question.
	L: 2014-07-23 09:41:10 gud One........
	rajul: 2014-07-21 13:31:06 really easy.. just read the ques carefully.. silly mistake costed 2 WA
	Piyush Raman Srivastava: 2014-01-23 21:05:34 0 index not 1 !!
	ABHISHEK004: 2013-12-30 11:51:51 have fun while doing this prob... :) easy one..
	Mitch Schwartz: 2013-12-20 08:24:45 @thedarkone: Your original request is strange to me as (1) I don't consider this problem to have any corner cases, (2) knowing a specific input and its output is not likely to give any insight here, and (3) it would be a huge spoiler to be given ~1/8 of the actual test data that is being used for this problem. Also, "random small inputs" is not very convincing, since you can test a LOT of small inputs iteratively (in an exhaustive manner), you do not need to use randomness for those. Maybe you tested a lot of small cases, but you did not state that clearly. Asking for such debugging help seems to me more suited for the forum (link on the left side menu). Be sure to read the posts "Read this before posting!" by TripleM and "PLEASE USE CODE TAGS" by leppy. Last edit: 2013-12-20 09:06:46
	thedarkone: 2013-12-19 21:47:32 Ok thanks for the info Though the problem is that, I am getting correct answer for the test cases and for random small inputs. However its not possible to check for large inputs. Therefore any help would be appreciated. Submission ID: 10698421

Submit solution!

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