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

#include <stdio.h>

// 计算铺桥的方式数 int calc(int n) { if (n <= 1) { return 1; } int dp[n+1]; dp[0] = dp[1] = 1; for (int i = 2; i <= n; i++) { dp[i] = dp[i-1] + dp[i-2]; } return dp[n]; }

int main() { int m, n; scanf("%d", &m); while (m--) { scanf("%d", &n); printf("%d\n", calc(n/2)); } return 0; }