摘要:
https://pintia.cn/problem-sets/12/problems/356 1 int f(int n) 2 { 3 int ret; 4 5 if (n == 0) 6 { 7 ret = 0; 8 } 9 else if (n == 1) 10 { 11 ret = 1; 12 阅读全文
摘要:
https://pintia.cn/problem-sets/12/problems/355 1 int Ack(int m, int n) 2 { 3 int ret; 4 5 if (m == 0) 6 { 7 ret = n + 1; 8 } 9 else if (n == 0 && m > 阅读全文
摘要:
https://pintia.cn/problem-sets/12/problems/353 1 double calc_pow(double x, int n) 2 { 3 double ret; 4 5 if (n == 0) 6 { 7 ret = 1; 8 } 9 else 10 { 11 阅读全文
摘要:
https://pintia.cn/problem-sets/12/problems/352 1 double fact(int n) 2 { 3 double product; 4 if (n == 0) 5 { 6 product = 1; 7 } 8 else 9 { 10 product = 阅读全文
摘要:
https://pintia.cn/problem-sets/12/problems/351 1 int search(int n) 2 { 3 int count = 0; 4 int num_sqrt; //平方根的整数部分 5 int single, ten, hundred; 6 for ( 阅读全文