ACM协会双十一新生赛——CodeForces - 1245C

• 题目链接

• 要点
  1.连续x个n/u的组合方法数n为斐波那契数列的项，即
  n == F（x + 1）
  2.取模运算
  a * b % n == （a % n） * (b % n) % n

• 代码

#include<stdio.h>

char w[100001];
unsigned long long f[1000000] = { 1 , 2 };


int main() {
	unsigned long long sum = 1;
	int num = 0, noru;
	for (int i = 2; i < 1000000; i++)
	{
		f[i] = (f[i - 1] + f[i - 2]) % 1000000007;
		//printf("%llu\n", f[i]);
	}
	while (scanf("%c", &w[num]) != EOF)
		num++;
	//printf("%s", f);
	for (int x = 0; x < num; x++)
	{
		noru = 0;
		if (w[x] == 'm' || w[x] == 'w')
		{
			puts("0");
			return 0;
		}
		if (w[x] == 'n')
		{
			while (x + 1 < num && w[x + 1] == 'n')
			{
				noru++;
				x++;
			}
			sum *= f[noru];
			sum %= 1000000007;
		}
		else if (w[x] == 'u')
		{
			while (x + 1 < num && w[x + 1] == 'u')
			{
				noru++;
				x++;
			}
			sum *= f[noru];
			sum %= 1000000007;
		}
	}
	printf("%llu", sum % 1000000007);
	return 0;
}