ABCD  Colours A, B, C, D
Consider a table with 2 rows and 2N columns (a total of 4N cells). Each cell of the first row is coloured by one of the colours A, B, C, D such that there are no two adjacent cells of the same colour. You have to colour the second row using colours A, B, C, D such that:
• There are exactly N cells of each colour (A, B, C and D) in the table.
• There are no two adjacent cells of the same colour. (Adjacent cells share a vertical or a horizontal side.)
It is guaranteed that the solution, not necessarily unique, will always exist.
Input
[a natural number N ≤ 50000]
[a string of 2N letters from the set {A, B, C, D}, representing the first row of the table]
Output
[a string of 2N letters from the set {A, B, C, D}, representing the second row of the table]
Example
Input
1
CB
Output
AD
Input
2
ABAD
Output
BCDC
hide comments
poojan :
20160309 14:36:18
2 WA ans But Finally Got It Awsome Que! One wa bcs Not terminate string '\0':


enigmus:
20160224 15:19:52
Hint: Try building up your solution from smaller pieces 

Ankit:
20160218 17:23:42
My program runs for a O(n) but still it gives Time Limit Exceeded. Stuck badly. !! 

Ankit:
20160217 13:13:54
TLE after 18. The numbers in the bracket, any idea what it means ?


minhthai:
20160115 12:53:12
try to think super simply :) 

naruto09:
20151216 20:15:07
WA at 18th test case...can anyone help please..? 

darkhire21:
20151018 11:00:37
read carefully statement 1 ..!!!! 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20150802 04:25:08
Finally AC, it's hard to think the solution but very easy to implement :) 

Shubhransh Srivastav:
20150709 17:10:53
wa on running judge 18.... don't know why :( Last edit: 20150713 19:30:43 

Diksha Jaiswal:
20150604 07:37:37
tle with backtracking :( 
Added by:  Adrian Satja Kurdija 
Date:  20110313 
Time limit:  0.190s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  inspired by a math puzzle 