2020-01-22 15:35:30 +00:00
|
|
|
"""
|
2020-01-22 16:00:48 +00:00
|
|
|
An Armstrong number is equal to the sum of the cubes of its digits.
|
2020-01-22 15:35:30 +00:00
|
|
|
For example, 370 is an Armstrong number because 3*3*3 + 7*7*7 + 0*0*0 = 370.
|
|
|
|
An Armstrong number is often called Narcissistic number.
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
|
|
def armstrong_number(n: int) -> bool:
|
|
|
|
"""
|
2020-01-22 16:00:48 +00:00
|
|
|
Return True if n is an Armstrong number or False if it is not.
|
2020-01-22 15:35:30 +00:00
|
|
|
|
|
|
|
>>> armstrong_number(153)
|
|
|
|
True
|
|
|
|
>>> armstrong_number(200)
|
|
|
|
False
|
|
|
|
>>> armstrong_number(1634)
|
|
|
|
True
|
|
|
|
>>> armstrong_number(0)
|
|
|
|
False
|
|
|
|
>>> armstrong_number(-1)
|
|
|
|
False
|
|
|
|
>>> armstrong_number(1.2)
|
|
|
|
False
|
|
|
|
"""
|
|
|
|
if not isinstance(n, int) or n < 1:
|
|
|
|
return False
|
2020-01-23 16:21:51 +00:00
|
|
|
|
2020-01-22 15:35:30 +00:00
|
|
|
# Initialization of sum and number of digits.
|
|
|
|
sum = 0
|
|
|
|
number_of_digits = 0
|
|
|
|
temp = n
|
|
|
|
# Calculation of digits of the number
|
|
|
|
while temp > 0:
|
|
|
|
number_of_digits += 1
|
|
|
|
temp //= 10
|
|
|
|
# Dividing number into separate digits and find Armstrong number
|
|
|
|
temp = n
|
|
|
|
while temp > 0:
|
|
|
|
rem = temp % 10
|
2020-01-23 16:21:51 +00:00
|
|
|
sum += rem ** number_of_digits
|
2020-01-22 15:35:30 +00:00
|
|
|
temp //= 10
|
|
|
|
return n == sum
|
|
|
|
|
|
|
|
|
|
|
|
def main():
|
2020-01-22 16:00:48 +00:00
|
|
|
"""
|
|
|
|
Request that user input an integer and tell them if it is Armstrong number.
|
|
|
|
"""
|
|
|
|
num = int(input("Enter an integer to see if it is an Armstrong number: ").strip())
|
2020-01-22 15:35:30 +00:00
|
|
|
print(f"{num} is {'' if armstrong_number(num) else 'not '}an Armstrong number.")
|
|
|
|
|
|
|
|
|
2020-01-23 16:21:51 +00:00
|
|
|
if __name__ == "__main__":
|
2020-01-22 15:35:30 +00:00
|
|
|
import doctest
|
|
|
|
|
|
|
|
doctest.testmod()
|
|
|
|
main()
|