习题-I love you(寻找子序列模板/DP)

习题-I love you

#include <bits/stdc++.h>
using namespace std;
int dp[10];
#define mod 20010905
    

signed main(){
    string s; cin >> s;
    string p = " iloveyou";
    dp[0] = 1;
    for(int i = 0; i < s.size(); ++i){
        s[i] = towlower(s[i]);
        for(int j = 1; j <= 8; ++j){
            if(s[i] == p[j])
                dp[j] = (dp[j] + dp[j-1]) % mod;
        }
    }
    
    cout << dp[8] % mod << endl;
    
    return 0;
}