[REBOL] Re: OT: Competition - Is this solvable
From: dhsunanda::gmail::com at: 23-Nov-2007 16:57
Robert:
> I hope it's clear what I mean. So, has anyone any idea if this is
> solvable? Robert
Interesting....I think so!
No time to write the code (so my hand-waving solution is
untested), but I'd say:
You are clearly 8800 short of the desired target:
t: 41695.83
s: 6594,14 + 981,75 + 8747,39 + 1457,90 + 15114,65 + 8800
== 41695.83
So, for *minimal* typos, you need to change an 0-->8 or an 1-->9
in the hundreds column and thousands column of one or two of the
given numbers. That will affect the minimum digits: ie just two.
There are several ways to do that, easily eyeballable, eg:
s: 6594,14 + 981,75 + 8747,39 + 9457,90 + 15914,65 + 0000
s: 6594,14 + 8981,75 + 8747,39 + 1457,90 + 15914,65 + 0000
One instance changes two 1's to 9s. The other adds a leading 8 to
one of the givens.
If that had not worked, it gets more interesting: at which point,
I'm off out :-) But, following Tom's comment, perhaps take a look
at simetrics.r in the REBOL.org Script library -- it has
algorithms that can help rate how close strings are to each other.
Sunanda