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
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
题意:给N个数字按键的序列,M个单词,寻找N个数字按键的组合对应了多少单词
思路:题目不难,就是得整理思路。
思路:题目不难,就是得整理思路。
#include <iostream>
#include <map>
#include <cstdio>
#include <cstring>
using namespace std;
map<int,int> mp;
int a[6000];
int getnum(char temp)
{
if(temp>='a'&&temp<='c')
return 2;
if(temp>='d'&&temp<='f')
return 3;
if(temp>='g'&&temp<='i')
return 4;
if(temp>='j'&&temp<='l')
return 5;
if(temp>='m'&&temp<='o')
return 6;
if(temp>='p'&&temp<='s')
return 7;
if(temp>='t'&&temp<='v')
return 8;
if(temp>='w'&&temp<='z')
return 9;
}
int conveytnum(char m[])
{
int len=strlen(m),i,num=0;
for(i=0; i<len; i++)
{
num=num*10+getnum(m[i]);
}
return num;
}
int main()
{
int t,n,m,i;
char s[20];
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=0; i<n; i++)
scanf("%d",&a[i]);
for(i=0; i<m; i++)
{
scanf("%s",s);
mp[conveytnum(s)]++;
}
for(i=0; i<n; i++)
printf("%d\n",mp[a[i]]);
mp.clear();
}
return 0;
}