S Semi-palindromic

CodeChefRating 2750Open on judge ↗

A non-negative number is called "*$S$ semi-palindromic*" if it is divisible by $S$ and it is possible to rearrange its digits in such a way that the resulting number is palindromic. If the initial number had $D$ digits (without leading zeroes), consider the number obtained by rearranging to have exactly $D$ digits as well (leading zeroes are allowed). Compute the number of "$S$ semi-palindromic"

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