| Time Limit: 1000MS | Memory Limit: 65536KB | 64bit IO Format: %I64d & %I64u |
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.
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.
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.
Sample Input
3 4
daababac
Sample Output
5
Hint
Huge input,scanf is recommended.
Source
RE到飞起，改了半天，标准代码比对无效。
然后发现数组开了160w……为什么我会把16 Millions理解错160w呢……
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<cmath> 6 using namespace std; 7 int n,nc; 8 int mp[300],cnt; 9 char s[16000100]; 10 bool hash[16000100]; 11 int main(){ 12 scanf("%d%d",&n,&nc); 13 scanf("%s",s); 14 int i,j; 15 int len=strlen(s)-1; 16 for(i=0;i<=len;i++) 17 if(!mp[s[i]])mp[s[i]]=++cnt; 18 int ans=0; 19 for(i=0;i<=len-n+1;i++){ 20 int hs=0; 21 for(j=i;j<n+i;j++){ 22 hs*=nc; 23 hs+=mp[s[j]]; 24 } 25 if(!hash[hs])hash[hs]=1,ans++; 26 } 27 printf("%d ",ans); 28 return 0; 29 }