Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,907 questions

51,839 answers

573 users

How to check if a number is curious number (sum of the factorials of each digit equal to itself) in C++

1 Answer

0 votes
#include <iostream>

long factorial(long n) {
    return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
 
int sumFactorialDigits(long num) {
    int sum = 0;
 
    while (num != 0) {
        sum += factorial(num % 10);
        num /= 10;
    }
 
    return sum;
}
 
int main(void) {
    long number = 145;
 
    if (number == sumFactorialDigits(number)) {
        std::cout << "Curious number";
    }
    else {
        std::cout << "Not curious number";
    }
}
 
 
 
 
/*
run:
 
Curious number
 
*/

 



answered Jan 2, 2024 by avibootz
...