__ Python program to print out all the Armstrong number between 100 and 500__

Here we have to write a Python program to print out all the Armstrong numbers between 100 to 500 . So first we have to know what is Armstrong number ?

An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. In other words, if we take an n-digit number and raise each of its digits to the nth power, and add these values together, the result is equal to the original number.

For example, the number 153 is an Armstrong number because it has three digits and:

1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153

Similarly, 371 is also an Armstrong number because:

3^3 + 7^3 + 1^3 = 27 + 343 + 1 = 371

Armstrong numbers are also called narcissistic numbers or pluperfect digital invariants.

__ Python program to print out all the Armstrong number between 100 and 500__

The objective of the code is to print all the Armstrong number between 100 to 300 .

__Algorithm :__

__Algorithm :__

- Start iterating from 100 to 500.
- For each number, find the number of digits in it.
- Compute the sum of digits raised to the power of the number of digits.
- Compare the computed sum with the original number.
- If the computed sum is equal to the original number, then print the number as it is an Armstrong number.
- Continue with the iteration until all numbers from 100 to 500 are checked.

__Code(Python):-__

__Output:__

__Explanation:__

The above program uses a for loop to iterate through all numbers from 100 to 500. For each number, it computes the sum of its digits raised to the power of the number of digits using a while loop. If the computed sum is equal to the original number, then the number is an Armstrong number, and it is printed.

In the while loop, the modulus operator is used to extract the last digit of the number. The exponent operator is used to raise the digit to the power of 3. The sum of these cubes is computed for each digit. The integer division operator is used to remove the last digit from the number.

Finally, the program terminates after printing all Armstrong numbers between 100 and 500.

__Recommended Post ____:-__

__Recommended Post__

__:-__

__HCL Coding Questions:-__

__Capgemini Coding Questions:-__

__iMocha coding Questions:-__

__Tech Mahindra coding questions:-__

__Unthinkable Solutions coding questions:-__- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value

__Must check this:-__

__Companies interview:-__- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.

__Full C course:- __

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.

__Cracking the coding interview:-__

__Array and string:-__

__Tree and graph:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__ MCQs:-__

## 0 Comments