Munchausen numbers: Difference between revisions
→{{header|langur}}
Langurmonkey (talk | contribs) |
Langurmonkey (talk | contribs) |
||
| (5 intermediate revisions by 3 users not shown) | |||
Line 181:
<pre>3435
0001</pre>
=={{header|ABC}}==
<syntaxhighlight lang="ABC">HOW TO REPORT munchausen n:
PUT 0 IN sum
PUT n IN m
WHILE m > 0:
PUT m mod 10 IN digit
PUT sum + digit**digit IN sum
PUT floor(m/10) IN m
REPORT sum = n
FOR n IN {1..5000}:
IF munchausen n: WRITE n/</syntaxhighlight>
{{out}}
<pre>1
3435</pre>
=={{header|Action!}}==
Line 1,073 ⟶ 1,089:
=={{header|Delphi}}==
See [https://rosettacode.org/wiki/Munchausen_numbers#Pascal Pascal].
=={{header|Draco}}==
<syntaxhighlight lang="draco">proc munchausen(word n) bool:
/* d^d for d>6 does not fit in a 16-bit word,
* it follows that any 16-bit integer containing
* a digit d>6 is not a Munchausen number */
[7]word dpow = (1, 1, 4, 27, 256, 3125, 46656);
word m, d, sum;
m := n;
sum := 0;
while
d := m % 10;
m>0 and d<=6
do
m := m/10;
sum := sum + dpow[d]
od;
d<=6 and sum=n
corp;
proc main() void:
word n;
for n from 1 upto 5000 do
if munchausen(n) then
writeln(n)
fi
od
corp</syntaxhighlight>
{{out}}
<pre>1
3435</pre>
=={{header|EasyLang}}==
Line 1,412 ⟶ 1,460:
[[File:Fōrmulæ - Munchausen numbers 01.png]]
'''Test case 1''' Find all Munchausen numbers between 1 and 5000
[[File:Fōrmulæ - Munchausen numbers 02.png]]
[[File:Fōrmulæ - Munchausen numbers 03.png]]
'''Test case 2''' Show the Munchausen numbers between 1 and 5,000 from bases 2 to 10
[[File:Fōrmulæ - Munchausen numbers 04.png]]
[[File:Fōrmulæ - Munchausen numbers 05.png]]
=={{header|Go}}==
Line 1,707 ⟶ 1,763:
{{trans|C#}}
<syntaxhighlight lang="langur"># sum power of digits
val .spod =
# Munchausen
writeln "Answers: ", filter
</syntaxhighlight>
{{out}}
Line 2,682 ⟶ 2,739:
<pre>1 (munchausen)
3435 (munchausen)</pre>
=={{header|SETL}}==
<syntaxhighlight lang="setl">program munchausen_numbers;
loop for n in [1..5000] | munchausen n do
print(n);
end loop;
op munchausen(n);
m := n;
loop while m>0 do
d := m mod 10;
m div:= 10;
sum +:= d ** d;
end loop;
return sum = n;
end op;
end program;</syntaxhighlight>
{{out}}
<pre>1
3435</pre>
=={{header|Sidef}}==
| |||