zoukankan      html  css  js  c++  java
  • CodeForces

    "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/nekoyaliu

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

    题解:去求字符串里面有多少个QAQ字串,可以不连续

    代码:

    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    
    using namespace std;
    
    int main()
    {
    	
    	string str;
    	cin>>str;
    	int s2,s1,s=0;
    	for(int t=0;t<str.length();t++)
    	{
    		
    		if(str[t]=='A')
    		{
    			s1=0;
    			s2=0;
    			for(int j=0;j<t;j++)
    			{
    				if(str[j]=='Q')
    				s1++;
    			}
    			for(int j=t+1;j<str.length();j++)
    			{
    				if(str[j]=='Q')
    				s2++;
    			}
    			s+=s1*s2;
    		}
    	}
    	cout<<s<<endl;
    	
    	return 0;
    }
  • 相关阅读:
    Win10查毒
    Hexo博客快速部署
    Hexo各文件夹的作用
    Gitee+HEXO搭建个人博客
    Butterfly 主题设置
    JAVA 正则表达式学习网站 非捕获匹配
    jsPlump线路调整集合
    Spring-boot demo 集合
    多线程学习
    Spring boot 开发指导
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781880.html
Copyright © 2011-2022 走看看