FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpp/F20RecursionAssignment/MultiplicationRecursive.cpp at main · roydevashish/cpp · GitHub
roydevashish
/
cpp
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpp
/
F20RecursionAssignment
/
MultiplicationRecursive.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
50 lines (38 loc) · 761 Bytes
Breadcrumbs
cpp
/
F20RecursionAssignment
/
MultiplicationRecursive.cpp
Copy path
File metadata and controls
50 lines (38 loc) · 761 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
Title: Multiplication(Recursive)
Problem statement
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.
Detailed explanation ( Input/output format, Notes, Images )
Input format :
Line 1 : Integer M
Line 2 : Integer N
Output format :
M x N
Constraints :
0 <= M <= 1000
0 <= N <= 1000
Sample Input 1 :
3
5
Sample Output 1 :
15
Sample Input 2 :
4
0
Sample Output 2 :
0
*/
#
include
<
iostream
>
using
namespace
std
;
int
MultiplyNumbers
(
int
m,
int
n) {
if
(n ==
0
) {
return
0
;
}
return
MultiplyNumbers
(m, n-
1
) + m;
}
int
main
() {
int
m, n;
cin >> m >> n;
cout <<
MultiplyNumbers
(m, n) << endl;
}
Back
|
FazBrowse Home
|
New Git URL