题解 | 跳台阶

#include <iostream>
using namespace std;
const int mod = 998244353;
int main() {
    int n;
    cin>>n;
    int dp[n];
    dp[2] = 1 , dp[3] = 2;
    for(int i = 4 ; i <= n ; i++){
        dp[i] = (dp[i-1] + dp[i-2])%mod;   //走一格加走两格的情况
    }
    cout<<dp[n];
    return 0;
}