USACO--Name That Number
2016-01-27 20:36
363 查看
Name That Number
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"):
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:
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.
这道题,没有思路,因为给力字典,后来看了别人的想法,知道怎么解决了,就是先输入一个数,然后从字典中一个一个的遍历,把字符串转换成整数,如果和输入的整数一样,就输出
我参照的这位的:http://blog.csdn.net/kzzhr/article/details/8637441 这里万分感谢他,我用的他的思路
下边是代码:
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.
PROGRAM NAME: namenum
INPUT FORMAT
A single line with a number from 1 through 12 digits in length.SAMPLE INPUT (file namenum.in)
4734
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
这道题,没有思路,因为给力字典,后来看了别人的想法,知道怎么解决了,就是先输入一个数,然后从字典中一个一个的遍历,把字符串转换成整数,如果和输入的整数一样,就输出
我参照的这位的:http://blog.csdn.net/kzzhr/article/details/8637441 这里万分感谢他,我用的他的思路
下边是代码:
#include<cstdio> #include<cstring> int main() { freopen("namenum.in","r",stdin); freopen("namenum.out","w",stdout); int hash_arr[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9}; long long num; scanf("%lld",&num); char str[13]; bool ok=false; freopen("dict.txt","r",stdin); while(scanf("%s",str)!=EOF) { int len=strlen(str); long long sum=0; for(int i=0;i<len;i++) { sum=sum*10+hash_arr[str[i]-'A']; } if(sum==num) { printf("%s\n",str); ok=true; } } if(!ok) printf("NONE\n"); return 0; }
相关文章推荐
- mysql 语句中带变量
- Task Management Principles
- 关于我,关于本blog,关于本blog的正确打开方式
- css3 tween
- Linux Shell 字符串拼接
- Windows 上常用进程/网络管理命令整理
- 第五天
- 应该了解的Openstack命令
- Oracle内存结构
- 贪心 HDU 2037 今年暑假不AC
- 列表和元组核心办法
- Office版本差别引发的语法问题
- 小Z的袜子(hose)
- layoutSubviews在什么情况下调用
- HDU1114 【DP入门之完全背包】
- 程序员之路(觉悟之路)
- OpenStack网络详解
- HDU 1847
- spark处理大数据的几个实例介绍
- NYOJ 993 How many integers can you find (数学)