armstrong number Algorithm

The Armstrong Number Algorithm is a mathematical concept used to determine if a given number is an Armstrong number, also known as a narcissistic number, pluperfect number, or pluperfect digital invariant. An Armstrong number is a number that is equal to the sum of its own digits raised to the power of the number of digits. In other words, an n-digit number is an Armstrong number if the sum of its digits, each raised to the n-th power, equals the number itself. For example, the number 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153. To implement the Armstrong Number Algorithm, the first step is to find the number of digits (n) in the given number. This can be achieved by converting the number to a string and counting the characters, or by using logarithms to find the order of magnitude. Next, we need to break down the number into its individual digits and raise each digit to the power of n. The sum of these results is then calculated, and if this sum is equal to the original number, it is classified as an Armstrong number. This algorithm can be applied to identify Armstrong numbers in any number system and can be implemented using various programming languages to create efficient and accurate solutions.
#include<iostream>
#include<string>
using namespace std;


string check_armstrong(long long number){
    long long sum_of_digits = 0;
    long long value = number;
    while(number){
        int unit = number % 10;
        sum_of_digits += (unit*unit*unit); 
        number = number / 10;
    }
    return value == sum_of_digits?"\tIt is Armstrong Number":"\tNot A Armstrong Number";
}

int main(){
    cout<<check_armstrong(153)<<endl;   // It is armstrong number.    
    cout<<check_armstrong(102)<<endl;
}

LANGUAGE:

DARK MODE: