Upgrade to Pro
Courses
Practice Compete Compiler

March 2012 Cook-off Problem Editorials

Problem Setter for the contest was Hiroto Sekido.

Problem Tester for the contest was Rajiv Kumar Aggarwal.

----------------------------------------------------------

CIELGAME : Ciel and Genjiko

Editorial

----------------------------------------------------------

CIELLAND : Ciel and a new island

Editorial

----------------------------------------------------------

CIELNUM1 : Ciel Numbers I

Editorial

----------------------------------------------------------

CIELNUM2 : Ciel Numbers II

Editorial

----------------------------------------------------------

CIELWEB : Ciel and Communications System

Editorial

----------------------------------------------------------

@singh_637 : Please try

1★rajiv_adm @ 19 Mar 2012 11:29 PM
@singh_637 : Please try running your solution on sample test case.

@withoutc: Here I consider a

1★rajiv_adm @ 19 Mar 2012 11:53 PM
@withoutc: Here I consider a base 4 no. I considered decimal representation which contains only one of these 4 digits: 0, 3, 5 and 8. If It contains any other no., then it is not ciel no. I considered 0(base 4) = 0(base 10) 1(base 4) = 3(base 10) 2(base 4) = 5(base 10) 3(base 4) = 8(base 10) If there are zero in between, then it is not ciel no. Now question arise, Why use 0? Why not use base 3? If I would have used base 3 by replacing 3(base 10) = 0(base 3) then then 3, 33, 333, 3333, .... all become 0. This solution could have been further optimized to base 3. But base 4 was good enough to be solved within time limit.