【5907 Find Q】

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

#include<cstdio>
#include<cstring>
using namespace std;
char st[100011];
int main()
{
    int T,i,nl;
    long long sum,ans;
    scanf("%d",&T);
    while(T--)
    {
        ans = 0;
        scanf("%s",st);
        nl = strlen(st);
        for(i = 0 ; i < nl ; i++)
        {
            sum = 0;
            while(st[i] == 'q'){
                 sum++;
                 i++;
                 if(i == nl)
                    break;
            }
                ans += sum * (sum + 1) / 2;
        }
        printf("%lld\n",ans);
    }
    return 0;
}