Author |
Topic: The phone number problem (Read 461 times) |
|
azhenfeixue
Newbie
Posts: 1
|
 |
The phone number problem
« on: Sep 26th, 2008, 1:02am » |
 Quote  Modify
|
Suppose our mobile phone has 9 buttons ,which the charactors are on them(like button with "1" has the charactor string "abc").Now we have the frequency of each charactor(like 'a'=%2....'z'=%5 for example) ,the question is how we arrange the charactor to the 9 button can make user press the least times when he sending messages? Please note that if the button 1 is with "abc" , and we want to press b ,we had to press it for 2 times.And the order of the charactor should be kept(from 'a' to 'z',not allow 'c' precede 'b' for example).
I don't have a good idea to solve it properly, does anyone have?
Please pay attention to that: the order of the charactor should be kept!
|
|
 IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender: 
Posts: 13730
|
|
Re: The phone number problem
« Reply #1 on: Sep 26th, 2008, 5:29am » |
Quote Modify
|
You could evaluate each distribution of characters over keys for a representative sample text.
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print