I Love Squares

CodeChefOpen on judge ↗

**If you think too much you won't be able to solve this question...** * 57 => 2 * 0158 => 6 * 89 => 3 ###Input: - Each input contains a string $S$ containing digits(0-9). ###Output: For each input, output in a single line answer to the problem. ###Constraints - $1 \leq length of string S \leq |20|$ ###Subtask * 30 points excluding corner cases * 70 orignal constrain

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