Armstrong Numbers Programming challenge description: An Armstrong number is an n-digit number that is equal to the sum of the nth powers of its digits. Determine if the input numbers are Armstrong numbers. Input: Your program should read lines from standard input. Each line has a positive integer. Output: Print out True if the number is an Armstrong number, or False if not. Test 1 Test Input 351 Expected Output False

Written in Python

number = int(input("Enter a number: "))

computesum = 0

lent = len(str(number))

for digit in str(number):

computesum += int(digit)**lent

if number == computesum:

print("true")

else:

print("false")

Explanation:

This line prompts user for Input input

number = int(input("Enter a number: "))

This line initialises the sum of the nth power of the digits to 0

computesum = 0

This line gets the length of input (i.e. number of digits)

lent = len(str(number))

The following iteration iterates through the digit to check for Armstrong numbers

for digit in str(number):

computesum += int(digit)**lent

This checks if the input number equals the computed sum

if number == computesum:

print("true") --- if yes, "true" is printed

else:

print("false") --- if otherwise, "false" is printed

See attachment for complete program in its right format

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

explanation: