C. Constanze’s Machine:题目
众所周知,斐波那契数列属于dp
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c((int)6e5);
const int mod = 1e9 + 7;
map<int, int> mp1, mp2;
string str;
signed main()
{a[0] = a[1] = 1;a[2] = 2;a[3] = 3;for (int i = 4; i <= (int)1e5; i++)a[i] = (a[i - 1] + a[i - 2]) % mod;cin >> str;int n = str.length();str = "1" + str;int res = 1, ff = 1, cou = 0;for (int i = 1; i <= n; i++){if (str[i] != str[i - 1])res = (res * a[cou]) % mod, cou = 0;if (str[i] == 'm' || str[i] == 'w')ff = 0;else if (str[i] == 'u')cou++;else if (str[i] == 'n')cou++;}res = (res * a[cou]) % mod;if (ff) cout << res << endl;else cout<<0<<endl;
}