Welcome to Armstrong Numbers on Exercism's C++ Track. If you need help running the tests or submitting your code, check out HELP.md.
An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.
For example:
9 = 9^1 = 910 != 1^2 + 0^2 = 1153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190Write some code to determine whether a number is an Armstrong number.
Wikipedia - https://en.wikipedia.org/wiki/Narcissistic_number