hdoj-【5907 Find Q】

Find Q

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 576    Accepted Submission(s): 278

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
  
  

 

用long long 不然会错的，很简单的题目 

<span style="font-size:18px;">#include<cstdio>
#include<cstring>
#define LL long long
char s[100000+11];
LL num[100000+11];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(num,0,sizeof(num));
		scanf("%s",s);
		LL len=strlen(s),i,sum=0;
		if(s[0]=='q')
		{
			num[0]=1;
			sum=1;
		}
		for(i=1;i<len;++i)
		{
			if(s[i]=='q')
			{
				num[i]=num[i-1]+1;
				sum+=num[i];
			}
			else
				num[i]=0;
		}
		printf("%lld\n",sum);
	}
}
</span>