HDU 5944 Fxx and string

最新推荐文章于 2017-08-12 12:40:56 发布

Calm微笑

最新推荐文章于 2017-08-12 12:40:56 发布

阅读量348

点赞数

CC 4.0 BY-SA版权

分类专栏：字符串简单题数学题

本文链接：https://blog.youkuaiyun.com/yao1373446012/article/details/52973713

数学题同时被 2 个专栏收录

141 篇文章

订阅专栏

字符串简单题

37 篇文章

订阅专栏

本文介绍了一个字符串匹配的问题，需要找出特定的三元组，满足条件的等比数列，并提供了实现代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fxx and string

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

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

Recommend

wange2014 | We have carefully selected several similar problems for you: 5960 5959 5958 5957 5956

好坑，只考虑到了2 4 8这样的等比数列，没有考虑到8 4 2，被别人HACK之后马上就意识到了，

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[10010];
int main()
{
	int t,n,m,i,j,k,l;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",s);
		l=strlen(s);
		int ans=0;
		for(i=1;i<=l;i++)
		{
			for(j=2;i*j*j<=l;j++)
			{
				if(s[i-1]=='y'&&s[i*j-1]=='r'&&s[i*j*j-1]=='x')
				    ans++;
				if(s[i-1]=='x'&&s[i*j-1]=='r'&&s[i*j*j-1]=='y')
				    ans++;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}