Rosetta Code

Sum to 100: Difference between revisions

Page Discussion

Sum to 100 (view source)

Revision as of 07:25, 8 April 2021

545 bytes added ,  3 years ago
m
→‎{{header|REXX}}: added/changed comments and whitespace, aligned statements.
(Added AutoHotkey)
m (→‎{{header|REXX}}: added/changed comments and whitespace, aligned statements.)
Line 5,299:
<lang rexx>/*REXX pgm solves a puzzle: using the string 123456789, insert - or + to sum to 100*/
parse arg LO HI . /*obtain optional arguments from the CL*/
if LO=='' | LO=="," then LO=100 100 /*Not specified? Then use the default.*/
if HI=='' | HI=="," then HI=LO LO /* " " " " " " */
if LO==00 then HI=123456789 123456789 /*LOW specified as zero with leading 0.*/
ops= '+-'; L= length(ops) + 1 /*define operators (and their length). */
@.=; do i=1 tofor L-1; @.i= substr(ops,i,1) /* " some handy-dandy REXX literals*/
end /*i*/ /* " individual operators for speed*/
mx= 0; mn=999999 999999 /*initialize the minimums and maximums.*/
mxL=; mnL=; do j=LO to HI until LO==00 & mn==0 /*solve with a range of sums*/
z=solve ???(j) /*find # of solutions for J. */
if z> mx then mxL= mxL= /*see ifis this is a new max.maximum ? */
if z>=mx then do; mxL=mxL j; mx=z; end /*remember this new maximummax. */
if z< mn then mnL= mnL= /*see ifis this is a new min.minimum ? */
if z<=mn then do; mnL=mnL j; mn=z; end /*remember this new minimummin. */
end /*j*/
if LO==HI then exit 0 /*don't display max & min ? */
@@= 'number of solutions: '; say
_= words(mxL); say 'sum's(_) "of" mxL ' 's(_,"have",'has') 'the maximum' @@ mx
_= words(mnL); say 'sum's(_) "of" mnL ' 's(_,"have",'has') 'the minimum' @@ mn
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
s: if arg(1)==1 then return arg(3); return word( arg(2) "s",1) /*simple pluralizer*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
solve???: parse arg answer; # #= 0 /*obtain the answer (sum) to the puzzle*/
do do a=L-1 tofor L2; aa= @.a'1' /*choose one of ─- or nothing. */
do do b=1 for L; bb= aa || @.b'2' /* " " " ─- +, or abutment.*/
do do c=1 for L; cc= bb || @.c'3' /* " " " " " " " */
do do d=1 for L; dd= cc || @.d'4' /* " " " " " " " */
do do e=1 for L; ee= dd || @.e'5' /* " " " " " " " */
do do f=1 for L; ff= ee || @.f'6' /* " " " " " " " */
do do g=1 for L; gg= ff || @.g'7' /* " " " " " " " */
do h=1 for L; hh= gg || @.h'8' /* " " " " " " " */
do i=1 for L; ii= hh || @.i'9' /* " " " " " " " */
interpret '$=' ii /*calculate the sum of modified string.*/
if $\==answer then iterate /*Is sum not equal to answer? Then skip*/
#= # + 1; if LO==HI then say 'solution: ' $ " ◄───► " ii
end /*i*/ end /*i */
end /*h*/ end /*h d */
end /*g*/ end /*g d */
end /*f*/ end /*f eeeee n nnnn dddddd sssss */
end /*e*/ end /* e e nn n d d s */
end /*d*/ end /* eeeeeee n n d d sssss */
end /*c*/ end /*c e n n d d s */
end /*b*/ end /*b eeeee n n ddddd sssss */
end /*a*/ end /*a */
y= # /* [↓] adjust the number of solutions?*/
if y==0 then y= 'no' /* [↓] left justify plural of solution*/
if LO\==00 then say right(y, 9) 'solution's(#, , " ") 'found for' ,
right(j, length(HI) ) left('', #, "─")
return # /*return the number of solutions found.*/</lang>
{{out|output|text=&nbsp; when using the default input:}}
<pre>
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/273675"