Product of Digits in C

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

A supermarket maintains a pricing format for all its products. A value N is printed on each product. When the scanner reads the value N on the item, the product of all the digits in the value N is the price of the item.

The task here is to design the software such that given the code of any item N the product (multiplication) of all the digits of value should be computed (price).

Example 1:

Input :

5244 -> Value of N

Output :
160 -> Price

Explanation:

From the input above

Product of the digits 5, 2, 4, 4

5 * 2 * 4 * 4 = 160

Hence, output is 160.


#include <stdio.h>

int subtractProductAndSum(int n)
{
    int product = 1;
    int sum = 0;

    while (n > 0)
    {
        int digit = n % 10;
        product *= digit;
        sum += digit;
        n /= 10;
    }

    return product - sum;
}

int main()
{
    int n;
    printf("Enter the value of N: ");
    scanf("%d", &n);

    int result = subtractProductAndSum(n);

    printf("Result (Product - Sum of digits): %d\n", result);

    return 0;
}

📌 Hashtags:

#CProgramming #NumberProblems #DigitsProduct #CodingPractice #1printf

Search This Blog

1PRINTF

Featured

C Program to Check Prime Number Using Efficient Logic