PAT-A 1093. Count PAT's
来源:互联网 发布:网络语大虾是什么意思 编辑:程序博客网 时间:2024/05/28 20:19
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
程序代码:
#include<stdio.h>int main(){ char c; int countA=0,countP=0,count=0,countPA=0; while((c=getchar())!='\n') { if(c=='P') { countP++;//P的个数 } else if(c=='A') { countPA=countPA+countP;//countPA是PA组合的个数 } else if(c=='T') { count=(count+countPA)%1000000007; } } printf("%d",count); return 0;}
0 0
- PAT A 1093. Count PAT's (25)
- PAT-A 1093. Count PAT's
- PAT A 1093. Count PAT's (25)
- PAT-A 1093. Count PAT's (25)
- PAT-A-1093. Count PAT's (25)
- Pat(A) 1093. Count PAT's (25)
- PAT 1093. Count PAT's
- PAT 1093. Count PAT's
- PAT 1093. Count PAT's
- 【PAT】1093. Count PAT's
- 1093.Count PAT's
- 1093. Count PAT's
- 1093. Count PAT's
- 1093. Count PAT's
- 1093. Count PAT's
- 1093. Count PAT's
- PAT 1093. Count PAT's (25)
- pat 1093. Count PAT's (25)
- 由遍历序列构造二叉树
- PAT-A 1092. To Buy or Not to Buy
- springboot处理session时间周期
- 关于一条sql语句中子查询的返回值不止一个,且拼接成相关规则的字符串
- c++中malloc,free,new,delete区别和联系
- PAT-A 1093. Count PAT's
- HDU 3460 字典树
- 请问.bash_profile文件在linux的哪里
- Openstack Paste.ini 文件详解
- HDU-4729 树链剖分+主席树
- Java8方法引用(::)
- 狄利克雷卷积及莫比乌斯反演定理
- VS2012使用初体验 VS2012与VS2010的区别说明
- Storm基础