递归求n的k次方

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> int Second(int n,int k) { /*int sum = 1; for (int i = 1; i <= k; ++i) { sum *= n; } return sum;*/ if (k == 1) { return

>>阅读原文<<