Crazy Search (P1200)
来源:互联网 发布:电击恶搞软件 编辑:程序博客网 时间:2024/06/11 04:50
简单的HASH,可是要注意,这里不全是小写字母,所以要用数组a[ ]转换一下。
#include<iostream>#include<algorithm>#include<queue>#include<cstring>using namespace std;//freopen("C://i.txt","r",stdin);#define N 16000001int name[N];bool hash[N];int n,nc;char st[N];int a[100000];int main(){freopen("C://i.txt","r",stdin);int i,j,k;cin>>n>>nc;cin>>st;int len=strlen(st);memset(hash,false,sizeof(hash));int ans=0;memset(a,0,sizeof(a));k=0;for (i=0;i<len;i++){if (!a[st[i]])a[st[i]]= ++k;}for (i=n-1;i<len;i++){k=0;for (j=0;j<n;j++){//printf("%d %d\n",j+i-n+1,st[j+i-n+1]-'a'+1);k=k*nc+a[st[j+i-n+1]];}if (!hash[k]){ans++;hash[k]=true;}}cout<<ans<<endl;}
Crazy Search
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18071 Accepted: 5130
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
- Crazy Search (P1200)
- Crazy Search
- Crazy Search
- Crazy Search
- POJ 1200 Crazy Search
- poj1200 Crazy Search
- POJ1200 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
- zoj1507-Crazy Search
- poj-1200 Crazy Search
- POJ 1200 Crazy Search
- HDU1381--Crazy Search
- Spring的HibernateDaoSupport DaoSupport用HibernateTemplate,JdbcTemplate详解
- linux 系统下控制台重启服务器、重启weblogic的命令
- php json_encode 后js处理时对中文和韩文的问题
- Android 开发之menu功能菜单
- asp.net IE下div背景图片100%拉伸填充,可以缩放
- Crazy Search (P1200)
- Delphi 获得计算机名
- 千姿百态项目经理5——“睡神”项目经理1
- svg滤镜效果
- 小正太Facebook追赶腾讯蜀黍的脚步还有多远?
- SiteScope-Oracle篇
- 设置linux最大文件打开数量
- CSS颜色代码大全
- Resource 包匹配顺序