HDOJ 题目4287 Intelligent IME（STL）

Intelligent IME

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2480    Accepted Submission(s): 1212

Problem Description

　　We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respectively, as shown below:
　　2 : a, b, c    3 : d, e, f    4 : g, h, i    5 : j, k, l    6 : m, n, o    
　　7 : p, q, r, s  8 : t, u, v    9 : w, x, y, z
　　When we want to input the word “wing”, we press the button 9, 4, 6, 4, then the input method will choose from an embedded dictionary, all words matching the input number sequence, such as “wing”, “whoi”, “zhog”. Here comes our question, given a dictionary, how many words in it match some input number sequences?

 

Input

　　First is an integer T, indicating the number of test cases. Then T block follows, each of which is formatted like this:
　　Two integer N (1 <= N <= 5000), M (1 <= M <= 5000), indicating the number of input number sequences and the number of words in the dictionary, respectively. Then comes N lines, each line contains a number sequence, consisting of no more than 6 digits. Then comes M lines, each line contains a letter string, consisting of no more than 6 lower letters. It is guaranteed that there are neither duplicated number sequences nor duplicated words.

 

Output

　　For each input block, output N integers, indicating how many words in the dictionary match the corresponding number sequence, each integer per line.

 

Sample Input

13 5466444874goinnightmightgn

 

Sample Output

320

 

Source

2012 ACM/ICPC Asia Regional Tianjin Online

 

Recommend

liuyiding   |   We have carefully selected several similar problems for you:  4267 4276 4268 4269 4270 

 

ac代码

#include<stdio.h>#include<map>#include<string>#include<string.h>#include<iostream>using namespace std;char str[28]="22233344455566677778889999";map<string,int>v;char s[5010][7];int main(){int t;scanf("%d",&t);while(t--){int n,m,i,j;char tem[10];scanf("%d%d",&n,&m);v.clear();for(i=0;i<n;i++){scanf("%s",s[i]);}for(i=0;i<m;i++){scanf("%s",tem);for(j=0;tem[j]!='\0';j++){tem[j]=str[tem[j]-'a'];}v[tem]=v[tem]+1;}for(i=0;i<n;i++){printf("%d\n",v[s[i]]);}}}