题目：Intelligent IME

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

1
3 5
46
64448
74
go
in
night
might
gn

Sample Output

3
2
0

题解：按照手机九键拼音的方式分别输出数字组成的字符串分别有几个。

代码如下：

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<fstream>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<set>
#include<iomanip>
#include<vector>
using namespace std;
int num[5005];
char ss[5005][8];
int num1[5005];
int sum[5005]={0};
int main()
{int k;cin>>k;while(k--){int n,m;cin>>n>>m;for(int i=1;i<=n;i++){cin>>num[i];}for(int j=1;j<=m;j++){scanf("%s",ss[j]);}/*for(int i=1;i<=n;i++){cout<<num[i]<<"  ";}for(int j=1;j<=m;j++){cout<<ss[j]<<"  ";}*/int t=0;char ssi[8];for(int j=1;j<=m;j++){t=0;memset(ssi,'\0',sizeof(ssi));int lens=strlen(ss[j]);for(int k=0;k<lens;k++){switch(ss[j][k]){case 'a':case 'b':case 'c': ssi[t++]='2';break;case 'd':case 'e':case 'f':ssi[t++]='3';break;case 'g':case 'h':case 'i':ssi[t++]='4';break;case 'j':case 'k':case 'l':ssi[t++]='5';break;case 'm':case 'n':case 'o':ssi[t++]='6';break;case 'p':case 'q':case 'r':case 's':ssi[t++]='7';break;case 't':case 'u':case 'v':ssi[t++]='8';break;case 'w':case 'x':case 'y':case 'z':ssi[t++]='9';break;}}//cout<<ssi<<endl;num1[j]=atoi(ssi);//cout<<num1[j]<<endl;//cout<<endl<<endl;}for(int j=1;j<=m;j++){for(int i=1;i<=n;i++){if(num1[j]==num[i]){sum[i]++;break;} }}for(int i=1;i<=n;i++){cout<<sum[i]<<endl;}    }return 0;
}

HDU-4287 Intelligent IME相关推荐

HDU -4287 Intelligent IME 字典树数组模拟
We all use cell phone today. And we must be familiar with the intelligent English input method on th ...
hdu 4287 sdnu 1119 Intelligent IME
原题链接: hdu: http://acm.hdu.edu.cn/showproblem.php?pid=4287 sdnu: http://210.44.14.31/problem/show/111 ...
HDU4287 Intelligent IME(Trie树，map)
Problem Description We all use cell phone today. And we must be familiar with the intelligent Englis ...
dd实现Linux转移,linux命令-dd {拷贝并替换}
一命令解释: dd:用指定大小的块拷贝一个文件,并在拷贝的同时进行指定的转换. 注意:指定数字的地方若以下列字符结尾,则乘以相应的数字:b=512:c=1:k=1024:w=2 参数注释: if=文 ...
字典树，01字典树，可持续化01字典树（总结+例题）
目录字典树 01字典树字典树例题: power oj 2390: 查单词 HDU 1671 Phone List HDU 1004Let the Balloon Rise HDU 1075 Wha ...
wince 6中硬键盘输入法解决
在一个项目中,我遇到了9宫格的键盘问题:wince下的keyboard的构架是native 方式,往系统发送的是数字按键,要在wince上实现汉字或字母,就需要一个输入法来解析! 好在T9就是这样设 ...
输入法(IME)实现原理
缘起在windows下使用的sougou输入法,除了经常弹出广告,没有什么异常行为,Linux下的中文输入法似乎没那么强大好用了.起初用的是Ibus中的pinyin,后来因为机缘巧合装了yong输入 ...
HDU 4775 Infinite Go 并查集
题目链接:Infinite Go Infinite Go Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K ( ...
HDU——1106排序（istringstream的使用、STLvector练习）
排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submiss ...

HDU-4287 Intelligent IME