Multiplication (Recursive)
PROBLEM:-Given two integers M & N, calculate and return their multiplication using recursion. You can only use subtraction and addition for your calculation. No other operators are allowed.
Line 1 : Integer M
Line 2 : Integer N
M x N
Constraints :
0 <= M <= 1000
0 <= N <= 1000
3
5
Sample Output 1 :
15
4
0
Sample Output 2 :
0
SOLUTION:-
#include <iostream>
using namespace std;
int multiplyNumbers(int m, int n) {
// Write your code here
if(n==0)
return 0;
return m+multiplyNumbers(m,n-1);
}
int main() {
int m, n;
cin >> m >> n;
cout << multiplyNumbers(m, n) << endl;
}