C++高精度算法：求解1!+2!+3!+…+n!（n<=50）

```cpp #include <iostream> #include <vector> #include <algorithm> using namespace std; // 高精度乘法 vector<int> multiply(vector<int> num, int x) { int carry = 0; for (int i = 0; i < num.size(); i++) { int prod = num[i] * x + carry; num[i] = prod % 10; carry = prod / 10; } while (carry) { num.push_back(carry % 10); carry /= 10; } return num; } // 高精度加法 vector<int> add(vector<int> num1, vector<int> num2) { vector<int> result; int carry = 0; int i = 0, j = 0; while (i < num1.size() || j < num2.size() || carry) { int sum = carry; if (i < num1.size()) sum += num1[i++]; if (j < num2.size()) sum += num2[j++]; result.push_back(sum % 10); carry = sum / 10; } return result; } // 输出高精度数 void print(vector<int> num) { for (int i = num.size() - 1; i >= 0; i--) { cout << num[i]; } cout << endl; } int main() { int n; cin >> n; vector<int> factorial(1, 1); vector<int> sum(1, 0); for (int i = 1; i <= n; i++) { factorial = multiply(factorial, i); sum = add(sum, factorial); } print(sum); return 0; } ``` ######[AI问答 | 439点数解答 | 2025-09-26 19:33:39]