| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 148792 | 杨润东 | 小明养猪的故事 | C++ | Wrong Answer | 0 MS | 276 KB | 624 | 2026-02-28 19:50:31 |
#include <iostream> #include <vector> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { int N; cin >> N; vector<long long> pig(N + 1, 0); vector<long long> alive(N + 1, 0); if (N >= 1) { pig[1] = 1; alive[1] = 1; } for (int day = 2; day <= N; day++) { pig[day] = alive[day - 1] - pig[day - 1]; long long killed = pig[day - 2]; alive[day] = alive[day - 1] + pig[day] - killed; } cout << alive[N] << endl; } return 0; }
------Input------
17 1 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
------Answer-----
1 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765
------Your output-----
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1