Skip to content

Tag Archives: sieve

Given an array arr[] consisting of N integers such that each array element arr[i] represent coefficients of a polynomial expression starting with the highest degree(A[0].X(N… Read More
Given an integer N, repeatedly choose two distinct integers from the range 2 to N and if their GCD is found to be greater than… Read More
Given a positive integer N, the task is to calculate the Bitwise XOR of first N numbers which are a product of exactly two distinct… Read More
Given an array arr[] of size N, the task is to find the index in the given array where the sum of the prime numbers… Read More
Given an array arr[] consisting of N positive integers, the task is to find an index from the array having count of prime numbers present… Read More
Given a positive integer N, the task is to count the number of integers from the range [1, N] having exactly 5 divisors. Examples: Input:… Read More
Given an array arr[] of size N, the task is to rearrange the array elements such that all the Prime numbers are placed before the… Read More
Given a positive integer N, the task is to find the absolute difference of the count of odd and even factors of N. Examples: Input:… Read More
Given a positive integer N, the task is to find the Nth Composite Number. Examples: Input: N = 1Output: 4 Input: N = 3 Output: 8… Read More
Given an array arr[] consisting of N positive integers, the task is to find the number of array elements whose count of divisors is a… Read More
Given a positive integer N, the task is to find the count of prime numbers less than or equal to N that can be represented… Read More
Given a positive integer N, the task is to find the smallest semi-prime number such that the difference between any of its two divisors is… Read More
Given a positive integer N, the task is to check if N can be represented as a sum of a Prime Number and a Perfect… Read More
Given an integer N, the task is to count numbers from the range [1, N] which are the power of prime numbers. Examples: Input: N… Read More