Parting Nums

CodeChefOpen on judge ↗

You are given an $N$-digit number $X$ (without leading zeroes) Along with that a positive integer $K$ is given. Find the number of ways to cut $X$ into two integers (non-empty) such that both of them are divisibly by $K$. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each testcase contains integer $K$. - Next line of conta

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