Fake Swaps

CodeChefRating 1695Open on judge ↗

### Read problems statements in [Russian](https://www.codechef.com/download/translated/COOK133/russian/FAKESWAP.pdf) and [Bengali](https://www.codechef.com/download/translated/COOK133/bengali/FAKESWAP.pdf). You are given two binary strings $S$ and $P$. You need to convert $S$ into $P$ using the following operation any number of times (possibly zero): - Pick three binary values $X$, $Y$, and $Z$,

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.

voice by Sarvam AI