C Program to Check Armstrong Number

An Armstrong number can be described as the total of each of its digits scaled to the power of the total number of digits. For example, 153 is an Armstrong number since 1^3 + 5^3 + 3^3 = 153. In this article, we will discuss a C program that checks whether a given number is an Armstrong number or not. We will also explore alternative ways to Check Armstrong Number in C.

1. C Program to check Armstrong number Using Loop and Mathematical Calculations

#include <stdio.h>
#include <math.h>
int isArmstrong_Dataflair_Dataflair(int num) {
  int originalNum, remainder, digits = 0;
  double result = 0.0;
}
originalNum = num;
// Count the number of digits
while (originalNum != 0) {
   originalNum /= 10;
   ++digits;
}
originalNum = num;
// Calculate the sum of digits raised to the power of digits
while (originalNum != 0) {
   remainder = originalNum % 10;
   result += pow(remainder, digits);
   originalNum /= 10;
}
// Check if the number is an Armstrong number
if ((int)result == num)
   return 1;
else
  return 0;

We start by defining a function `isArmstrong_Dataflair` that takes an integer `num` as a parameter and returns an integer value (1 if the number is an Armstrong number, 0 otherwise). Inside the function, we declare variables `originalNum`, `remainder`, `digits`, and `result`. We store the original value of `num` in `originalNum` for later comparison. We use a `while` loop to count the number of digits in the given number `num` by continuously dividing `originalNum` by ten until it becomes 0, incrementing the `digits` variable on each iteration.

After counting the digits, we reset `originalNum` to its original value. Another while look can be used to find sum of all digits raised to power of total number of digits. We obtain each digit by taking the remainder of `originalNum` divided by ten and adding the result to the `result` variable using the `pow` function from the `math` library.

Finally, we compare the `result` with the original number `num`. If they are equal (after converting `result` to an integer), we return 1, indicating that the number is an Armstrong number; otherwise, we return 0. In the `main` function, we prompt the user to enter a number and store it in the `number` variable. We call the `isArmstrong_Dataflair` function with `number` as an argument and based on the returned value, we print the appropriate message.

2. Using Recursion to find Armstrong Number in C

An alternate approach to solving the Armstrong number problem is by using recursion. Instead of using loops, we can define a recursive function to calculate the sum of digits raised to the power of digits. Here’s the code:

#include <stdio.h>
#include <math.h>
int isArmstrong(int num, int digits) {
if (num == 0)
return 0;
else
return pow(num % 10, digits) + isArmstrong(num / 10, digits);
}
int main() {
}
int number, digits = 0;
printf("Enter a number: ");
scanf("%d", &number);
int originalNum = number;
// Count the number of digits
while (originalNum != 0) {
originalNum /= 10;
++digits;
}
if (isArmstrong (number, digits) == number)
printf("%d is an Armstrong number.\n", number);
printf("%d is not an Armstrong number.\n", number);
else
return 0;

The recursive function `isArmstrong_Dataflair` takes two arguments: `num` (the number to be checked) and `digits` (the total number of digits in the number). The function calculates the sum of digits raised to the power of digits by recursively calling itself with a reduced number obtained by dividing `num` by 10. The recursion terminates when `num` becomes 0, and the sum is returned back to the calling function.

The rest of the program remains the same as the previous approach, counting the digits and comparing the result with the original number to determine if it is an Armstrong number.

Both the approaches described above can be used to determine whether a given number is an Armstrong number or not. Choose the approach that suits your programming style or requirements.

Output:

Summary

This was all about finding Armstrong’s number using C.