Description
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.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.Sample Input
3 4 daababac
Sample Output
5
Hint
Huge input,scanf is recommended.Source
Southwestern Europe 2002
題意:輸入n,m,和字符竄,給你字符串出現字母的種數(m),問你長度為n的字符串有多少種?
hash,看代碼吧
#include#include #include #include #include