题解 | #吃糖果#
吃糖果
https://www.nowcoder.com/practice/72015680c32b449899e81f1470836097
#include <iostream> using namespace std; const int maxn=21; int m[maxn]; int main() { m[1]=1; m[2]=2; for(int i=3;i<maxn;i++){ m[i]=m[i-1]+m[i-2]; } int n; while(cin>>n) cout<<m[n]; }