How to resolve the algorithm Narcissistic decimal number step by step in the ERRE programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Narcissistic decimal number step by step in the ERRE programming language
Table of Contents
Problem Statement
A Narcissistic decimal number is a non-negative integer,
n
{\displaystyle n}
, that is equal to the sum of the
m
{\displaystyle m}
-th powers of each of the digits in the decimal representation of
n
{\displaystyle n}
, where
m
{\displaystyle m}
is the number of digits in the decimal representation of
n
{\displaystyle n}
.
Narcissistic (decimal) numbers are sometimes called Armstrong numbers, named after Michael F. Armstrong. They are also known as Plus Perfect numbers.
Generate and show here the first 25 narcissistic decimal numbers.
Note:
0
1
= 0
{\displaystyle 0^{1}=0}
, the first in the series.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Narcissistic decimal number step by step in the ERRE programming language
Source code in the erre programming language
PROGRAM NARCISISTIC
!$DOUBLE
BEGIN
N=0
LOOP
C$=MID$(STR$(N),2)
LENG=LEN(C$)
SUM=0
FOR I=1 TO LENG DO
C=VAL(MID$(C$,I,1))
SUM+=C^LENG
END FOR
IF N=SUM THEN
PRINT(N;)
COUNT=COUNT+1
EXIT IF COUNT=25
END IF
N=N+1
END LOOP
END PROGRAM
You may also check:How to resolve the algorithm Hello world/Text step by step in the Hack programming language
You may also check:How to resolve the algorithm Introspection step by step in the Forth programming language
You may also check:How to resolve the algorithm Fermat numbers step by step in the Nim programming language
You may also check:How to resolve the algorithm Topswops step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm Inheritance/Single step by step in the Factor programming language