一、题目
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:
2
二、题目大意
给定string,判断可以组成PAT的个数。
三、考点
逻辑
四、注意
1、对A进行处理,左边的P的个数*右边的T的个数。
五、代码
#include<iostream>
#include<string>
#define N 1000000007
using namespace std;
int main() {
//read
string s;
cin >> s;
//solve
long long int nt = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'T')
nt++;
}
long long int np = 0, sum = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'P')
np++;
else if (s[i] == 'A')
sum += np * nt;
else if (s[i] == 'T')
nt--;
}
//output
cout << sum%N << endl;
system("pause");
return 0;
}