HDU 4287 Intelligent IME(字符串)

题目链接
题意：给出手机键盘每个数字能打出的字母，然后给出一个词的字典，同时，给出给出一个输入序列，问有多少个匹配的

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<set>
#include<map>
#include<string>
#include<cassert>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define fastIO ios::sync_with_stdio(false);cin.tie(0);
#define LL long long
#define pb push_back
#define gcd __gcd


#define For(i,j,k) for(int i=(j);i<=k;i++)
#define lowbit(i) (i&(-i))
#define _(x) printf("%d\n",x)

typedef vector<LL> vec;
typedef pair<int,int> PI;
const double EPS = 1e-8;
const int maxn = 1e5+10;
const int inf  = 1 << 28;
int char2int(char s){
    if(s<='c')return 2;
    else if(s<='f')return 3;
    else if(s<='i')return 4;
    else if(s<='l')return 5;
    else if(s<='o')return 6;
    else if(s<='s')return 7;
    else if(s<='v')return 8;
    else return 9;
}
int q[maxn];
char str[maxn];
map<int,int> mp;
int main(){
    int T;scanf("%d",&T);
    while(T--){
        int n,m;mp.clear();
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++){
            scanf("%d",&q[i]);
        }
        for(int i=0;i<m;i++){
            scanf("%s",str);
            int t = 0;
            for(int i=0;str[i];i++){
                t = t*10 + char2int(str[i]);
            }
            mp[t]++;
        }
        for(int i=0;i<n;i++){
            printf("%d\n",mp[q[i]]);
        }
    }
    return 0;
}