shunfurh
编程介的小学生
2017-11-14 10:23

Jinkeloid

10
  • c
  • string
  • lines
  • substring
  • each

Problem Description
After listening several songs of Jinkeloid,I come up with this problem :).
There is a string s only consist of first 20 lowercase English letters.
And we have several queries,each time I have k letters c1, c2, ..., ck,and I wonder how many consecutive substring of string s that each ci has occur even times in it.
Two substring with the same content but different position are considered different.

Input
The first line contains integer T(1<=T<=5),denote the number of the test cases.
For each test cases,the first line contains a string s(1<= length of s <= 105),the second line contains a number Q (Q<= 3 * 104),denote the number of queries.
Then Q lines follows,each lines start with a number k(1<= k<= 5),then contains k lowercase English letters c1, c2, ..., ck(There won't be duplicated ci).

Output
For each query,print the answer in one line.

Sample Input
1
cacca
5
3 c a b
2 c b
2 a b
3 c b a
2 a b

Sample Output
2
7
6
2
6

  • 点赞
  • 回答
  • 收藏
  • 复制链接分享

0条回答

为你推荐