提交时间:2026-10-24 20:18:28

运行 ID: 93648

#include <iostream> using namespace std; int main() { int n, k; int a[1000001]; int mod = 32767; cin >> n; while (n--) { cin >> k; a[1] = 1; a[2] = 2; for (int i = 3; i <= k; i++) { a[i] = (2 * a[i - 1] + a[i - 2]) % mod; } cout << a[k] << endl; } return 0; }