hdu 4662 找规律

最新推荐文章于 2019-11-15 08:48:19 发布

team79

最新推荐文章于 2019-11-15 08:48:19 发布

阅读量649

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/hzh_0000/article/details/9879831

版权

数论专栏收录该内容

48 篇文章 0 订阅

订阅专栏

找规律......

AC代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;

char s[1000001];

int main(){
	int T, count, flag, length;
	cin >> T;
	while( T-- ){
		cin >> s;
		flag = 0;
		count = 0;
		length = strlen( s );
		if( s[0] != 'M' ){
			cout << "No" << endl;
			continue;
		}
		for( int i = 1; i < length; i++ ){
			if( s[i] == 'M' ){
				flag = 1;
				break;
			}else if( s[i] == 'I' ){
				count++;
			}else{
				count += 3;
			}
		}
		if( flag == 1 || ( count % 2 == 1 && count != 1 ) || count % 6 == 0 ){
			cout << "No" << endl;
		}else{
			cout << "Yes" << endl;
		}
	}
	return 0;
}