Fxx and string

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

Description

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

思路

题意：青年理论计算机科学家Fxx得到了一个只包含小写字母的字符串。字符串的长度为

题解：直接暴力枚举，重点在于选择合适的枚举量，如果去暴力字符串的话，肯定T，但是枚举公比的话，效率大大的提高，因为其增长速度很快

#include<bits/stdc++.h>using namespace std;const int maxn = 10005;char str[maxn];int main(){	freopen("input.txt","r",stdin);	int T;	scanf("%d",&T);	while (T--)	{		scanf("%s",str+1);		int len = strlen(str+1);		int res = 0;		for (int i = 1;i <= len && i <= len/4;i++)		{			for (int j = 2;i*j*j <= len;j++)			{				if (str[i] == ‘y‘ && str[i*j] == ‘r‘ && str[i*j*j] == ‘x‘)	res++;				if (str[i] == ‘x‘ && str[i*j] == ‘r‘ && str[i*j*j] == ‘y‘)	res++;			}		}		printf("%d\n",res);	}	return 0;}

HDU 5944 Fxx and string（水题）

声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉：投诉/举报工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。

联系
我们

首页 > 代码库 > HDU 5944 Fxx and string（水题）