C语言编程：计算铺桥方案数

#include <stdio.h>

int main() { int m, n, ans; scanf("%d", &m); while (m--) { scanf("%d", &n); if (n == 0) ans = 0; else if (n == 1) ans = 1; else if (n == 2) ans = 2; else { int dp[n+1]; dp[0] = dp[1] = 1; dp[2] = 2; for (int i = 3; i <= n; i++) { dp[i] = dp[i-1] + dp[i-2]; } ans = dp[n]; } printf("%d\n", ans); } return 0; }