POJ 1200

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int hash[30];
bool loc[20000000];
char str[1000000];

int main()
{
    int n,m,cnt,sum,len,ans,i,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(loc,0,sizeof(loc));
        memset(hash,0,sizeof(hash));
        scanf("%s",str);
        len=strlen(str);
        cnt=1;
        ans=0;
        for(i=0;i+n<=len;i++)
        {
            sum=0;
            for(j=i;j<i+n;j++)
            {
                if(!hash[str[j]-'a'])
                {
                    hash[str[j]-'a']=cnt++;
                }
                sum*=m;
                sum+=hash[str[j]-'a'];
            }
            if(!loc[sum])
            {
                loc[sum]=1;
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}

//ＴＬＥ,搞成单次输入也TLE,也许字符种类数没有用上
//Huge input,scanf is recommended.
#include <iostream>
#include <set>
#include <string>
using namespace std;

int main()
{
     int i,j,k,T;
     int m,n;
     string s;
     set <string > sset;
     while(cin>>m>>n)
     {
          s.clear();
          sset.clear();
          cin>>s;
          int len = s.length();
          for(i=0;i<=len-m;i++)
          {
               string temp = s.substr(i,m);
               sset.insert(temp);
          }
          cout<<sset.size()<<endl;
     }
     return 0;
}
               
          
          

//tle
#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;

char str[16000010] ;
char hash[300];

int main()
{
    int n,m,sum,len;
    int i,j,k,t;
    set <int > sset;
    while(scanf("%d%d",&n,&m)==2)
    { 
        memset(str,0,sizeof(str));
        memset(hash,0,sizeof(hash));
        sset.clear();
        scanf("%s",str);
        int cnt = 1;
        for(i=0;str[i+n-1]!='\0';i++)//不用strlen是为节省时间 
        {
            sum=0;
            for(j=i;j<i+n;j++)
            {
                if(!hash[str[j]-'a'])
                {
                    hash[str[j]-'a']=cnt++;
                }
                sum = sum*m + hash[str[j]-'a'];
            }
            sset.insert(sum);
        }
        printf("%d\n",sset.size());
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;

char str[16000010] ;
char hash[300];

int main()
{
    int n,m,sum,len;
    int i,j,k,t;
    map <int,bool > mm;
    scanf("%d%d",&n,&m);
    { 
        int ans  = 0;
        memset(str,0,sizeof(str));
        memset(hash,0,sizeof(hash));
        mm.clear();
        scanf("%s",str);
        int cnt = 1;
        for(i=0;str[i+n-1]!='\0';i++)//不用strlen是为节省时间 
        {
            sum=0;
            for(j=i;j<i+n;j++)
            {
                if(!hash[str[j]-'a'])
                {
                    hash[str[j]-'a']=cnt++;
                }
                sum = sum*m + hash[str[j]-'a'];
            }
            //if(!mm.count(sum))
            if(!mm[sum])//军超时 
            {
               mm[sum] = 1;
               ans ++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}