斐波那契数列取模 - C++ 实现

{"title":"斐波那契数列取模 - C++ 实现","description":"本代码使用 C++ 实现斐波那契数列，并计算第 n 个斐波那契数对 1000 取模的结果。代码简洁易懂，并提供详细的用例和说明。","keywords":"斐波那契数列, 斐波那契, 算法, C++, 取模, 代码, 编程, 例子, 讲解","content":""c++\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint fibonacci(int n) {\n vector<int> fib(n + 1);\n fib[0] = 0;\n fib[1] = 1;\n for (int i = 2; i <= n; i++) {\n fib[i] = (fib[i - 1] + fib[i - 2]) % 1000;\n }\n return fib[n];\n}\n\nint main() {\n int n;\n cin >> n;\n while (n--) {\n int a;\n cin >> a;\n cout << fibonacci(a) << endl;\n }\n return 0;\n}\n"}