Preparing NOJ

# QAQ

1000ms 262144K

## Description:

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

## Sample Input:

QAQAQYSYIOIWIN

## Sample Output:

4

## Sample Input:

QAQQQZZYNOIWIN

## Sample Output:

3

## Note:

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

Info

Provider CodeForces

Code CF894A

Tags

brute forcedp

Submitted 25

Passed 18

AC Rate 72%

Date 03/04/2019 16:10:45

Related

Nothing Yet