Arjun and NSA

CodeChefOpen on judge ↗

Arjun is a pro coder at the National Security Agency. The encryption that he has been working on has the following property: the password is between $a$ and $b$ with the probability proportional to the number of numbers between $a$ and $b$ that have at least one repeated digit in their decimal representation. Help Arjun figure out if the encryption is strong enough. Input: You are given $T$ test

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