HDU 1251 统计难题 (哈希)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=5e2+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
char s[1000];
map<ull,int> mp;
int main(){
    while(gets(s)){
        if(s[0]==NULL) break;
        int len=strlen(s);
        ull ans=0;
        rep(i,0,len){
            ans=ans*base+(ull)s[i];
            mp[ans]++;
        }
    }
    while(gets(s)){
        int len=strlen(s);
        ull ans=0;
        rep(i,0,len){
            ans=ans*base+(ull)s[i];
        }
        printf("%d\n",mp[ans]);
    }
    return 0;
}