mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
2fd530cba1
* fix: fit armstrong_number.cpp to guidelines * chore: delete unnecessary whitespace * updating DIRECTORY.md * fit: aliquot_sum to contribution guidelines added a math formula * chore: add print statement mentioning tests have passed * Update math/armstrong_number.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update math/armstrong_number.cpp Co-authored-by: David Leal <halfpacho@gmail.com> --------- Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com> Co-authored-by: David Leal <halfpacho@gmail.com>
92 lines
2.6 KiB
C++
92 lines
2.6 KiB
C++
/**
|
|
* @file
|
|
* @brief Program to check if a number is an [Armstrong/Narcissistic
|
|
* number](https://en.wikipedia.org/wiki/Narcissistic_number) in decimal system.
|
|
*
|
|
* @details
|
|
* Armstrong number or [Narcissistic
|
|
* number](https://en.wikipedia.org/wiki/Narcissistic_number) is a number that
|
|
* is the sum of its own digits raised to the power of the number of digits.
|
|
*
|
|
* let n be the narcissistic number,
|
|
* \f[F_b(n) = \sum_{i=0}^{k-1}d_{i}^{k}\f] for
|
|
* \f$ b > 1 F_b : \N \to \N \f$ where
|
|
* \f$ k = \lfloor log_b n\rfloor is the number of digits in the number in base \f$b\f$, and
|
|
* \f$ d_i = \frac{n mod b^{i+1} - n mod b^{i}}{b^{i}} \f$
|
|
*
|
|
* @author [Neeraj Cherkara](https://github.com/iamnambiar)
|
|
*/
|
|
#include <cassert> /// for assert
|
|
#include <cmath> /// for std::pow
|
|
#include <iostream> /// for IO operations
|
|
|
|
/**
|
|
* @brief Function to calculate the total number of digits in the number.
|
|
* @param num Number
|
|
* @return Total number of digits.
|
|
*/
|
|
int number_of_digits(int num) {
|
|
int total_digits = 0;
|
|
while (num > 0) {
|
|
num = num / 10;
|
|
++total_digits;
|
|
}
|
|
return total_digits;
|
|
}
|
|
|
|
/**
|
|
* @brief Function to check whether the number is armstrong number or not.
|
|
* @param number to be checked
|
|
* @return `true` if the number is armstrong.
|
|
* @return `false` if the number is not armstrong.
|
|
*/
|
|
bool is_armstrong(int number) {
|
|
// If the number is less than 0, then it is not an armstrong number.
|
|
if (number < 0) {
|
|
return false;
|
|
}
|
|
|
|
int sum = 0;
|
|
int temp = number;
|
|
// Finding the total number of digits in the number
|
|
int total_digits = number_of_digits(number);
|
|
while (temp > 0) {
|
|
int rem = temp % 10;
|
|
// Finding each digit raised to the power total digit and add it to the
|
|
// total sum
|
|
sum += static_cast<int>(std::pow(rem, total_digits));
|
|
temp = temp / 10;
|
|
}
|
|
return number == sum;
|
|
}
|
|
|
|
/**
|
|
* @brief Self-test implementations
|
|
* @returns void
|
|
*/
|
|
static void test() {
|
|
// is_armstrong(370) returns true.
|
|
assert(is_armstrong(370) == true);
|
|
// is_armstrong(225) returns false.
|
|
assert(is_armstrong(225) == false);
|
|
// is_armstrong(-23) returns false.
|
|
assert(is_armstrong(-23) == false);
|
|
// is_armstrong(153) returns true.
|
|
assert(is_armstrong(153) == true);
|
|
// is_armstrong(0) returns true.
|
|
assert(is_armstrong(0) == true);
|
|
// is_armstrong(12) returns false.
|
|
assert(is_armstrong(12) == false);
|
|
|
|
std::cout << "All tests have successfully passed!\n";
|
|
}
|
|
|
|
/**
|
|
* @brief Main Function
|
|
* @returns 0 on exit
|
|
*/
|
|
int main() {
|
|
test(); // run self-test implementations
|
|
return 0;
|
|
}
|