PAT 1093 Count PAT's [模拟]

最新推荐文章于 2024-08-02 22:07:04 发布

原创最新推荐文章于 2024-08-02 22:07:04 发布 · 224 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

PAT 专栏收录该内容

100 篇文章

订阅专栏

本文详细解析了如何在给定字符串中统计特定子串'PAT'出现的次数，通过巧妙利用字符位置关系，实现了高效计算。并通过一个示例程序展示了算法的具体实现过程。

The string APPAPT contains two PAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.

Now given any string, you are supposed to tell the number of PAT's contained in the string.

Input Specification:

Each input file contains one test case. For each case, there is only one line giving a string of no more than 105 characters containing only P, A, or T.

Output Specification:

For each test case, print in one line the number of PAT's contained in the string. Since the result may be a huge number, you only have to output the result moded by 1000000007.

Sample Input:

APPAPT

Sample Output:

--------------------------------------这是题目和解题的分割线--------------------------------------

PAT的统计方法是A前面P的个数*Ａ后面Ｔ的个数。比如PATPAT实际上是四个PAT而不是两个。

#include<stdio.h>
const int mod = 1000000007;

int main()
{
	char s;
	int p = 0,a = 0,count = 0;
	while(s!='\n')
	{
		scanf("%c",&s);
		if(s=='P') p++;
		//只有P后面的Ａ才算Ａ +=是为了和下面的叠加模拟Ｐ*Ｔ
		if(s=='A') a += p; 
		//叠加
		if(s=='T') count = (count+a)%mod;		
	}
	printf("%d",count%mod);
}