Ludic numbers: Difference between revisions
Content added Content deleted
Redherring (talk | contribs) |
m (→{{header|REXX}}: added/changed comments and whitespace.) |
||
| Line 3,319: | Line 3,319: | ||
=={{header|REXX}}== |
=={{header|REXX}}== |
||
<lang rexx>/*REXX program |
<lang rexx>/*REXX program gens/shows (a range of) ludic numbers, or a count when a range is used.*/ |
||
parse arg N count bot top triples . /*obtain optional arguments from the CL*/ |
parse arg N count bot top triples . /*obtain optional arguments from the CL*/ |
||
if N=='' | N=="," then N= |
if N=='' | N=="," then N= 25 /*Not specified? Then use the default.*/ |
||
if count=='' | count=="," then count= |
if count=='' | count=="," then count= 1000 /* " " " " " " */ |
||
if bot=='' | bot=="," then bot= |
if bot=='' | bot=="," then bot= 2000 /* " " " " " " */ |
||
if top=='' | top=="," then top= |
if top=='' | top=="," then top= 2005 /* " " " " " " */ |
||
if triples=='' | triples=="," then triples= |
if triples=='' | triples=="," then triples= 249 /* " " " " " " */ |
||
#= 0 /*the number of ludic numbers (so far).*/ |
|||
$= ludic( max(N, count, bot, top, triples) ) /*generate enough ludic nums*/ |
|||
say 'The first ' N " ludic numbers: " subword($,1,25) /*display 1st N ludic nums*/ |
|||
do j=1 until word($, j) > count /*search up to a specific #.*/ |
|||
end /*j*/ |
|||
say |
say |
||
say "There are " j-1 ' ludic numbers that are ≤ ' count |
say "There are " j - 1 ' ludic numbers that are ≤ ' count |
||
say |
say |
||
say "The " bot '───►' top ' (inclusive) ludic numbers are: ' subword($, bot) |
say "The " bot '───►' top ' (inclusive) ludic numbers are: ' subword($, bot) |
||
@= /*list of ludic triples found (so far).*/ |
|||
#=0 |
|||
do j=1 for words($) |
|||
_= word($, j) /*it is known that ludic _ exists. */ |
|||
if _>=triples then leave /*only process up to a specific number.*/ |
if _>=triples then leave /*only process up to a specific number.*/ |
||
if wordpos(_+2, $)==0 |
if wordpos(_+2, $)==0 | wordpos(_+6, $)==0 then iterate /*Not triple? Skip it.*/ |
||
#=#+1 |
#= # + 1 /*bump the triple counter. */ |
||
@= @ '◄'_ _+2 _+6"► " /*append the newly found triple ──► @ */ |
|||
end /*j*/ |
|||
say |
say |
||
if @=='' then say 'From 1──►'triples", no triples found." |
if @=='' then say 'From 1──►'triples", no triples found." |
||
| Line 3,344: | Line 3,348: | ||
exit /*stick a fork in it, we're all done. */ |
exit /*stick a fork in it, we're all done. */ |
||
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
||
ludic: procedure; parse arg m,,@; $=1 2 |
ludic: procedure; parse arg m,,@; $= 1 2 /*$≡ludic numbers superset; @≡sequence*/ |
||
do j=3 by 2 to m*15; @= @ j /*construct an initial list of numbers.*/ |
|||
end /*j*/ |
|||
@=@' '; n=words(@) /*append a blank to the number sequence*/ |
|||
@= @' '; n= words(@) /*append a blank to the number sequence*/ |
|||
do while n\==0; f= word(@, 1) /*examine the first word in the @ list.*/ |
|||
$= $ f /*add the word to the $ list. */ |
|||
do d=1 by f while d<=n; n= n-1 /*use 1st number, elide all occurrences*/ |
|||
@= |
@= changestr(' 'word(@, d)" ", @, ' . ') /*cross─out a number in @ */ |
||
end /*d*/ /* [↑] done eliding the "1st" number. */ |
|||
@= translate(@, , .) /*change dots to blanks; count numbers.*/ |
|||
end /*while*/ /* [↑] done eliding ludic numbers. */ |
|||
return subword($, 1, m) /*return a range of ludic numbers. */</lang> |
return subword($, 1, m) /*return a range of ludic numbers. */</lang> |
||
Some older REXXes don't have a '''changestr''' BIF, so one is included here ──► [[CHANGESTR.REX]]. |
Some older REXXes don't have a '''changestr''' BIF, so one is included here ──► [[CHANGESTR.REX]]. |
||