PAT1093解题报告
2015-03-14 19:02
351 查看
#include <iostream> #include <string> using namespace std; long long P = 0, PA = 0, PAT = 0; int main(){ string A; cin>>A; for(int i = 0; i < A.length(); ++i){ if(A[i] == 'P'){ P++; }else if(A[i] == 'A'){ PA += P; }else if(A[i] == 'T'){ PAT += PA; } } cout<<PAT % 1000000007<<endl; return 0; }
相关文章推荐
- 1093. Count PAT's (25)解题报告
- PAT 解题报告 1009. Product of Polynomials (25)
- BZOJ 1093 [ZJOI 2007] Tarjan+DAG拓扑排序DP 解题报告
- 【解题报告】【浙大PAT】03-树1. List Leaves (25)
- pat解题报告【1073】
- PAT (Advanced Level) 1124. Raffle for Weibo Followers (20) 解题报告
- PAT 解题报告 1010. Radix (25)
- pat解题报告【1078】
- PAT (Advanced Level) 1037. Magic Coupon (25) 解题报告
- PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
- pat--1009product of polynomial解题报告
- 解题报告-PAT-File Transfer
- pat解题报告【1082】
- PAT 解题报告 1047. Student List for Course (25)
- PAT (Top Level) 解题报告
- 洛谷1093 奖学金 解题报告
- 解题报告-PAT-Pop Sequence 浙大1051
- PAT解题报告A1111
- PAT (Advanced Level) 1038. Recover the Smallest Number (30) 解题报告
- PAT (Advanced Level) 1126. Eulerian Path (25) 解题报告