HDU 4287 Intelligent IME
来源:互联网 发布:win10 装linux 编辑:程序博客网 时间:2024/05/31 19:39
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
题意:
已知数字与字母的对应关系,第一行输入测试次数T,接着输入数字串的个数N与字典中单词的个数M,然后分别输入N个数字串和M个单词,对于每个数字串,输出字典中能打出的单词的个数
思路:
定义一个map < string,int > 来存储每个数字串对应的单词个数,循环字典中每一个单词,将其转化为数字串
AC代码
//// main.cpp// hdu 4287 Intelligent IME//// Created by nuu_tong on 2017/9/16.// Copyright © 2017年 apple. All rights reserved.//#include <iostream>#include<string>#include <map>using namespace std;string sequences[5001];string words[5001];map<string,int> button;map<string,int>::iterator it;string str="22233344455566677778889999";//用string储存26个字母对应的数字void findWords(int N,int M){ int i,k; string s; for(i=0;i<M;i++)//循环字典中每一个单词 { s=words[i]; for(k=0;k<s.length();k++) { s[k]=str[s[k]-'a'];//将单词转化为相应的数字串 } button[s]++;//将该数字串储存到map中 } for(i=0;i<N;i++) { s=sequences[i]; printf("%d\n",button[s]);//输出每个数字串对应的个数 }}int main(){ int i,T,N,M; char ch[7]; string s; cin>>T; while(T>0) { button.clear(); cin>>N>>M; for(i=0;i<N;i++) { scanf("%s",ch);//用scanf读取,提高运行速度 s=ch; sequences[i]=s;//将数字串加入到line数组中 } for(i=0;i<M;i++) { scanf("%s",ch); s=ch; words[i]=s; } findWords(N,M); T--; } return 0;}
- hdu 4287 Intelligent IME
- HDU-4287-Intelligent IME
- HDU 4287 Intelligent IME
- hdu 4287 Intelligent IME
- Intelligent IME hdu 4287
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- hdu-4287 Intelligent IME
- hdu 4287 Intelligent IME
- HDU 4287 - Intelligent IME
- HDU 4287 Intelligent IME
- HDU 4287 Intelligent IME
- hdu 4287 Intelligent IME
- hdu 4287 Intelligent IME
- hdu-4287 Intelligent IME
- hdu 4287 Intelligent IME
- HDU 4287 Intelligent IME
- JS技术(4)---定义对象,添加函数,改变对象属性
- Golang学习笔记
- vmware + redhat6.6+ g++的安装
- HDU
- 基本使用方法之三
- HDU 4287 Intelligent IME
- 最大似然和最大后验估计
- postman安装使用教程
- vmware提示:此虚拟机似乎正在使用中,无法取得所有权的解决办法
- Linux内核中提供的一些字符串转换函数
- awk查看与统计nginx访问日志
- PAT 1115. Counting Nodes in a BST (30) 搜索树建立 + 各层节点数量判断
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛【solved:9 / 10】
- Java如何使用redis