CF-447A
来源:互联网 发布:jquery调用js函数 编辑:程序博客网 时间:2024/05/17 06:11
A. QAQ
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
“QAQ” is a word to denote an expression of crying. Imagine “Q” as eyes with tears and “A” as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of “QAQ” in the string (Diamond is so cute!).
Bort wants to know how many subsequences “QAQ” are in the string Diamond has given. Note that the letters “QAQ” don’t have to be consecutive, but the order of letters should be exact.
Input
The only line contains a string of length n (1 ≤ n ≤ 100). It’s guaranteed that the string only contains uppercase English letters.
Output
Print a single integer — the number of subsequences “QAQ” in the string.
这道题目意思就是找“QAQ”,思路比较简单,找“A”左右两边的“Q”的个数,再相乘就是每个“A”对应的“QAQ”的个数。
代码略。
- CF-447A
- CF 2A Winner
- CF 128A Statues
- <cf>A. Exams
- CF 109A
- CF 111A
- CF 4A Watermelon
- CF 237A (Cash)
- CF 6 A - Triangle
- CF:96A.Football
- CF:208A. Dubstep
- CF:41A. Translation
- CF:59A. Word
- CF:43A. Football
- CF:78A. Haiku
- CF:A. Flipping Game
- CF 148 div1 A
- CF 127 div1 A
- PHP使用CURL发送GET请求时传递参数的问题
- View滑动-跟随手指移动
- Python获取pid和进程名字
- js中的时间增加一天
- 设计性思维模型及步骤(下)
- CF-447A
- vue学习笔记2
- Java原型设计模式
- 二叉树
- python first lesson
- 对pytroch中torch.autograd.backward的思考
- Java的流程控制
- struts2_day01_10_struts2常量配置
- 【SQL改写】notexists-leftjoin(distinct)whereisnull改写_标量子查询