Smith numbers | Rosetta Code | #23
URL to the problem page: https://rosettacode.org/wiki/Smith_numbers Smith numbers are numbers such that the sum of the decimal digits of the integers that make up that number is the same as the sum of the decimal digits of its prime factors excluding 1. By definition, all primes are excluded as they (naturally) satisfy this condition! Smith numbers are also known as joke numbers. Example Using the number 166 Find the prime factors of 166 which are: 2 x 83 Then, take those two prime factors and sum all their decimal digits: 2 + 8 + 3 which is 13 Then, take the decimal digits of 166 and add their decimal digits: 1 + 6 + 6 which is 13 Therefore, the number 166 is a Smith number. Write a program to find all Smith numbers below 10000. #include <iostream> using namespace std ; int n = 0 , factors [ 512 ] = { 0 }, multiply = 1 , thenumber = 0 ; int power ...
