codechef Recipe Reconstruction 题解

Chef had an interesting dream last night. He dreamed of a new revolutionary chicken recipe. When he woke up today he tried very hard to reconstruct the ingredient list. But, he could only remember certain ingredients. To simplify the problem, the ingredient
list can be represented by a string of lowercase characters ‘a‘ - ‘z‘.

Chef can recall some characters of the ingredient list, all the others, he has forgotten. However, he is quite sure that the ingredient list was a palindrome.

You are given the ingredient list Chef dreamed last night. The forgotten characters are represented by a question mark (‘?‘). Count the number of ways Chef can replace the forgotten characters with characters ‘a‘ - ‘z‘ in such a way that resulting ingredient
list is a palindrome.

Input

The first line of input contains a single integer T, the number of test cases. T lines follow, each containing a single non-empty string - the ingredient list as recalled by Chef. Whatever letters he couldn‘t recall are represented by a ‘?‘.

Output

For each test case, output a single line containing the number of valid ways the ingredient list could be completed. Since the answers can be very large, output each answer modulo 10,000,009.

Example

Input:
5
?
??
ab?
a?c
aba

Output:
26
26
1
0
1

数学计算问题。

注意:

1 模的操作: 乘积的模等于模的乘积, 和的模等于模的和再模等操作

可以巧妙的简化为一个计算了:

有?的时候,两边相等*26, 不等就为零了

#pragma once
#include <stdio.h>

class RecipeReconstruction
{
	const static int MOD_V = 10000009;
	const static int MAX_S = 1000001;
	const static int MAX_BUF = 5120;
	int st, len;
	char inBuf[MAX_BUF];

	char getFromBuf()
	{
		if (st >= len)
		{
			len = fread(inBuf, 1, MAX_BUF, stdin);
			st = 0;
		}
		return inBuf[st++];
	}

public:
	RecipeReconstruction() : st(0), len(0)
	{
		int T = 0, id = 0, begin = 0;
		scanf("%d", &T);
		getchar();
		char str[MAX_S], c;
		while (T--)
		{
			id = 0;
			while ((c = getFromBuf()) != ‘\n‘ && len)
			{
				str[id++] = c;
			}
			int ans = 1, mid = (id+1) >> 1;
			for (int i = 0; i < mid; i++)
			{
				if (str[i] == str[id - i - 1])
				{
					if (str[i] == ‘?‘) ans = (ans * 26) % MOD_V;
				}
				else
				{
					if (str[i] != ‘?‘ && str[id - i - 1] != ‘?‘)
					{
						ans = 0;
						break;
					}
				}
			}
			printf("%d\n",ans);
		}
	}
};

int recipeReconstruction()
{
	RecipeReconstruction();
	return 0;
}

codechef Recipe Reconstruction 题解

时间: 2024-10-18 22:56:00

codechef Recipe Reconstruction 题解的相关文章

codechef Cutting Recipes题解

Cutting Recipes The chef has a recipe he wishes to use for his guests, but the recipe will make far more food than he can serve to the guests. The chef therefore would like to make a reduced version of the recipe which has the same ratios of ingredie

Codechef Nuclear Reactors 题解

There are K nuclear reactor chambers labelled from 0 to K-1. Particles are bombarded onto chamber 0. The particles keep collecting in the chamber 0. However if at any time, there are more than N particles in a chamber, a reaction will cause 1 particl

codechef Cleaning Up 题解

After a long and successful day of preparing food for the banquet, it is time to clean up. There is a list of n jobs to do before the kitchen can be closed for the night. These jobs are indexed from 1 to n. Most of the cooks have already left and onl

codechef Permutation Cycles 题解

We consider permutations of the numbers 1,..., N for some N. By permutation we mean a rearrangment of the number 1,...,N. For example 2  4  5  1  7  6  3  8 is a permutation of 1,2,...,8. Of course, 1  2  3  4  5  6  7  8 is also a permutation of 1,2

codechef Turbo Sort 题解

Input t – the number of numbers in list, then t lines follow [t <= 10^6]. Each line contains one integer: N [0 <= N <= 10^6] Output Output given numbers in non decreasing order. Example Input: 5 5 3 6 7 1 Output: 1 3 5 6 7 大数据的排序,输入和输出. 一开始使用了cou

codechef Top Batsmen题解

A cricket team consists of 11 players and some are good at batting, others are good at bowling and some of them are good at both batting and bowling. The batting coach wants to select exactly K players having maximum possible sum of scores. Given the

codechef Birthday Candles 题解

Birthday Candles The chef is preparing a birthday cake for one of his guests, and his decided to write the age of the guest in candles on the cake. There are 10 types of candles, one for each of the digits '0' through '9'. The chef has forgotten the

codechef Prime Palindromes 题解

给定一个数,求一个新数要大于等于这个数,而这个新数既要是palindromes回文又要是prime素数. 题目很简单,有人都使用取巧的方法保存好结果直接查表. 或者暴力法求解. 这里不使用保存表的方法,也不要用暴力法.- 这些方法都不好. 使用的技巧有: 1 而是使用next palindrome的技巧,只需要O(n),n是数位,可以认为是常数了. 2 判断素数的方法,时间效率是O(sqrt(n)), n是数值大小,如果是重复判断很多数是否是素数是有办法优化的,但是如果是单个素数判断的话,我还想

codechef Arranging Cup-cakes题解

Arranging Cup-cakes Our Chef is catering for a big corporate office party and is busy preparing different mouth watering dishes. The host has insisted that he serves his delicious cupcakes for dessert. On the day of the party, the Chef was over-seein