Count array elements whose product of digits is a Composite Number
Last Updated :
27 Apr, 2021
Given an array arr[] consisting of N non-negative integers, the task is to count the number of array elements whose product of digits is a composite number.
Examples:
Input: arr[] = {13, 55, 7, 13, 11, 71, 233, 144, 89}
Output: 4
Explanation: The array elements having product of digits equal to a composite number are 55 (5 * 5 = 25), 233 (2 * 3 * 3 = 18), 144 (1 * 4 * 4 = 16), 89 ( = 8 * 9 = 72)
Input: arr[] = {34, 13, 55, 11, 8, 3, 55, 23}
Output: 3
Explanation: The array elements having product of digits equal to a composite number are 34 ( = 3 * 4 = 12), 55 ( 5 * 5 = 25), 23 ( = 2 * 3 = 6)
Approach: Follow the steps below to solve the problem:
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
#include <set>
using namespace std;
#define N 100005
// Function to generate prime numbers
// using Sieve of Eratosthenes
void SieveOfEratosthenes(bool prime[],
int p_size)
{
// Set 0 and 1 as non-prime
prime[0] = false;
prime[1] = false;
for (int p = 2; p * p <= p_size; p++) {
// If p is a prime
if (prime[p]) {
// Set all multiples of p as non-prime
for (int i = p * 2; i <= p_size; i += p)
prime[i] = false;
}
}
}
// Function to calculate the product
// of digits of the given number
long long int digitProduct(int number)
{
// Stores the product of digits
long long int res = 1;
while (number > 0) {
// Extract digits and
// add to the sum
res *= (number % 10);
number /= 10;
}
// Return the product
// of its digits
return res;
}
// Function to print number of distinct
// values with digit product as composite
void DistinctCompositeDigitProduct(int arr[],
int n)
{
// Initialize set
set<int> output;
// Initialize boolean array
bool prime[N + 1];
memset(prime, true, sizeof(prime));
// Pre-compute primes
SieveOfEratosthenes(prime, N);
// Traverse array
for (int i = 0; i < n; i++) {
// Stores the product of digits
// of the current array element
long long int ans
= digitProduct(arr[i]);
// If Product of digits is
// less than or equal to 1
if (ans <= 1) {
continue;
}
// If Product of digits is
// not a prime
if (!prime[ans]) {
output.insert(ans);
}
}
// Print the answer
cout << output.size() << endl;
}
// Driver Code
int main()
{
// Given array
int arr[]
= { 13, 55, 7, 13, 11,
71, 233, 233, 144, 89 };
// Given size
int n = sizeof(arr)
/ sizeof(arr[0]);
// Function call
DistinctCompositeDigitProduct(arr, n);
return 0;
}
// Java program for the above approach
import java.io.*;
import java.util.*;
class GFG{
static int N = 100005;
// Function to generate prime numbers
// using Sieve of Eratosthenes
static void SieveOfEratosthenes(boolean prime[],
int p_size)
{
// Set 0 and 1 as non-prime
prime[0] = false;
prime[1] = false;
for(int p = 2; p * p <= p_size; p++)
{
// If p is a prime
if (prime[p])
{
// Set all multiples of p as non-prime
for(int i = p * 2; i <= p_size; i += p)
prime[i] = false;
}
}
}
// Function to calculate the product
// of digits of the given number
static int digitProduct(int number)
{
// Stores the product of digits
int res = 1;
while (number > 0)
{
// Extract digits and
// add to the sum
res *= (number % 10);
number /= 10;
}
// Return the product
// of its digits
return res;
}
// Function to print number of distinct
// values with digit product as composite
static void DistinctCompositeDigitProduct(int arr[],
int n)
{
// Initialize set
TreeSet<Integer> output = new TreeSet<Integer>();
// Initialize boolean array
boolean prime[] = new boolean[N + 1];
Arrays.fill(prime, true);
// Pre-compute primes
SieveOfEratosthenes(prime, N);
// Traverse array
for(int i = 0; i < n; i++)
{
// Stores the product of digits
// of the current array element
int ans = digitProduct(arr[i]);
// If Product of digits is
// less than or equal to 1
if (ans <= 1)
{
continue;
}
// If Product of digits is
// not a prime
if (!prime[ans])
{
output.add(ans);
}
}
// Print the answer
System.out.print(output.size());
}
// Driver Code
public static void main(String[] args)
{
// Given array
int arr[] = { 13, 55, 7, 13, 11,
71, 233, 233, 144, 89 };
// Given size
int n = arr.length;
// Function call
DistinctCompositeDigitProduct(arr, n);
}
}
// This code is contributed by susmitakundugoaldanga
# Python3 program for the above approach
N = 100005
from math import sqrt
# Function to generate prime numbers
# using Sieve of Eratosthenes
def SieveOfEratosthenes(prime, p_size):
# Set 0 and 1 as non-prime
prime[0] = False
prime[1] = False
for p in range(2, int(sqrt(p_size)), 1):
# If p is a prime
if (prime[p]):
# Set all multiples of p as non-prime
for i in range(p * 2, p_size + 1, p):
prime[i] = False
# Function to calculate the product
# of digits of the given number
def digitProduct(number):
# Stores the product of digits
res = 1
while(number > 0):
# Extract digits and
# add to the sum
res *= (number % 10)
number //= 10
# Return the product
# of its digits
return res
# Function to print number of distinct
# values with digit product as composite
def DistinctCompositeDigitProduct(arr, n):
# Initialize set
output = set()
# Initialize boolean array
prime = [True for i in range(N + 1)]
# Pre-compute primes
SieveOfEratosthenes(prime, N)
# Traverse array
for i in range(n):
# of the current array element
ans = digitProduct(arr[i])
# If Product of digits is
# less than or equal to 1
if (ans <= 1):
continue
# If Product of digits is
# not a prime
if (prime[ans] == False):
output.add(ans)
# Print the answer
print(len(output))
# Driver Code
if __name__ == '__main__':
# Given array
arr = [13, 55, 7, 13, 11, 71, 233, 233, 144, 89]
# Given size
n = len(arr)
# Function call
DistinctCompositeDigitProduct(arr, n)
# This code is contributed by SURENDRA_GANGWAR.
// C# program for the above approach
using System;
using System.Collections.Generic;
class GFG{
static int N = 100005;
// Function to generate prime numbers
// using Sieve of Eratosthenes
static void SieveOfEratosthenes(bool[] prime,
int p_size)
{
// Set 0 and 1 as non-prime
prime[0] = false;
prime[1] = false;
for(int p = 2; p * p <= p_size; p++)
{
// If p is a prime
if (prime[p])
{
// Set all multiples of p as non-prime
for(int i = p * 2; i <= p_size; i += p)
prime[i] = false;
}
}
}
// Function to calculate the product
// of digits of the given number
static int digitProduct(int number)
{
// Stores the product of digits
int res = 1;
while (number > 0)
{
// Extract digits and
// add to the sum
res *= (number % 10);
number /= 10;
}
// Return the product
// of its digits
return res;
}
// Function to print number of distinct
// values with digit product as composite
static void DistinctCompositeDigitProduct(int[] arr,
int n)
{
// Initialize set
SortedSet<int> output = new SortedSet<int>();
// Initialize boolean array
bool[] prime = new bool[N + 1];
for(int i = 0; i < N + 1; i++)
{
prime[i] = true;
}
// Pre-compute primes
SieveOfEratosthenes(prime, N);
// Traverse array
for(int i = 0; i < n; i++)
{
// Stores the product of digits
// of the current array element
int ans = digitProduct(arr[i]);
// If Product of digits is
// less than or equal to 1
if (ans <= 1)
{
continue;
}
// If Product of digits is
// not a prime
if (!prime[ans])
{
output.Add(ans);
}
}
// Print the answer
Console.WriteLine(output.Count);
}
// Driver Code
public static void Main()
{
// Given array
int[] arr = { 13, 55, 7, 13, 11,
71, 233, 233, 144, 89 };
// Given size
int n = arr.Length;
// Function call
DistinctCompositeDigitProduct(arr, n);
}
}
// This code is contributed by sanjoy_62
<script>
// javascript program for the above approach
var N = 100005;
// Function to generate prime numbers
// using Sieve of Eratosthenes
function SieveOfEratosthenes(prime, p_size)
{
// Set 0 and 1 as non-prime
prime[0] = false;
prime[1] = false;
var p,i;
for (p = 2; p * p <= p_size; p++) {
// If p is a prime
if (prime[p]) {
// Set all multiples of p as non-prime
for (i = p * 2; i <= p_size; i += p)
prime[i] = false;
}
}
}
// Function to calculate the product
// of digits of the given number
function digitProduct(number)
{
// Stores the product of digits
var res = 1;
while (number > 0) {
// Extract digits and
// add to the sum
res *= (number % 10);
number = parseInt(number/10);
}
// Return the product
// of its digits
return res;
}
// Function to print number of distinct
// values with digit product as composite
function DistinctCompositeDigitProduct(arr, n)
{
// Initialize set
var output = new Set();
// Initialize boolean array
var prime = Array(N + 1).fill(true);
// Pre-compute primes
SieveOfEratosthenes(prime, N);
var i;
// Traverse array
for (i = 0; i < n; i++) {
// Stores the product of digits
// of the current array element
var ans = digitProduct(arr[i]);
// If Product of digits is
// less than or equal to 1
if (ans <= 1) {
continue;
}
// If Product of digits is
// not a prime
if (prime[ans]==false) {
output.add(ans);
}
}
// Print the answer
document.write(output.size);
}
// Driver Code
// Given array
var arr = [13, 55, 7, 13, 11,
71, 233, 233, 144, 89];
// Given size
var n = arr.length;
// Function call
DistinctCompositeDigitProduct(arr, n);
</script>
Time Complexity: O(N + MlogM), where N is the size of the given array and M is the maximum array element.
Auxiliary Space: O(1)
Similar Reads
Count pairs in an array whose product is composite number Given an array, arr[] of size N, the task is to count all the pairs of the given array whose product is a composite number. Examples: Input: arr[] = {1, 4, 7}Output: 2Explanation:Pairs whose product is a composite number are:(4, 7), (1, 4).Therefore, the required output is 2. Input: arr[] = {1, 2, 8
15 min read
Count of all subsequence whose product is a Composite number Given an array arr[], the task is to find the number of non-empty subsequences from the given array such that the product of subsequence is a composite number.Example: Input: arr[] = {2, 3, 4} Output: 5 Explanation: There are 5 subsequences whose product is composite number {4}, {2, 3}, {2, 4}, {3,
6 min read
Count numbers from a given range whose product of digits is K Given three positive integers L, R and K, the task is to count the numbers in the range [L, R] whose product of digits is equal to K Examples: Input: L = 1, R = 130, K = 14Output: 3Explanation: Numbers in the range [1, 100] whose sum of digits is K(= 14) are: 27 => 2 * 7 = 14 72 => 7 * 2 = 14
15+ min read
Count array elements whose all distinct digits appear in K Given an array arr[] consisting of N positive integers and a positive integer K, the task is to find the count of array elements whose distinct digits are a subset of the digits of K. Examples: Input: arr[] = { 1, 12, 1222, 13, 2 }, K = 12Output: 4Explanation: Distinct Digits of K are { 1, 2 } Disti
15 min read
Count of N-digit numbers whose bitwise AND of adjacent digits equals 0 Given a positive integer N, the task is to count the number of N-digit numbers such that the bitwise AND of adjacent digits equals 0. Examples: Input: N = 1Output: 10Explanation: All numbers from 0 to 9 satisfy the given condition as there is only one digit. Input: N = 3Output: 264 Naive Approach: T
8 min read