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

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
using namespace std;
char a[10005];
int  main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",a+1);//表示字符串输入的时候下标是从1开始的
        int len=strlen(a+1);
        int sum=0;
        for(int i=1; i<=len; i++)
        {
            for(int j=2; i*j*j<=len; j++)//j代表公比
            {
                if(a[i]=='y'&&a[j*i]=='r'&&a[i*j*j]=='x')//正着找
                    sum++;
                if(a[i]=='x'&&a[j*i]=='r'&&a[i*j*j]=='y')//倒着找
                    sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}