CODE2

CodeChefOpen on judge ↗

Sum of all N-digit palindromic numbers which does not contains 0 and are divisible by 9. ### Input Give a number as a input which is greater than 0. ### Output Output , must be an integer. ### Constraints 1.) N should be positive. 2.) Output should also be positive. ### Subtasks - 70 points : Take a function which return this sum and take N as argument - 30 points : There shpuld be no other c

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