Carry count
CodeChefOpen on judge ↗
In primary classes, we were taught how to add multi-digit numbers from right-to-left one digit at a time. Many of us found the carry operation - in which a 1 is carried from one digit position to be added to the next - to be a significant challenge at that point of time. (You may find it challenging yet again if you can't solve this D:) Your task is to count the number of carry operations required
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.
Sign in to chat with the tutor and save your progress.
Sign in to start