CF894A.QAQ

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

"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!).

illustration by 猫屋 https://twitter.com/nekoyaliuBort 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.

输入格式

The only line contains a string of length $n$ ( $1<=n<=100$ ). It's guaranteed that the string only contains uppercase English letters.

输出格式

Print a single integer — the number of subsequences "QAQ" in the string.

输入输出样例

输入#1
```
QAQAQYSYIOIWIN
```
输出#1
```
4
```
输入#2
```
QAQQQZZYNOIWIN
```
输出#2
```
3
```

说明/提示

In the first example there are $4$ subsequences "QAQ": "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN".

首页