894A QAQ

三层for循环，第一层找Q，第二层找A，第三层找Q…..

                    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.

Examples
input
QAQAQYSYIOIWIN
output
4
input
QAQQQZZYNOIWIN
output
3
Note
In the first example there are 4 subsequences “QAQ”: “QAQAQYSYIOIWIN”, “QAQAQYSYIOIWIN”, “QAQAQYSYIOIWIN”, “QAQAQYSYIOIWIN”.

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=110;
int main()
{
char s[N];
int ans;
while(cin>>s)
{
    int n=strlen(s);
    ans=0;
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            for(int k=0; k<n; k++)
            {
                if(s[i]=='Q'&&s[j]=='A'&&s[k]=='Q'&&i<j&&j<k)
                    ans++;

            }
    cout<<ans<<endl;
}

return 0;

}