shunfurh 于 2017.09.03 22:41 提问

Crazy Search

Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substrings of a given size that exist in the text. As you soon will discover, you really need the help of a computer and a good algorithm to solve such a puzzle.

Your task is to write a program that given the size, N, of the substring, the number of different characters that may occur in the text, NC, and the text itself, determines the number of different substrings of size N that appear in the text.

As an example, consider N=3, NC=4 and the text "daababac". The different substrings of size 3 that can be found in this text are: "daa", "aab", "aba", "bab", "bac". Therefore, the answer should be 5.

Input

The first line of input consists of two numbers, N and NC, separated by exactly one space. This is followed by the text where the search takes place. You may assume that the maximum number of substrings formed by the possible set of characters does not exceed 16 Millions.

Output

The program should output just an integer corresponding to the number of different substrings of size N found in the given text.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input

1

3 4
daababac

Sample Output

5

1个回答

caozhy      2017.09.18 04:25

POJ1200 Crazy Search

hdu 1381 Crazy Search

POJ-1200 Crazy Search,人生第一道hash题！
Crazy Search     真是不容易啊，人生第一道hash题竟然是搜博客看题解来的。        题意：给你一个包含m种字符的字符串，求长度为n的不同子串有多少个。     将每个字串化为一个具体的数然后存入数组标记即可，如果重复出现肯定不用再加了。那么怎么化为一个数呢，这里用的方法是先将每个字符对应一个数，然后每个长度为n的子串就有了一个连续的数，将这个数段转化为m进制下的
Crazy Search (P1200)

poj-1200 Crazy Search
Language: Default Crazy Search Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19424   Accepted: 5506 Description Many people like to solve hard puzzles some
[POJ] 1200 Crazy Search [HASH]

POJ 1200 Crazy Search（哈希算法）【模板】
Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substrings of a given size that exist in the text. As you so
（POJ - 1200）Crazy Search
（POJ - 1200）Crazy Search Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of
poj1200Crazy Search

POJ1200 Crazy Search（hash）