I love you

原创

whiteawll 2022-08-16 14:42:42 博主文章分类：练习题目 ©著作权

文章标签 动态规划哈希算法 c++ #define git 文章分类 后端开发

©著作权归作者所有：来自51CTO博客作者whiteawll的原创作品，请联系作者获取转载授权，否则将追究法律责任

// Problem: I love you
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1013
// Memory Limit: 262144 MB
// Time Limit: 2000 ms
// 2022-03-16 14:00:28
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1) ans = ans * a%mod;
        a = a * a %mod;
        b >>= 1;
    }
    return ans;
}
inline int read () {
    int x = 0, f = 0;
    char ch = getchar();
    while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
    while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return f?-x:x;
}
template<typename T> void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x >= 10) print(x/10);
    putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
    return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
    return (a + b) %mod;
}
inline ll inv (ll a) {
    return qmi(a, mod - 2);
}
const int p = 20010905;
void solve() {
    string s;
    cin >> s;
    int n  =s.size();
    s=  " " + s;
    int dp[100006]= {0};
    dp[0] = 1;
    string t ="iloveyou";
    for (int i =1; i<= n; i ++) {
        char x = tolower(s[i]);
        if (x == 'i')
            {
                dp[1] ++;
            }
         if (x == 'l') {
             dp[2] = (dp[2] + dp[1])%p;
         }
         if (x == 'o') {
             dp[3] = (dp[2] + dp[3])%p;
         }
        if (x == 'v') {
            dp[4] = (dp[4] + dp[3])%p;
        }
        if( x == 'e') {
            dp[5]= (dp[4] + dp[5])%p;
        }
        if (x == 'y') {
            dp[6] = (dp[6] + dp[5]) %p;
        }
        if (x== 'o') {
            dp[7] = (dp[7] + dp[6])%p;
        }
        if (x == 'u') {
            dp[8] = (dp[8] + dp[7])%p;
        }
    }
    cout << dp[8] << endl;
}
int main () {
    // ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}