Numbers which are not the sum of distinct squares: Difference between revisions
Numbers which are not the sum of distinct squares (view source)
Revision as of 16:52, 7 January 2024
, 4 months ago→{{header|Wren}}: Changed to Wren S/H
(Added Easylang) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
Line 1,218:
===Brute force===
This uses a brute force approach to generate the relevant numbers, similar to Julia, except using the same figures as the above proof. Still slow in Wren, around 20 seconds.
<syntaxhighlight lang="
var combs = []
var results = []
Line 1,273:
{{libheader|Wren-fmt}}
Hugely quicker in fact - only 24 ms, the same as C# itself.
<syntaxhighlight lang="
import "./fmt" for Fmt
|