H - Fxx and string HDU - 5944

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组成一个等比数列，并且s[i] = ‘y’, s[j] = ‘r’, s[k] = ‘x’，且j/i ,j/k中至少一个是整数。
思路：看好数据，暴力完事。时间复杂度为n*√n， 刚好10^6，稳稳飘过。

char ch[10010];
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        scanf("%s", ch);
        int ans=0, len=strlen(ch);
        for(int i=2; i*i<=len; ++i)
            for(int j=1; j*i*i<=len; ++j)
                if(ch[j-1] == 'y' && ch[j*i-1]=='r' && ch[j*i*i-1] == 'x')
                    ans++;
        for(int i=2; i*i<=len; ++i)//最大时间复杂度处。。。。
            for(int j=1; j<=len; ++j)
                if(j%(i*i)==0 && ch[j-1] == 'y' && ch[j/i-1]=='r' && ch[j/i/i-1] == 'x')
                    ans++;
        cout << ans << '\n';
    }
    return 0;
}