#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1000000007;
char s[100010];
int numP[100010];
int main()
{
scanf("%s",s);
int len=strlen(s);
int ans=0,numT=0;
for (int i=0;i<len;i++)
{
if (i!=0)
{
numP[i]=numP[i-1];
}
if (s[i]=='P')
{
numP[i]++;
}
}
for (int i=len-1;i>=0;i--)
{
if (s[i]=='T')
{
numT++;
}
else if(s[i]=='A')
{
ans=(ans+numT*numP[i])%maxn;
}
}
printf("%d",ans);
}
A1093 Count PATs (25)
最新推荐文章于 2020-07-03 21:32:26 发布