HDU - 4821 I - String 字符串哈希（bkdrhash）+成段求值+map去重

Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if
  (i) It is of length M*L;
  (ii) It can be constructed by concatenating M “diversified” substrings of S, where each of these substrings has length L; two strings are considered as “diversified” if they don’t have the same character for every position.

Two substrings of S are considered as “different” if they are cut from different part of S. For example, string "aa" has 3 different substrings "aa", "a" and "a".

Your task is to calculate the number of different “recoverable” substrings of S.

Input

The input contains multiple test cases, proceeding to the End of File.

The first line of each test case has two space-separated integers M and L.

The second ine of each test case has a string S, which consists of only lowercase letters.

The length of S is not larger than 10^5, and 1 ≤ M * L ≤ the length of S.

Output

For each test case, output the answer in a single line.

Sample Input

3 3
abcabcbcaabc

Sample Output

2

题意：给你一个字符串，让你求出给定长度的子串中所有给定子串（子串的子串）都不相同的个数

思路：比赛的时候直接用stl写的，超时，后来看了题解使用字符串哈希解决，一想确实如果切割字符串的话map中比较字符串是否相同确实耗费大量时间，但是用hash的话可以把字符串转化为整形数，这样再判重就可以大大减少时间

ac代码：