Magical Planks
Ryan is a boy from a small town, who has been given a task by his father. He has $N$ wooden planks, numbered from $1$ to $N$, which are colored either black or white. His task is to color all planks the same color! But there is some magic in the winds of his small town. Whenever he colors the $i^{th}$ ( plank which has the color $S_i$ ) to a color $P$ then following events happen: - if $2 \
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start