shunfurh 于 2017.09.14 14:28 提问

Numerically Speaking

Description

A developer of crossword puzzles (and other similar word games) has decided to develop a mapping between every possible word with from one to twenty characters and unique integers. The mapping is very simple, with the ordering being done first by the length of the word, and then alphabetically. Part of the list is shown below.

``````a          1

b          2

...

z          26

aa         27

ab         28

...

snowfall   157,118,051,752

...
``````

Your job in this problem is to develop a program which can translate, bidirectionally, between the unique word numbers and the corresponding words.
Input

Input to the program is a list of words and numbers, one per line starting in column one, followed by a line containing a single asterisk in column one. A number will consist only of decimal digits (0 through 9) followed immediately by the end of line (that is, there will be no commas in input numbers). A word will consist of between one and twenty lowercase alphabetic characters (a through z).
Output

The output is to contain a single line for each word or number in the input data. This line is to contain the word starting in column one, followed by an appropriate number of blanks, and the corresponding word number starting in column 23. Word numbers that have more than three digits must be separated by commas at thousands, millions, and so forth.
Sample Input

29697684282993
transcendental
28011622636823854456520
computationally
zzzzzzzzzzzzzzzzzzzz
*
Sample Output

elementary 29,697,684,282,993
transcendental 51,346,529,199,396,181,750
prestidigitation 28,011,622,636,823,854,456,520
computationally 232,049,592,627,851,629,097
zzzzzzzzzzzzzzzzzzzz 20,725,274,851,017,785,518,433,805,270

1个回答

devmiao      2017.09.30 08:32

hdu 1314 Numerically Speaking

Numerically Speaking
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can'
ZJU 1272 Numerically Speaking

UVa 619 - Numerically Speaking

HDU 1312 Numerically Speaking

POJ 1312 Numerically Speaking
http://poj.org/problem?id=1312 看清楚题目可以看到是一个进制转换的问题 没写出来 看了别人的代码 //========================================================
POJ 1312 Numerically Speaking 笔记

day6 HDU 1312 Numerically Speaking

Numerically Speaking hdu 1314 大数模拟
Numerically SpeakingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 766 Accepted Submission(s): 190Problem Description A developer of cross
POJ 完整分类
DP:  1011   NTA                 简单题  1013   Great Equipment     简单题  1024   Calendar Game       简单题  1027   Human Gene Functions   简单题  1037   Gridland            简单题  1052   Algernon s Noxious