Such strange goings on. This doesn’t work on my MB Pro running Yosemite and LC
6.6.5 either. Nothing happens! If it hit enter repeatedly I get an “execution
error . . . can’t find handler . . . hint: go"
Cheers,
Roger
> On Nov 3, 2014, at 6:57 AM, Jim Hurley wrote:
>
> Here is that stack. J
Hi Igor,
Some years ago, 2002 to be exact, I built a stack that emulated a puzzle I
enjoyed.
The puzzle was to decipher a long division problem where all the numbers had
been replace by coded letters.
My algorithm is cumbersome--I needed dividends and divisors that yielded all 10
digits in the
Thanks Geoff!
Bob S
> On Oct 31, 2014, at 21:35 , Geoff Canyon wrote:
>
> FYI, here's my original bignum multiplier:
>
> function bigTimes X,Y
> if char 1 of X is "-" then
> put "-" into leadChar
> delete char 1 of X
> end if
> if char 1 of Y is "-" then
> if leadChar is
FYI, here's my original bignum multiplier:
function bigTimes X,Y
if char 1 of X is "-" then
put "-" into leadChar
delete char 1 of X
end if
if char 1 of Y is "-" then
if leadChar is "-" then put empty into leadChar else put "-" into leadChar
delete char 1 of Y
I've created similar routines in the past. Are you saying you do or don't
want to allow for arbitrarily-large divisors?
a pseudo-code algo for divisors that LC can handle:
1. remove the decimal points, remembering where they were
2. get the length of the divisor
3. grab that many characters from
