Largest number divisible by its digits: Difference between revisions
Largest number divisible by its digits (view source)
Revision as of 09:56, 15 December 2023
, 5 months ago→{{header|Wren}}: Changed to Wren S/H
(add RPL) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| (3 intermediate revisions by one other user not shown) | |||
Line 941:
readln;
end.</syntaxhighlight>
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
global found dig[] .
proc test . .
for i to len dig[]
n = n * 10 + dig[i]
.
for i to len dig[]
if n mod dig[i] <> 0
return
.
.
found = 1
print n
.
len use[] 9
proc perm pos . .
if found = 1
return
.
for i = 9 downto 1
dig[pos] = i
if use[i] = 0
use[i] = 1
if pos = len dig[]
test
else
perm pos + 1
.
use[i] = 0
.
.
.
for ndig = 9 downto 1
len dig[] ndig
perm 1
.
</syntaxhighlight>
=={{header|Factor}}==
===Base 10===
Line 969 ⟶ 1,008:
Running time: 0.07224931499999999 seconds
</pre>
=={{header|FreeBASIC}}==
Line 2,504 ⟶ 2,542:
===base 10===
{{trans|Kotlin}}
<syntaxhighlight lang="
var magic = 9 * 8 * 7
Line 2,540 ⟶ 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="
var base = 16
var size = 15
| |||