PAT 1093. Count PAT's (25)
2015-09-10 20:07
274 查看
1093. Count PAT's (25)
时间限制120 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CAO, Peng
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
这道题有个坑,一开始以为最后算出结果取余就可以了,然后最后两个case过不了。后来发现是计算过程中就要取余。。不然可能会溢出。。代码如下:
#include <iostream> #include <string> using namespace std; int main(void) { string raw; int p=0,pa=0,pat=0; cin>>raw; for(int i=0;i<raw.size();i++) { if(raw[i]=='P') p++; else if(raw[i]=='A') pa+=p; else pat+=pa; pat%=1000000007; } cout<<pat; }
相关文章推荐
- poj2236 Wireless Network
- HTML中id、name、class 区别
- C语言之双向链表之操作
- 文章标题
- 《who am i》-linux命令五分钟系列之十六
- 《man男人》-linux命令五分钟系列之十五
- 字符串类
- Android 获取手机号码归属地
- OpenCV_基于混合高斯模型GMM的运动目标检测
- 《mount的艺术》-linux命令五分钟系列之十四
- HDU 2460 Network(Tarjan求解桥+LCA)
- Android系统在超级终端下必会的命令大全(adb shell命令大全)
- 转 一个简单实用的 生成验证码的 代码
- Django 更新字段
- 最适合程序员编程的10款字体
- 《玩转shutdown》-linux命令五分钟系列之十三
- LeetCode----Remove Element
- C++ 标准库和标准模板库
- C语言之循环链表
- vc6.0快捷键汇总