Special pythagorean triplet: Difference between revisions

Content added Content deleted
m (→‎{{header|REXX}}: added wording to the REXX section header.)
(→‎{{header|REXX}}: optimized execution of the three DO loops, used a better variable name for SUM, used better English when showing the number of solutions.)
Line 788: Line 788:
<br>the next integer was used &nbsp; (for the previous DO loop).
<br>the next integer was used &nbsp; (for the previous DO loop).
<lang rexx>/*REXX pgm computes integers A, B, C that solve: 0<A<B<C; A+B+C = 1000; A^2+B^2 = C^2 */
<lang rexx>/*REXX pgm computes integers A, B, C that solve: 0<A<B<C; A+B+C = 1000; A^2+B^2 = C^2 */
parse arg s hi n . /*obtain optional argument from the CL.*/
parse arg sum hi n . /*obtain optional argument from the CL.*/
if s=='' | s=="," then s= 1000 /*Not specified? Then use the default.*/
if sum=='' | sum=="," then sum= 1000 /*Not specified? Then use the default.*/
if hi=='' | hi=="," then hi= 1000 /* " " " " " " */
if hi=='' | hi=="," then hi= 1000 /* " " " " " " */
if n=='' | n=="," then n= 1 /* " " " " " " */
if n=='' | n=="," then n= 1 /* " " " " " " */
hi2= hi-2 /*N: number of solutions to find/show.*/
hh= hi - 2 /*N: number of solutions to find/show.*/
do j=1 for hi; @.j= j*j /*pre─compute squares ──► HI, inclusive*/
do j=1 for hi; @.j= j*j /*pre─compute squares ──► HI, inclusive*/
end /*j*/
end /*j*/
#= 0; pad= left('', 9) /*#: the number of solutions found. */
#= 0; pad= left('', 9) /*#: the number of solutions found. */
do a=2 by 2 for hi2%2; aa= @.a /*go hunting for solutions to equations*/
do a=2 for hh%2 by 2; aa= @.a /*search for solutions to the equations*/
do b=a+1 for hi2-a; ab= a + b /*calculate sum of two (A,B) squares.*/
do b=a+1; ab= a + b /*compute the sum of 2 numbers (A & B).*/
if ab>hi then iterate a /*Sum of A+B>HI? Then stop with B's */
if ab>hh then iterate a /*Sum of A+B>HI? Then stop with B's */
aabb= aa + @.b /*compute the sum of: A^2 + B^2 */
aabb= aa + @.b /*compute the sum of: A^2 + B^2 */
do c=b+1 for hi2-b /*test integers that satisfy equations.*/
do c=b+1 while @.c <= aabb /*test integers that satisfy equations.*/
if @.c > aabb then iterate b /*Square> A^2+B^2? Then stop with C's.*/
if @.c\==aabb then iterate /* " \=A^2+B^2? Then keep searching*/
if @.c \== aabb then iterate /* " \=A^2+B^2? Then keep searching*/
abc= ab + c /*compute the sum of: A + B + C */
abc= ab + c /*compute the sum of A + B + C */
if abc > sum then iterate b /*Is A+B+C > SUM? Then stop with C's.*/
if abc == s then call show /*Does A+B+C = S? Then solution found*/
if abc == sum then call show /*Does " = SUM? Then solution found*/
⚫
end /*c*/
if abc > s then iterate b /*Is " > S? Then stop with C's.*/
end /*c*/
end /*b*/
end /*b*/
end /*a*/
⚫
done: if #==0 then #= 'no'; say pad pad pad # ' solution's(#) "found."
⚫
end /*a*/
⚫
done: say pad pad pad # ' solutions found.'
exit 0 /*stick a fork in it, we're all done. */
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*/
show: #= #+1; say pad 'a=' a pad "b=" b pad 'c=' c; if #>=n then signal done; return</lang>
show: #= #+1; say pad 'a=' a pad "b=" b pad 'c=' c; if #>=n then signal done; return</lang>
{{out|output|text=&nbsp; when using the default inputs:}}
{{out|output|text=&nbsp; when using the default inputs:}}
Retrieved from "https://rosettacode.org/wiki/Special_pythagorean_triplet"