Ten Crore Package

CodeChefOpen on judge ↗

Given 2 numbers $X, Y$. You can perform the following operation multiple times on these two numbers. Operation: Select a digit from the number, and remove it such that the resulting number is either 0, or does not starts with 0. Find number of possible distinct tuples $(XX, YY)$ that can be formed using the given operation on these numbers such that their BITWISE XOR is 0. Input Format: A singl

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