Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re^4: Shortest string containing all from 0000 to 9999 challenge. (how many?)

by sauoq (Abbot)
on May 22, 2003 at 20:31 UTC ( #260212=note: print w/replies, xml ) Need Help??


in reply to Re^4: Shortest string containing all from 0000 to 9999 challenge. (how many?)
in thread Shortest string containing all from 0000 to 9999 challenge.

Nope. This one starts with "9999", so the translation would start with "0000" which would sort before this one (hence, it couldn't be last.)

I think you will get the lexicographically last shortest if you perform that translation on the lexicographically first shortest though. :-)

-sauoq
"My two cents aren't worth a dime.";
  • Comment on Re: Re^4: Shortest string containing all from 0000 to 9999 challenge. (how many?)

Replies are listed 'Best First'.
Re^6: Shortest string containing all from 0000 to 9999 challenge. (oops)
by tye (Sage) on May 22, 2003 at 20:49 UTC

    Oops. I misread that you were starting with '9' as well as starting with '9999'. (Did I mention I'm busy today?)

    BTW, trim '9000' off the end of the first and '9999' off the front of the second, and you get the same substring.

                    - tye

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://260212]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2017-12-16 07:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (449 votes). Check out past polls.

    Notices?