（回文串全排列个数） xiaoxin juju needs help

最新推荐文章于 2024-06-16 21:38:29 发布

每天学点

最新推荐文章于 2024-06-16 21:38:29 发布

阅读量396

点赞数

分类专栏： C/C++/Python/Java/Matlab

请勿用于任何商业用途；转载的话请加上我的地址；

本文链接：https://blog.csdn.net/qq_40828914/article/details/81783005

版权

C/C++/Python/Java/Matlab 同时被 2 个专栏收录

291 篇文章 56 订阅 ¥39.90 ¥99.00

订阅专栏

C/C++

217 篇文章 13 订阅

订阅专栏

博客探讨了如何计算给定字符串能生成的不同回文串的数量，并提供了分析和解题思路，包括回文串的性质、形成的条件以及计算方法。在解决实际问题时，作者遇到了关于逆元计算的困扰，通过调整算法最终得到了正确结果。

摘要由CSDN通过智能技术生成

题目

As we all known, xiaoxin is a brilliant coder. He knew palindromic strings when he was only a six grade student at elementry school.

This summer he was working at Tencent as an intern. One day his leader came to ask xiaoxin for help. His leader gave him a string and he wanted xiaoxin to generate palindromic strings for him. Once xiaoxin generates a different palindromic string, his leader will give him a watermelon candy. The problem is how many candies xiaoxin’s leader needs to buy?
Input
This problem has multi test cases. First line contains a single integer T(T≤20) which represents the number of test cases.
For each test case, there is a single line containing a string S(1≤length(S)≤1,000).
Output
For e