Obsession with 7

CodeChefOpen on judge ↗

Rishabh gives you a number $N$ and challenges you to check the divisibility of, all the numbers formed from permutations of digits of $N,$ by 7. For ex. permutations of 103 will be 103, 130, 13, 31, 310, and 301. Print the number of distinct permutations of $N$ that are divisible by 7. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each tes

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