Name That Number

最新推荐文章于 2023-12-26 10:22:35 发布

原创最新推荐文章于 2023-12-26 10:22:35 发布 · 137 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#usaco解题报告

usaco解题报告专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种利用九宫格输入法快速查找字典中对应单词的方法，并提供了一个C++实现示例，该程序能根据输入的数字序列在预设的字典文件中查找所有可能匹配的有效名称。

题目描述:

Among the large Wisconsin cattle ranchers, it is customary to brand cows with serial numbers to please the Accounting Department. The cow hands don't appreciate the advantage of this filing system, though, and wish to call the members of their herd by a pleasing name rather than saying, "C'mon, #4734, get along."

Help the poor cowhands out by writing a program that will translate the brand serial number of a cow into possible names uniquely associated with that serial number. Since the cow hands all have cellular saddle phones these days, use the standard Touch-Tone(R) telephone keypad mapping to get from numbers to letters (except for "Q" and "Z"):

          2: A,B,C     5: J,K,L    8: T,U,V
          3: D,E,F     6: M,N,O    9: W,X,Y
          4: G,H,I     7: P,R,S

Acceptable names for cattle are provided to you in a file named "dict.txt", which contains a list of fewer than 5,000 acceptable cattle names (all letters capitalized). Take a cow's brand number and report which of all the possible words to which that number maps are in the given dictionary which is supplied as dict.txt in the grading environment (and is sorted into ascending order).

For instance, the brand number 4734 produces all the following names:

GPDG GPDH GPDI GPEG GPEH GPEI GPFG GPFH GPFI GRDG GRDH GRDI
GREG GREH GREI GRFG GRFH GRFI GSDG GSDH GSDI GSEG GSEH GSEI
GSFG GSFH GSFI HPDG HPDH HPDI HPEG HPEH HPEI HPFG HPFH HPFI
HRDG HRDH HRDI HREG HREH HREI HRFG HRFH HRFI HSDG HSDH HSDI
HSEG HSEH HSEI HSFG HSFH HSFI IPDG IPDH IPDI IPEG IPEH IPEI
IPFG IPFH IPFI IRDG IRDH IRDI IREG IREH IREI IRFG IRFH IRFI
ISDG ISDH ISDI ISEG ISEH ISEI ISFG ISFH ISFI

As it happens, the only one of these 81 names that is in the list of valid names is "GREG".

Write a program that is given the brand number of a cow and prints all the valid names that can be generated from that brand number or ``NONE'' if there are no valid names. Serial numbers can be as many as a dozen digits long.

输入输出格式：

INPUT FORMAT

A single line with a number from 1 through 12 digits in length.

SAMPLE INPUT (file namenum.in)

OUTPUT FORMAT

A list of valid names that can be generated from the input, one per line, in ascending alphabetical order.

SAMPLE OUTPUT (file namenum.out)

GREG

题目大意：

手机九宫格输入法，就是如何输入几个数字快速在字典找到那个单词，当然他把字典给了出来了，我这种跑法很快，看字典也不大，估计纯暴力压力也不大，具体可以自己试试看

解题代码：

/*
    ID:scwswx2
    PROG:namenum
    LANG:C++
*/
#include <fstream>
#include <string>
#include <cstring>
#include <map>
#include <cstdio>
#include <algorithm>
int main(){
	int m;
	char input[21];//存放输入数字
	char read[200];//存放从字典中读入的字符串
	int key[]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,0};//手机键盘数字对照表
	freopen("namenum.in","r",stdin);
	freopen("namenum.out","w",stdout);
	scanf("%s",input);
	int length=strlen(input);
	int flag=0;//标记在字典中有没有找到
	freopen("D:\\dict.txt","r",stdin);
	while(scanf("%s",read)!=EOF){
		m=0;
		m=strlen(read);
		if(length==m){
			while(input[length-m]-48==key[read[length-m]-'A']&&m>0){
					m--;
					if(m==0){
						printf("%s\n",read);
						flag++;
					}
				}

			}
		}
	if(flag==0){
		printf("NONE\n");
	}
	return 0;
}