Munchausen numbers: Difference between revisions
Content added Content deleted
(Added Kotlin) |
|||
Line 721: | Line 721: | ||
<pre>1 |
<pre>1 |
||
3435</pre> |
3435</pre> |
||
=={{header|Phix}}== |
|||
<lang Phix>sequence powers = 0&sq_power(tagset(9),tagset(9)) |
|||
function munchausen(integer n) |
|||
integer n0 = n |
|||
atom summ = 0 |
|||
while n!=0 do |
|||
summ += powers[remainder(n,10)+1] |
|||
n = floor(n/10) |
|||
end while |
|||
return summ=n0 |
|||
end function |
|||
for i=1 to 5000 do |
|||
if munchausen(i) then ?i end if |
|||
end for</lang> |
|||
{{out}} |
|||
<pre> |
|||
1 |
|||
3435 |
|||
</pre> |
|||
=={{header|Racket}}== |
=={{header|Racket}}== |