BestCoder Round #89 1001 Fxx and string

Fxx and string

 

 Accepts: 213

 

 Submissions: 1867

 Time Limit: 2000/1000 MS (Java/Others)

 

 Memory Limit: 131072/65536 K (Java/Others)

Problem Description

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

The string $S$ contains $n$ lowercase letters S_1S_2\ldots S_nS​1​​S​2​​…S​n​​.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、S_i=S​i​​='$y$',S_j=,S​j​​='$r$',S_k=,S​k​​='$x$'.

3.Either j|i or j|k

Input

In the first line, there is an integer $T(1\le T\le 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

比赛时没考虑到公比小于1的情况，自己太渣了，此题枚举公比即可

#include<stdio.h>
#include<string.h>
char a[10005];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(a,0,sizeof(a));
        scanf("%s",a+1);
        int ans=0;
        int len=strlen(a+1);
        for(int q=1; q*q<=len; q++)//枚举公比
        {
            for(int i=1;i*q*q<=len;i++)
            {
                int j=i*q,k=j*q;
                if(a[i]=='y'&&a[j]=='r'&&a[k]=='x')//公比为q
                {
                    ans++;
                }
                if(a[i]=='x'&&a[j]=='r'&&a[k]=='y')//公比为1/q
                {
                    
                }
            }
        }
        printf("%d\n",ans);
    }
}