poj——1200——Crazy Search
来源:互联网 发布:读英文软件 编辑:程序博客网 时间:2024/06/07 08:55
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.
题:这题巧妙在将字符串看做一个nc进制的数,很显然,如果两个数在nc进制下不同,在十进制下也是不同的 然后根据这个转成10进制来搞就行了
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
#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <queue>#include <vector>#include <map>#include <set>#include <stack>#define eps 1e-5#define MAXN 20000006#define MAXM 110037#define INF 1000000000using namespace std;int mod = 20000003;char s[MAXN];bool vis[MAXN];int asc[300];int main(){ int n, nc; scanf("%d%d", &n, &nc); scanf("%s", s); int ans = 0, x = 0; int len = strlen(s); for(int i = 0; i < len; i++) asc[s[i]] = 1; for(int i = 0; i < 256; i++) if(asc[i]) asc[i] = x++; for(int i = 0; i < len - n + 1; i++) { int f = 0; for(int j = 0; j < n; j++) f = f * nc + asc[s[i + j]]; if(!vis[f]) ans++, vis[f] = 1; } printf("%d\n", ans); return 0;}
0 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
- 高德地图SDK导入后报错的原因
- PMOS管学习应用
- java wait和notify时不起作用要注意的事项。
- Memcached介绍及简单的使用
- 浙江大学ACM俱乐部 1029:清雪
- poj——1200——Crazy Search
- Java异常处理机制【转载】
- word2007切换输入法
- OCP-1Z0-053-V13.02-477题
- 黑马程序员-----数组
- java中String对象初始化不能改变
- UVa:753 A Plug for UNIX
- HDU 2639 Bone Collector II (0-1背包第k优解)
- VMware Workstation 9 中怎么添加共享磁盘