Strings-Substrings

CodeChefOpen on judge ↗

Given two strings S,X write a program to find sum of all sub-strings of S that satisfy following conditions: A) The sub-strig must not begin with digit ‘0’. B) And the numeric value that the substring represents must be greater than value of X. Constraints: 1.Input string has only digits 2.Value of X is always less than that of S. ### Input First line of input has S. Second line of input ha

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