C Program to Display Armstrong Number Between Two Intervals

Write a C program to find and display all Armstrong numbers between two given intervals.

An Armstrong number (also known as a narcissistic number or pluperfect number) of a given number of digits is a number that is equal to the sum of its own digits each raised to the power of the number of digits.

For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153.

Examples

Input: Lower limit = 100, Upper limit = 500
Output: 153, 370, 371, 407

Input: Lower limit = 1, Upper limit = 1000
Output: 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407

Approaches to Display Armstrong Number Between Two Intervals in C

We will use three approaches to solve this problem:

1. Iterative Approach

Idea

The iterative approach involves iterating through each number in the given range, checking if it is an Armstrong number by:

1. Counting the number of digits.
2. Computing the sum of each digit raised to the power of the number of digits.
3. Comparing the computed sum with the original number.

Steps

1. Define the range in the driver code.
2. Iterate through each number in the given range.
3. For each number, count the number of digits.
4. Compute the sum of the digits each raised to the power of the number of digits.
5. If the computed sum equals the original number, print the number.

Code

Armstrong numbers between 100 and 500 are: 153 370 371 407 

Complexity

• Time Complexity: O(n⋅d), where n is the number of numbers in the given range and d is the number of digits in the number.
• Auxiliary Space: O(1), since we use a constant amount of space.

2. Mathematical Approach using Logarithms

Idea

The mathematical approach uses logarithms to count the number of digits in a number. This can be more efficient for larger ranges. The approach still involves computing the sum of each digit raised to the power of the number of digits and comparing it with the original number.

Steps

1. Define the range in the driver code.
2. Iterate through each number in the given range.
3. For each number, use logarithms to count the number of digits.
4. Compute the sum of the digits each raised to the power of the number of digits.
5. If the computed sum equals the original number, print the number.

Code

Output:

153, 370, 371, 407

Complexity

• Time Complexity: O(n⋅d), similar to the iterative approach, where n is the number of numbers in the given range and d is the number of digits in the number.
• Auxiliary Space: O(1), since we use a constant amount of space.

3. Digit-by-Digit Extraction Approach

Idea

This approach involves extracting each digit of the number, raising it to the power of the number of digits, and summing these values. This method is straightforward and easy to understand.

Steps

1. Define the range in the driver code.
2. Iterate through each number in the given range.
3. For each number, count the number of digits.
4. Extract each digit, raise it to the power of the number of digits, and sum these values.
5. If the computed sum equals the original number, print the number.

Code

Output:

153, 370, 371, 407

Complexity

• Time Complexity: O(n⋅d), where n is the number of numbers in the given range and d is the number of digits in the number.
• Auxiliary Space Complexity: O(1), since we use a constant amount of space.

Note: If you face undefined reference to 'pow()' error, please refer to this post for solution.