6️⃣C Program to Find Factorial of a Number(With Program and Explanation)

 📌 C Program to Find Factorial of a Number

(With Program and Explanation)

🔹 What is Factorial?

The factorial of a number n is:

n! = n × (n−1) × (n−2) × ... × 1

Example:

  • 5! = 5 × 4 × 3 × 2 × 1 = 120

💻 C Program Code

#include <stdio.h>

int main() {
    int num, i;
    long long factorial = 1;

    printf("Enter a number: ");
    scanf("%d", &num);

    // Check for negative number
    if (num < 0) {
        printf("Factorial of a negative number is not possible.\n");
    } else {
        for (i = 1; i <= num; i++) {
            factorial = factorial * i;
        }
        printf("Factorial of %d is %lld\n", num, factorial);
    }

    return 0;
}

🧠 How the Program Works

  1. User enters a number

  2. If the number is negative, factorial is not defined

  3. Loop multiplies numbers from 1 to n

  4. Result is stored in factorial

▶️ Sample Output

Enter a number: 6
Factorial of 6 is 720
✅ Conclusion
In this program, we learned how to calculate the factorial of a number using loops in C.
📘 C Programming Series – What’s Next?
👉 In the next post of this series, we will learn how to find the sum of digits of a number in C. with complete explanation and output examples. Stay tuned! 🚀

Comments

Post a Comment

Popular posts from this blog

⓮C Program to calculate Simple Interest (With Program and Explanation)

📌 Program to calculate Simple Interest   Simple Interest Formula :- Simple Interest (SI) = P × R × T 100​ Where: P = Principal amount R = Rate of interest (per year) T = Time (in years) 🧾 C Program to Calculate Simple Interest # include <stdio.h> int main () { float principal, rate, time, simpleInterest; // Taking input from the user printf ( "Enter Principal Amount: " ); scanf ( "%f" , &principal); printf ( "Enter Rate of Interest: " ); scanf ( "%f" , &rate); printf ( "Enter Time (in years): " ); scanf ( "%f" , &time); // Calculating Simple Interest simpleInterest = (principal * rate * time) / 100 ; // Displaying the result printf ( "Simple Interest = %.2f" , simpleInterest); return 0 ; } 🧠 Explanation of the Program 1️⃣ Header File # include <stdio.h> This header file is used for input and outpu...
Read more

⑫ C Program to Swap Two Numbers Without Using a Temporary Variable (With Program and Explanation)

🔁 C Program to Swap Two Numbers Without Using a Temporary Variable Swapping two numbers means exchanging their values. Usually, we use a temporary variable , but in this program, we’ll swap the numbers without using any extra variable . 💡 Logic Used We use addition and subtraction to swap the values. Steps: Add both numbers and store the result in the first number. Subtract the second number from the first to get the original first number. Subtract the new first number from the second to get the original second number. 🧠 Algorithm Start Read two numbers a and b a = a + b b = a - b a = a - b Print swapped values End 💻 C Program Code # include <stdio.h> int main () { int a, b; // Input from user printf ( "Enter first number: " ); scanf ( "%d" , &a); printf ( " Enter second number: " ); scanf ( "%d" , &b); // Swapping without using temporary variab...
Read more

9️⃣C Program to Find LCM of Two Numbers (With Program and Explanation)

  🔢 C Program to Find LCM of Two Numbers 📌 What is LCM? LCM (Least Common Multiple) of two numbers is the smallest positive number that is divisible by both numbers . Example: LCM of 6 and 8 = 24 LCM of 4 and 5 = 20 🧠 Logic Used To find LCM efficiently, we use this formula: LCM = Number1 × Number2 GCD​ So first: Find GCD (Greatest Common Divisor) Apply the formula 💻 C Program to Find LCM of Two Numbers # include <stdio.h> int main () { int num1, num2, i, gcd, lcm; printf ( "Enter two numbers: " ); scanf ( "%d %d" , &num1, &num2); // Finding GCD for (i = 1 ; i <= num1 && i <= num2; i++) { if (num1 % i == 0 && num2 % i == 0 ) { gcd = i; } } // Calculating LCM lcm = (num1 * num2) / gcd; printf ( "LCM of %d and %d is %d" , num1, num2, lcm); return 0 ; } 📝 Explanation of the Program 🔹 Step 1: Taking Input s...
Read more