POJ1200 Crazy Search
2016-07-16 08:42
218 查看
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.
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
RE到飞起,改了半天,标准代码比对无效。
然后发现数组开了160w……为什么我会把16 Millions理解错160w呢……
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; int n,nc; int mp[300],cnt; char s[16000100]; bool hash[16000100]; int main(){ scanf("%d%d",&n,&nc); scanf("%s",s); int i,j; int len=strlen(s)-1; for(i=0;i<=len;i++) if(!mp[s[i]])mp[s[i]]=++cnt; int ans=0; for(i=0;i<=len-n+1;i++){ int hs=0; for(j=i;j<n+i;j++){ hs*=nc; hs+=mp[s[j]]; } if(!hash[hs])hash[hs]=1,ans++; } printf("%d\n",ans); return 0; }
相关文章推荐
- 还原MySql数据库失败:max_allowed_packet 设置过小导致记录写入失败
- JDBC连接Sqlserver
- hidefocus小技巧
- 用CSS3实现旋转的CD
- Codeforces 650B Image Preview(尺取法)
- PHP将字符串首字母大小写转换
- hibernate联合主键生成策略以及一对多配置
- PHPThumb处理图片,生成缩略图,图片尺寸调整,图片截取,图片加水印,图片旋转
- 设置MySQL数据库名不区分大小写
- 关于增强现实(AR技术)的开源库推荐
- RTMP 封包详解
- 栈和队列
- PHP线程安全和非线程安全的区别
- 最小生成树Jungle Roads
- PHP学习笔记-Cookie
- 显示 、 列表 、 定位
- 数据结构之-栈(Java实现)
- 3分钟,9个Q&A让你快速知道Docker到底是什么
- 微信公众平台开发 获取用户基本信息
- 【重装系统】老毛桃U盘工具V2013超级装机版-安装原版Win7/Win8