首页 > 试题广场 >

Count PAT's (25)

[编程题]Count PAT's (25)
  • 热度指数：2964 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 32M，其他语言64M
  • 算法知识视频讲解
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.

输入描述:
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.


输出描述:
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.
示例1

输入

APPAPT

输出

2
算法知识视频讲解
添加回答

这道题你会答吗？花几分钟告诉大家答案吧！

提交观点

问题信息

字符串
难度：
0条回答 7565浏览

热门推荐

通过挑战的用户

相关试题

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号