POJ 1200 Crazy Search
来源:互联网 发布:飞鱼网络电视tv 编辑:程序博客网 时间:2024/04/27 17:38
Crazy Search
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18795 Accepted: 5330
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 4daababac
Sample Output
5
Hint
Huge input,scanf is recommended.
Source
Southwestern Europe 2002
哈希算法
#include <iostream>#include <string.h>#include <stdio.h>using namespace std;char s1[1000000];bool status[16000000]={false};int a[256];int main(){int i,j,n,m,l;int res,ans;scanf("%d %d",&n,&m);scanf("%s",s1);l=strlen(s1);memset(a,0,sizeof(a));for(i=0;i<=l-1;i++){a[s1[i]]=1;}j=0;for(i=0;i<=255;i++){if(a[i]){a[i]=j;j++;}}ans=0;for(i=0;i<=l-n;i++){res=0;for(j=0;j<=n-1;j++){res=res*m+a[s1[i+j]];}if(status[res]==false){ans+=1;status[res]=true;}}printf("%d\n",ans);return 0;}
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- poj-1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- POJ 1200 Crazy Search
- poj-1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200 Crazy Search
- POJ 1200 Crazy Search
- poj 1200-Crazy Search
- POJ 1200 Crazy search
- 使用BroadCast 使 service 和activity 信息交互
- 关于js关闭窗口的事件和用法
- Python的运算符与用法
- hadoop学习笔记-2-安装
- android 开发环境配置(MyEclipse8.5 + ADT14.0 + android-sdk_r14-windows)
- POJ 1200 Crazy Search
- 软考复习——编译原理
- jquery实现无刷新验证码
- Java三元运算符与if...else...的比较
- EAS BOS 绑定QUERY的列表界面,代码添加合计脚
- vijos1011【动态规划】
- hdu 4451 Dressing
- java面试题汇总(二)
- S5PV210 多媒体预留内存空间 4 - textscream, GPU1