codeforces Codeforces Round #597 (Div. 2) Constanze's Machine 斐波拉契数列的应用

#include<bits/stdc++.h>
using namespace std;
char s[];
int dp[];
const int MOD = 1e9+;
int main() {
    dp[] = ;
    scanf("%s", s+);
    int N = strlen(s+);
    for(int i=; i<=N; ++i) {
 
        if(s[i] == 'm' || s[i] == 'w') {
            puts("");
            return ;
        }
 
        dp[i] = dp[i-];
        if(i!=&&(s[i] == 'n'&&s[i-]=='n' || s[i]=='u'&&s[i-]=='u'))
            dp[i] = (dp[i-]+dp[i-])%MOD;
    }
    printf("%d\n", dp[N]);
}
//斐波拉契数列应用