Alomerry Wu @ alomerry.com

1093 Count PAT's

Jun 12, 2018 · 1min · 204 ·

Problem

Source: PAT 1093{target="_blank"}

Description

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 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

Solution

Code

#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;
}
 
 comment..
你认为这篇文章怎么样?
  • 0
  • 0
  • 0
  • 0
  • 0
  • 0
  • 0
评论
  • 按正序
  • 按倒序
  • 按热度
Powered by Waline v3.0.1
Theme by antfu
2018 - Present © Alomerry Wu