回答編集履歴
1
微修正
answer
CHANGED
|
@@ -8,7 +8,7 @@
|
|
|
8
8
|
// power: x^n
|
|
9
9
|
double p(double x, int n) { return n == 0 ? 1.0 : x * p(x, n-1); }
|
|
10
10
|
|
|
11
|
-
// maclaurin-
|
|
11
|
+
// maclaurin-expansion : Σ(x^k)/k! where k = 0, 1, 2 ... n
|
|
12
12
|
double m(double x, int n) { return n == 0 ? 1.0 : m(x, n-1) + p(x, n)/f(n); }
|
|
13
13
|
|
|
14
14
|
int main() {
|