hdu 5944

最新推荐文章于 2017-11-11 20:29:17 发布

ACM__dongsheng

最新推荐文章于 2017-11-11 20:29:17 发布

阅读量433

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/acm__dongsheng/article/details/52974269

版权

水题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
using  namespace std;
const int N = 1e5+5;
char s[N];
int main(){
    int T;scanf("%d",&T);
    while(T--){
        scanf("%s",s+1);
        int len = strlen(s+1);
        int coun=0;
        for(int i=1;i<=len/4;i++){
                if(s[i]=='y'){
                     for(int j=2;i*j*j<=len;j++){
                               if(s[i*j]=='r' && s[i*j*j]=='x' )  coun++; 

                     }
                }
                if(s[i]=='x'){
                         for(int j=2;i*j*j<=len;j++){
                               if(s[i*j]=='r' && s[i*j*j]=='y' )  coun++; 

                     }
                }
       }
            printf("%d\n",coun);
    }
    return 0;
}