PAT a1093题解
来源:互联网 发布:vmware for ubuntu 64 编辑:程序博客网 时间:2024/06/08 07:46
#include <cstdio>#include <cstring>const int MAXN = 100010;const int MOD = 1000000007;char str[MAXN];int leftNumP[MAXN] = {0};int main(){gets(str);int len = strlen(str);for(int i = 0; i < len; i++){if(i > 0){leftNumP[i] = leftNumP[i - 1];}if(str[i] == 'P'){leftNumP[i]++;}}int ans = 0, rightNumT = 0;for(int i = len - 1; i >= 0; i--){if(str[i] == 'T'){rightNumT++;}else if(str[i] == 'A'){ans = (ans + leftNumP[i] * rightNumT) % MOD;}}printf("%d", ans);return 0;}
阅读全文
1 0
- PAT a1093题解
- PAT A1093
- PAT-A1093
- PAT A1093
- A1093. Count PAT's (25)
- 数学问题--PAT. B1040 & A1093
- PAT A1093. Count PAT's (25)
- pat-a1093. Count PAT's (25)
- PAT 1001-1010 题解
- PAT 1011-1020 题解
- PAT 1021-1030 题解
- PAT 1031-1040 题解
- PAT 1041-1050 题解
- PAT 1051-1060 题解
- PAT(basic level)题解
- PAT乙级题解
- PAT题解目录
- PAT甲级题解目录
- hibernate的实体类编写规则与主键生成策略
- 剖析整数,浮点数在内存中的存储
- 170723 逆向-RouterScanDLL初步
- C#存储Excel表格
- java线程
- PAT a1093题解
- 刷题——中序后序遍历重构二叉树
- Android应用进程防杀指南3-JobService
- C++每日一课(十九)
- PAT a1094题解
- 计蒜之道2017F-腾讯消消乐(状压dp)
- 基于Zookeeper的路由和负载均衡实现思想
- Java系列(二)之面向对象
- PAT a1095题解