hdu5944（Fxx and string）

Problem Description

Young theoretical computer scientist Fxx get a string which contains lowercase letters only.

The string S contains n lowercase letters S1S2…Sn .Now Fxx wants to know how many three tuple (i,j,k) there are which can meet the following conditions:

1、 i,j,k are adjacent into a geometric sequence.

2、 Si= ' y ' ,Sj= ' r ' ,Sk= ' x '.

3.Either j|i or j|k

 

Input

In the first line, there is an integer T(1≤T≤100) indicating the number of test cases.

T lines follow, each line contains a string, which contains only lowercase letters.(The length of string will not exceed 10000 ).

 

Output

For each case, output the answer.

 

Sample Input

  
  

   
   2
xyyrxx
yyrrxxxxx
  
  

 

Sample Output

  
  

   
   0
2
  
  

 
题意：求一个三元组（i,j,k）使得 Si= ' y ' ,Sj= ' r ' ,Sk= ' x '.，并且i,j,k是等比数列；
思路：枚举字符串，然后再枚举公比，不过要注意等比数列的公比也可能小于1，所以再反过来枚举一遍就好了。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<map>
#include<queue>
#define N 11000
#define INF 1<<30
using namespace std;
typedef long long LL;
int main()
{
    int t,i,j;
    char s[N];
    scanf("%d",&t);
    while(t--)
    {
        int ans=0;
        memset(s,0,sizeof(s));
        scanf("%s",s+1);
        for(i=1; s[i]; i++)
        {
            if(s[i]=='y')
            {
                for(j=1; ; j++)
                {
                    if(i*j*j>10010||i*j>10010)
                        break;
                    if(s[i*j]=='r'&&s[i*j*j]=='x')
                        ans++;
                }
            }
            if(s[i]=='x')
            {
                for(j=1; ; j++)
                {
                    if(i*j*j>10010||i*j>10010)
                        break;
                    if(s[i*j]=='r'&&s[i*j*j]=='y')
                        ans++;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}