Find Q

最新推荐文章于 2022-09-16 19:10:59 发布

zhaoluwei

最新推荐文章于 2022-09-16 19:10:59 发布

阅读量408

点赞数

分类专栏：杭电oj

本文链接：https://blog.csdn.net/zhaoluwei/article/details/52860636

版权

杭电oj 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Problem Description

Byteasar is addicted to the English letter 'q'. Now he comes across a string

S consisting of lowercase English letters.

He wants to find all the continous substrings of

S , which only contain the letter 'q'. But this string is really really long, so could you please write a program to help him?

Input

The first line of the input contains an integer

T(1≤T≤10) , denoting the number of test cases.

In each test case, there is a string

S , it is guaranteed that

S only contains lowercase letters and the length of

S is no more than

100000 .

Output

For each test case, print a line with an integer, denoting the number of continous substrings of

S , which only contain the letter 'q'.

Sample Input

  
  
   
   2
qoder
quailtyqqq

Sample Output

1
7

Source

BestCoder Round #88

思路：应该是水题，看有几个连着的q，设为K，则sum+=q*(q+1)即可；

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[110000];
int main()
{
    int t,l,i;
    long long sum,k;
    scanf("%d",&t);
    while(t--)
    {
    sum=k=0;
    scanf("%s",str);
    l=strlen(str);
    for(i=0;i<l;i++)
    {
    if(str[i]=='q')
    k++;    
    else
    {
    sum+=k*(k+1)/2;
    k=0; 
    }
    }
    sum+=k*(k+1)/2;
    printf("%lld\n",sum);        
    }        
    return 0;
}