## Number of divisors of product of N numbers

Given an array arr[] of integers, the task is to count the number of divisors of product of all the elements from given array. Examples:… Read More »

- Generate elements of the array following given conditions
- Program to find the Nth Prime Number
- Check if each element of the given array is the product of exactly K prime numbers
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Check if the given string is vowel prime
- Sum of all odd factors of numbers in the range [l, r]
- Largest number not greater than N which can become prime after rearranging its digits
- Sum of all even factors of numbers in the range [l, r]
- Count the number of primes in the prefix sum array of the given array
- Sum of Semi-Prime Numbers less than or equal to N
- Find prime number K in an array such that (A[i] % K) is maximum
- Sum of multiplication of triplet of divisors of a number
- Count of distinct sums that can be obtained by adding prime numbers from given arrays
- Product of Primes of all Subsets
- Check for an array element that is co-prime with all others
- Queries for the difference between the count of composite and prime numbers in a given range
- Check whether N is a Dihedral Prime Number or not
- Find the sum of all Truncatable primes below N
- Rearrange the given string such that all prime multiple indexes have same character
- Sum of prime numbers without odd prime digits
- Square free semiprimes in a given range using C++ STL

Given an array arr[] of integers, the task is to count the number of divisors of product of all the elements from given array. Examples:… Read More »

Given an array arr[] of non-negative integers where 2 ≤ arr[i] ≤ 106. The task is to find the sum of all those elements from… Read More »

Given an array arr[] of integers, the task is to print the largest palindromic prime from the array. If no element from the array is… Read More »

Given two integers N and K, the task is to count all the numbers < N which have equal number of positive divisors as K.… Read More »

Given an array arr[], the task is to check whether the sum of primes in the array is divisible by any of the primes in… Read More »

Given an array arr, the task is to find the sum of the elements which have prime frequencies in the array. Note: 1 is neither… Read More »

Given two integer and , the task is to find the common prime divisors of these numbers. Examples: Input: A = 6, B = 12… Read More »

Given an array having N elements. The task is to check if the sum of prime elements of the array is prime or not. Examples:… Read More »

Given a prime number . The task is to check if it is possible to express as sum of two separate prime numbers. Note: The… Read More »

Given an array containing n distinct numbers. The task is to find the smallest prime which is not present in the array. Note: If there… Read More »

Given an array A[] of N non-negative integers. Find an Integer greater than 1, such that maximum array elements are divisible by it. In case… Read More »

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

Given an integer k and an array of integers arr (less than 10^6), the task is to find the sum of every k’th prime number… Read More »

Given an integer . The task is to find the superpower from the factorization of . The Superpower is the highest power among the power… Read More »

Given an array arr[] of N positive integers. The task is to find the sum of all composite elements which are divisible by a given… Read More »