Multiplication using Recursion

CodeChefOpen on judge ↗

Write a recursive function for multiply(a, b), where a and b are both positive integers, but you can only use the + or - operators to get your result. ###Input: - Each testcase contain two lines of input, two integers. ###Output: For each testcase, output in a single line answer is the sum of two integers. ###Constraints: Use Recursive function for multiplication of integers. ##

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