I would have expected to find such a presentation presenting a problem which actually
requires a search of an intractably-large space ... and, since this one clearly doesn’t
It does for a golfer. :-)
The search is required to improve the previous shortest known Python solution
by replacing the shortest known magic formula:
10**(205558%ord(r)%7)%9995
with a new one in this form:
hash(r+"magicstrng")%1001
which is one stroke shorter.
This is explained in more detail in the introductory "Lookup Table vs Magic Formula" section of The 10**21 Problem (Part I).
But it would be a lot more interesting if the most-efficient algorithm
for solving the actual representative-problem were what is
presented “in the least number of keystrokes.”
The shortest algorithms for solving the Roman to Decimal conversion problem have already been presented in:
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|