当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6086:Rikka with String

题目描述
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Yuta has $n$ $01$ strings $s_i$, and he wants to know the number of $01$ antisymmetric strings of length $2L$ which contain all given strings $s_i$ as continuous substrings.

A $01$ string $s$ is antisymmetric if and only if $s[i] \neq s[|s|-i+1]$ for all $i \in [1,|s|]$.

It is too difficult for Rikka. Can you help her?

In the second sample, the strings which satisfy all the restrictions are $000111,001011,011001,100110$.
输入解释
The first line contains a number $t(1 \leq t \leq 5)$, the number of the testcases.

For each testcase, the first line contains two numbers $n,L(1 \leq n \leq 6, 1 \leq L \leq 100)$.

Then $n$ lines follow, each line contains a $01$ string $s_i(1 \leq |s_i| \leq 20)$.
输出解释
For each testcase, print a single line with a single number -- the answer modulo 998244353.
输入样例
2
2 2
011
001
2 3
011
001
输出样例
1
4
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6086

最后修改于 2020-10-25T23:28:15+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 65536/65536K(Java/Others)