SLM小朋友背单词方案数 - C++实现
#include
int main() { int n; cin >> n; int dp[81] = {0}; dp[0] = 1; dp[1] = 1; dp[2] = 2; for (int i = 3; i <= n; i++) { dp[i] = dp[i-1] + dp[i-2]; } cout << dp[n] << endl; return 0; }
原文地址: https://www.cveoy.top/t/topic/p6pL 著作权归作者所有。请勿转载和采集!