Strong number is a number whose sum of all digits’ factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120) More...

#include <assert.h>
#include <stdbool.h>
#include <stdio.h>

Include dependency graph for strong_number.c:

Functions
bool	isStrong (int number)
	Check if given number is strong number or not. More...

void	test ()
	Test function. More...

int	main ()
	Driver Code. More...

Detailed Description

Strong number is a number whose sum of all digits’ factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120)

Function Documentation

◆ isStrong()

bool isStrong ( int number )

Check if given number is strong number or not.

Parameters

number

Returns: true if given number is strong number, otherwise false

{
    if (number < 0)
    {
        return false;
    }
    int sum = 0;
    int originalNumber = number;
    while (originalNumber != 0)
    {
        int remainder = originalNumber % 10;
        int factorial = remainder == 0 ? 0 : 1; /* 0! == 1 */
 
        /* calculate factorial of n */
        for (int i = 1; i <= remainder; factorial *= i, i++)
        {
            ;
        }
        sum += factorial;
        originalNumber /= 10;
    }
    return number == sum;
}

◆ main()

int main ( void )

Driver Code.

Returns: None

{
    test();
    return 0;
}

Here is the call graph for this function:

◆ test()

void test ( void )

Test function.

Returns: void