Pythagorean triples: Difference between revisions

Pythagorean triples (view source)

Revision as of 11:59, 29 January 2024

507 bytes added , 4 months ago

m

→‎{{header|Wren}}: Changed to Wren S/H

PureFox

9,485

edits

Revision as of 15:39, 7 January 2024 (view source) Tigerofdarkness (talk \| contribs) (Added Algol 68) ← Older edit		Revision as of 11:59, 29 January 2024 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Changed to Wren S/H) Newer edit →
(3 intermediate revisions by 2 users not shown)
Line 383: =={{header\|ALGOL 68}}== Uses a table of square roots so OK for perimeters up to 1000 (or possibly 10 000)~~, for larger perimeters, binary searching a table of squares to find the root would probably be better..~~. <syntaxhighlight lang="algol68"> BEGIN # find some Pythagorean triples ( a, b, c ) # Line 1,397: =={{header\|Delphi}}== See [[#Pascal\|Pascal]]. =={{header\|EasyLang}}== {{trans\|C}} <syntaxhighlight> global total prim maxperi . proc newtri s0 s1 s2 . . p = s0 + s1 + s2 if p <= maxperi prim += 1 total += maxperi div p newtri s0 - 2 * s1 + 2 * s2 2 * s0 - s1 + 2 * s2 2 * s0 - 2 * s1 + 3 * s2 newtri s0 + 2 * s1 + 2 * s2 2 * s0 + s1 + 2 * s2 2 * s0 + 2 * s1 + 3 * s2 newtri -s0 + 2 * s1 + 2 * s2 -2 * s0 + s1 + 2 * s2 -2 * s0 + 2 * s1 + 3 * s2 . . for maxperi in [ 100 10000000 ] prim = 0 total = 0 newtri 3 4 5 print "Up to " & maxperi & ": " & total & " triples, " & prim & " primitives" . </syntaxhighlight> =={{header\|EDSAC order code}}== Line 5,300 ⟶ 5,322: {{trans\|Go}} Limited to a maximum perimeter of 10 billion in order to finish in a reasonable time. <syntaxhighlight lang="~~ecmascript~~wren">var sc = System.clock var total = 0 var prim = 0