/*
 * Author  : Amit Dutta <amitdutta4255@gmail.com>
 * Date    : 12 Dec 2025
 * Repo    : https://github.com/notamitgamer/bsc
 * License : MIT License (See the LICENSE file for details)
 */

/* WAP to check Krishnamurty number using user defined methods/functions. */

// This code has not been compiled.
// If you find any issues, please create a new issue on GitHub regarding them.
// Go to this link to create a new issue: https://github.com/notamitgamer/bsc/issues

#include <stdio.h>

int fact(int);
int isKrishnamurty(int);

int fact(int n)
{
    int fact = 1, i;
    for (i = 1; i <= n; i++)
        fact *= i;
    return fact;
}

int isKrishnamurty(int n)
{
    int temp = n, sum = 0;
    while (temp > 0)
    {
        sum += fact(temp % 10);
        temp /= 10;
    }
    return n == sum;
}

int main()
{
    int n;
    printf("Enter the number : ");
    scanf("%d", &n);
    if (isKrishnamurty(n))
        printf("\nInput %d is a Krishnamurty Number.", n);
    else
        printf("\nInput %d is not a Krishnamurty number.", n);
    return 0;
}