1093. Count PAT's (25)【计数】——PAT (Advanced Level) Practise

版权声明：本文为博主原创文章，转载请标明出处 http://blog.csdn.net/xianyun2009 https://blog.csdn.net/xianyun2009/article/details/51407799

题目信息

1093. Count PAT’s (25)

时间限制120 ms
内存限制65536 kB
代码长度限制16000 B
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 10^5 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:
2

解题思路

统计

AC代码

#include <cstdio>
#define MOD 1000000007
int ch;
int p, a, t, c;
int main()
{
    long long cnt = 0;
    while ((ch = getchar()) && ch != '\n'){
        if (ch == 'P') {
            ++p;
        }else if (ch == 'A') {
            c += p;
        }else if (ch == 'T') {
            ++t;
            cnt = (cnt + c)%MOD;
        }
    }
    printf("%lld", cnt);
    return 0;
}