Codeforces 894A(QAQ)

A. QAQ
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
	string a;
	while(cin>>a){
	  ll ans=0;
	  ll cnt=0;
	  for(ll i=0;i<a.length();i++){
	  	  if(a[i]=='Q') cnt++;
	  }
	  ll temp=0;
	  for(ll i=0;i<a.length();i++){
	  	 if(a[i]=='Q'){
	  	   temp++;	
		 }
		 else if(a[i]=='A'){
		 	ans+=temp*(cnt-temp);
		 }
	  }
	  cout<<ans<<endl;
	}
	return 0;
}
已标记关键词 清除标记
©️2020 CSDN 皮肤主题: 1024 设计师:上身试试 返回首页