0 人解决,1 人已尝试。
0 份提交通过,共有 1 份提交。
9.9 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Perfect Software, Inc. has obtained a government contract to examine text flowing through a high-speed network for the occurrence of certain words. Your boss, Wally Perfect, has designed a parallel processing system which checks each word against a group of small perfect hash tables.
Input to your program will be a series of word lists, one per line, terminated by the end-of-file. Each line consists of between two and thirteen words of at most five lower case letters each, separated from each other by at least one blank. There will always be at least one one-letter word.
For each list, you are to print the input line. On the next line, print the C for the hash function determined by the list. Print a blank line after each C.
C will always fit in a 32-bit integer.
Input to your program will be a series of word lists, one per line, terminated by the end-of-file. Each line consists of between two and thirteen words of at most five lower case letters each, separated from each other by at least one blank. There will always be at least one one-letter word.
For each list, you are to print the input line. On the next line, print the C for the hash function determined by the list. Print a blank line after each C.
C will always fit in a 32-bit integer.
this is a test of some words to try out a bee see dee the of and to a in that is i it with for as
this is a test of some words to try out 17247663 a bee see dee 4427 the of and to a in that is i it with for as 667241
0 人解决,1 人已尝试。
0 份提交通过,共有 1 份提交。
9.9 EMB 奖励。