HP Forums / HP Calculators (and very old HP Computers) / General Forum v / Tripartite Palindromic Partition of Integer (HP 50g) Challenge

Post Reply 
Tripartite Palindromic Partition of Integer (HP 50g) Challenge
03-10-2023, 07:12 PM
Post: #56
Gerald H Offline
Senior Member
 		Posts: 1,627
Joined: May 2014
RE: Tripartite Palindromic Partition of Integer (HP 50g) Challenge
Your current SML2 programme, 2old2randr, looks like this in Sys:

Code:
Size: 253.5

CkSum: # 47759d

::
  CK2&Dispatch
  # FF5
  ::
    INCOMPDROP
    COERCE2
    {
      LAM d1
      LAM d0
    }
    BIND
    FPTR2 ^Z>#
    ::
      DUP
      BINT10
      EQUALcasedrp
      ::
        BINT9
        BINT1
        BINT0
      ;
      LAM d1
      LAM d0
      #=case
      ZEROZERO
      DROP
      LAM d1
      LAM d0
      #<case
      ::
        LAM d1
        BINT10
        #*
        LAM d1
        #+
        LAM d0
        LAM d1
        #-
        BINT0
      ;
      LAM d1
      LAM d0
      #1+
      #>case
      ::
        LAM d1
        #1-
        BINT10
        #*
        LAM d1
        #+
        #1-
        BINT10
        LAM d0
        #+
        LAM d1
        #-
        #1+
        BINT0
      ;
      LAM d0
      BINT10
      #*
      LAM d0
      #+
      BINT9
      BINT1
    ;
    ABND
    BINT3
    ZERO_DO
    ROT
    FPTR2 ^#>Z
    LOOP
  ;
;
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: Tripartite Palindromic Partition of Integer (HP 50g) Challenge - Gerald H - 03-10-2023 07:12 PM



User(s) browsing this thread: 1 Guest(s)

Contact Us | The Museum of HP Calculators | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication