#210. powerN
powerN
Background
Description
Given base and n that are both 1 or more, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3 squared).
Format
Input
Output
Samples
3 1
3
3 2
9
3 3
27
Limitation
1s, 1024KiB for each test case.