poj1200（哈希）

这到题目有点不负责任，数据范围不讲清楚，建哈希表就有点难受。数据应该很水，以这么暴力的方法竟然能过。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;

const int mx = 16e6+2;
int ha[mx/2],vis[28];
char str[mx];
int n,m;
int main(){
	//int T=10;	scanf("%d",&T);
	//	freopen("F:\\in.txt","r",stdin);
	while(s2(n,m) != EOF){
		scanf("%s",str);
		int len = strlen(str),tol = 0,now,ans = 0;
		mem(vis,-1);
		mem(ha,0);
		for(int  i= 0; tol != m&& i < len; i++){
			if(vis[str[i] - 'a'] == -1)
				vis[str[i]-'a'] = tol++;
		}
		for(int i = 0; i < len-n+1; i++){
				now = vis[str[i] - 'a'];	
			for(int j = i+1; j < i+n; j++){
				now = now*m+vis[str[j] - 'a'];
			}
			//cout<<"now="<<now<<endl;
			if(!ha[now]){
				ha[now] = 1;
				ans++;
			}
		}
		cout<<ans<<endl;
	}

	return 0;
}