#include <iostream> using namespace std; // 计算第n天晚上的猪的数量（迭代法，时间复杂度O(n)，空间复杂度O(1)） int countPigs(int n) { if (n == 1) return 1; if (n == 2) return 2; int prev_prev = 1; // f(n-2) int prev = 2; // f(n-1) int current; for (int i = 3; i <= n; ++i) { current = prev + prev_prev; prev_prev = prev; prev = current; } return current; } int main() { int T; cin >> T; // 测试数据个数 while (T--) { int N; cin >> N; cout << countPigs(N) << endl; } return 0; }