题目描述
代码实现
#include<map>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<set>
#include<vector>
#include<numeric>
using namespace std;
const long long mod = 20010905;
string s = "iloveyou";
int main()
{
long long dp[10];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
string str;
cin >> str;
for (int i = 0; i < str.size(); i++)
{
str[i] = tolower(str[i]);
for (int j = 0; j < 8; j++)
{
if (str[i] == s[j])
dp[j + 1] = (dp[j] + dp[j + 1]) % mod;
}
}
cout << dp[8] << endl;
}