An ARMSTRONG NUMBER is a numberwhich is made up of N digits and which is equal t

Question

An ARMSTRONG NUMBER is a numberwhich is made up of N digits and which is equal to the sum of eachdigit raised to the Nth power. Write a program to find allthe Armstrong numbers from 10 through 999999, inclusive. Print each of the numbers and the total number of Armstrong numbersfound. Follow *PRECISELY* the output format of the samplebelow.  

Input

There is no inputrequired.

Output

The output of your programMUST look like this (except with the XX?s replaced by correctnumerical values):

ARMSTRONG NUMBERS FOUND FROM 10 THROUGH 999999
<blank line goes here>
XXX
XXX
XXX
XXX
XXXX
... (this means more numbers)
<blank line goes here>
TOTAL NUMBER OF ARMSTRONG NUMBERS FOUND WAS XX

ANY HELP APPRECIATED :)

Explanation / Answer

I made a previous post but here it is again. using System; namespace armstrong { public class armstrong {    public static void Main(string[]args)    {        Console.WriteLine(" ARMSTRONG NUMBERS FOUND FROM 10 THROUGH999999 ");         int a, b, c, d, e, f, i,sub = 10, sum = 0, total = 0, digit = 0;         while (sub

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.