这道题目是关于Freeland语言的，该语言由N个字母组成，每个句子长度为M。新总统上任后，一些含有冒犯词汇的句子被禁止。给定禁止的P个单词，你需要计算现在还能使用的不同句子数量。输入包括字母表、句子长度和禁止词数量，输出安全可用的句子数。题目要求使用高精度或滚动数组法解决，避免矩阵快速幂导致溢出。
The alphabet of Freeland consists of exactly N letters. Each sentence of Freeland language (also known as Freish) consists of exactly M letters without word breaks. So, there exist exactly N^M different Freish sentences.
But after recent election of Mr. Grass Jr. as Freeland president some words offending him were declared unprintable and all sentences containing at least one of them were forbidden. The sentence S contains a word W if W is a substring of S i.e. exists such k >= 1 that S[k] = W[1], S[k+1] = W[2], ...,S[k+len(W)-1] = W[len(W)], where k+len(W)-1 <= M and len(W) denotes length of W. Everyone who uses a forbidden sentence is to be put to jail for 10 years.
Find out how many different sentences can be used now by freelanders without risk to be put to jail for using it.
Input
The first line of the input file contains three integer numbers: N -- the number of letters in Freish alphabet, M -- the length of all Freish sentences and P -- the number of forbidden words (1 <= N <= 50, 1 <= M <= 50, 0 <= P <= 10).
The second line contains exactly N different characters -- the letters of the Freish alphabet (all with ASCII code greater than 32).
The following P lines contain forbidden words, each not longer than min(M, 10) characters, all containing only letters of Freish alphabet.
Output the only integer numbe
最低0.47元/天 解锁文章
2395
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
