Largest number divisible by its digits: Difference between revisions

m
→‎{{header|Wren}}: Changed to Wren S/H
m (→‎{{header|Wren}}: Changed to Wren S/H)
(One intermediate revision by one other user not shown)
Line 950:
for i to len dig[]
if n mod dig[i] <> 0
break 2return
.
.
Line 959:
proc perm pos . .
if found = 1
break 1return
.
for i = 9 downto 1
Line 2,542:
===base 10===
{{trans|Kotlin}}
<syntaxhighlight lang="ecmascriptwren">var divByAll = Fn.new { |n, digits| digits.all { |d| n%(d-48) == 0 } }
 
var magic = 9 * 8 * 7
Line 2,578:
{{trans|AWK}}
The integers here are too large (>= 2^53) to be accurately represented by Wren and so we follow the AWK approach of using an array of digits to represent them.
<syntaxhighlight lang="ecmascriptwren">var digits = "0123456789abcdef"
var base = 16
var size = 15
9,482

edits