Anonymous user
Smallest numbers: Difference between revisions
→{{header|Nim}}
(Realize in F#) |
|||
Line 125:
18 7 17 15 9 18 16 17 9 7 12 28 6 23 9 24 23
</pre>
=={{header|Nim}}==
{{libheader|bignum}}
<lang Nim>import strformat, strutils
import bignum
var k = 1u
var toFind = {0..51}
var results: array[0..51, uint]
while toFind.card > 0:
let str = $(pow(newInt(k), k))
for n in toFind:
if str.find($n) >= 0:
results[n] = k
toFind.excl(n)
inc k
echo "Smallest values of k such that k^k contains n:"
for n, k in results:
stdout.write &"{n:2} → {k:<2} ", if (n + 1) mod 9 == 0: '\n' else: ' '
echo()</lang>
{{out}}
<pre>Smallest values of k such that k^k contains n:
0 → 9 1 → 1 2 → 3 3 → 5 4 → 2 5 → 4 6 → 4 7 → 3 8 → 7
9 → 9 10 → 10 11 → 11 12 → 5 13 → 19 14 → 22 15 → 26 16 → 8 17 → 17
18 → 16 19 → 19 20 → 9 21 → 8 22 → 13 23 → 7 24 → 17 25 → 4 26 → 17
27 → 3 28 → 11 29 → 18 30 → 13 31 → 5 32 → 23 33 → 17 34 → 18 35 → 7
36 → 17 37 → 15 38 → 9 39 → 18 40 → 16 41 → 17 42 → 9 43 → 7 44 → 12
45 → 28 46 → 6 47 → 23 48 → 9 49 → 24 50 → 23 51 → 13 </pre>
=={{header|Pascal}}==
| |||