(TI-66) Some digits for a sum

[Nihotte(lma)]

Some rapid words to present a written version for the TI-58 family of the program already published for several HP models in the forums.

The purpose is to find the list of distinct digits (figures) which sum gives a searching number.
For example, to find at most 45 you should add all the digits from 9 downto 1 (because 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 45).

It's interesting to try 23 by 4 digits on this program
by 23 x↔t 4 RST R/S and so on

A long time ago, I used this application (on a HP48) to complete some cross-numbers grids !

[Nihotte(lma)]

A few little words to add a simplified version of the program
You can use the code with symbolic addressing, which is more readable or more malleable, or one which adopts absolute addressing mode, slightly faster.

Notice : no change in the mode of use since the previous version
Each program can use Part 49 (119.48)

With symbolic addressing mode :

Code:


LBL D
CMS
STO 06
x↔t
STO 05
9
STO 02
LBL SIN
RCL 02
CP
x = t
RAD
1
0
PRD 07
RCL 02
SUM 07
SUM 03
1
SUM 01
INV SUM 02
RCL 06
x↔t
RCL 01
x = t
DEG
RCL 05
x↔t
RCL 03
INV x ≥ t
SIN
LBL COS
1
SUM 04
LBL TAN
1
0
x
INV PRD 07
RCL 07
INV INT
INV SUM 07
=
STO 02
INV SUM 03
1
INV SUM 01
DSZ 4
TAN
INV SUM 02 
GTO SIN
LBL DEG
RCL 05
x↔t
RCL 03
INV x = t
COS
RCL 07
FIX 0
R/S
GTO COS
LBL RAD
RCL 01
x↔t
CLR
INV x ≥ t
COS
RCL 05
x↔t
RCL 06
R/S
RST

And, with absolute addressing mode :

Code:


LBL D
CMS
STO 06
x↔t
STO 05
9
STO 02
(011) RCL 02
CP
x = t
0103
1
0
PRD 07
RCL 02
SUM 07
SUM 03
1
SUM 01
INV SUM 02
RCL 06
x↔t
RCL 01
x = t
0086
RCL 05
x↔t
RCL 03
INV x ≥ t
0011
(050) 1
SUM 04
(053) 1
0
x
INV PRD 07
RCL 07
INV INT
INV SUM 07
=
STO 02
INV SUM 03
1
INV SUM 01
DSZ 4
0053
INV SUM 02 
GTO 0011
(086) RCL 05
x↔t
RCL 03
INV x = t
0050
RCL 07
FIX 0
R/S
GTO 0050
(103) RCL 01
x↔t
CLR
INV x ≥ t
0050
RCL 05
x↔t
RCL 06
R/S
RST