HDU5944 Fxx and string

Fxx and string

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 603    Accepted Submission(s): 256

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
  
  

 

Source

BestCoder Round #89 

http://acm.split.hdu.edu.cn/showproblem.php?pid=5944

考虑一下公比小于1的情况就OK了

#include<bits/stdc++.h>
using namespace std;

char str[10010];

int main()
{
    int t,len,i,j,h,cnt;
    scanf("%d",&t);
    for(h=1;h<=t;h++)
    {
        scanf("%s",str+1);
        cnt=0;
        len=strlen(str+1);
        for(i=1;i<=len;i++)
            for(j=2;i*j*j<=len;j++)
        {
            if(str[i]=='y'&&str[i*j]=='r'&&str[i*j*j]=='x')
                cnt++;
                if(str[i]=='x'&&str[i*j]=='r'&&str[i*j*j]=='y')
                    cnt++;
        }
        printf("%d\n",cnt);
    }

    return 0;
}