zoukankan      html  css  js  c++  java
  • poj 1200 Crazy Search

    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.
    Sample Input
    3 4
    daababac
    Sample Output
    5
    Hint
    Huge input,scanf is recommended.
     
    #include <cstdio>
    #include <cstdlib>
    #include <iostream>
    #include <cstring>
    #include <string>
    #include <algorithm>
    #include <cmath>
    using namespace std;
    const int MAX=16000005;
    
    char s[MAX];
    int ascii[256],hash[MAX];
    int n,nc,i,j,len,cnt,sum;
    
    int main()
    {
        while(scanf("%d%d",&n,&nc)!=EOF)
        {
            cnt=0;
            memset(ascii,0,sizeof(ascii));
            memset(hash,0,sizeof(hash));
            scanf("%s",s);
            len=strlen(s);
            for(i=j=0;i<len;i++)
            {
                if(!ascii[s[i]]) ascii[s[i]]=j++;
                if(j==nc) break;
            }
            len=len-n+1;
            for(i=0;i<len;i++)
            {
                sum=0;
                for(j=0;j<n;j++)
                {
                    sum=sum*nc+ascii[s[i+j]];
                }
                if(!hash[sum])
                {
                    hash[sum]=1;
                    cnt++;
                }
            }
            printf("%d
    ",cnt);
        }
        return 0;
    }
  • 相关阅读:
    OpenAL
    VS2013关于“当前不会命中断点源代码与原始版本不同”的BUG
    Windows中的句柄
    (转)OpenGL中位图的操作(glReadPixels,glDrawPixels和glCopyPixels应用举例)
    全局变量的初始化顺序
    与时间有关的windows函数
    unity中的协程
    Unity3d碰撞检测中碰撞器与触发器的区别
    unity脚本入门
    面试总结关于Spring面试问题(精选)
  • 原文地址:https://www.cnblogs.com/wanghaixv/p/9032578.html
Copyright © 2011-2022 走看看