## Count of Array elements to be divided by 2 to make at least K elements equal

Given an integer array arr[] of size N, the task is to find the minimum number of array elements required to be divided by 2,… Read More »

- Smallest number to make Array sum at most K by dividing each element
- Largest Divisor for each element in an array other than 1 and the number itself
- Sum of product of proper divisors of all Numbers lying in range [L, R]
- Common divisors of N numbers
- Count of divisors of product of an Array in range L to R for Q queries
- Count the nodes in the given Tree whose weight is a Perfect Number
- Count of the non-prime divisors of a given number
- Count of triplets (a, b, c) in the Array such that a divides b and b divides c
- Probability that an arbitrary positive divisor of 10^X is an integral multiple of 10^Y
- Length of largest subarray whose all elements Powerful number
- Maximum possible prime divisors that can exist in numbers having exactly N divisors
- Number formed after K times repeated addition of smallest divisor of N
- Check if count of even divisors of N is equal to count of odd divisors
- Maximize sum of minimum difference of divisors of nodes in N-ary tree
- Sum of all perfect square divisors of numbers from 1 to N
- Find the sum of all Betrothed numbers up to N
- Count all pairs of divisors of a number N whose sum is coprime with N
- Palindromic divisors of a number

Given an integer array arr[] of size N, the task is to find the minimum number of array elements required to be divided by 2,… Read More »

Given an array arr[] of N positive integers and the number of queries Q, each query contains two numbers L and R. The task is… Read More »

Given two integers N and M, the task is to print all elements in the range [N, M] having at least one odd divisor. Examples:… Read More »

A number N is said to be Primitive Abundant Number if N is an Abundant number and all it’s proper divisors are Deficient Numbers. The… Read More »

A number N is said to be Multiply-perfect numbers if N divides sigma(N), where sigma(N) = sum of all divisors of N. The first few… Read More »

Given a positive integer N, the task is to find the sum of divisors of first N natural numbers. Examples: Input: N = 4 Output:… Read More »

Given two integers X and Y representing total number of divisors and the number of composite divisors respectively, the task is to check if there… Read More »

Given an integer N, the task is to count all pairs of divisors of N such that the sum of each pair is coprime with… Read More »

Given a n-ary tree having nodes with a particular weight, our task is to find out the maximum sum of the minimum difference of divisors… Read More »

Given two numbers X and Y, the task is to find the probability that an arbitrary positive divisor of 10X is an integral multiple of… Read More »

Given two integers N and K, the task is to generate the final outcome of performing K operations which involves adding the smallest divisor, other… Read More »

Given a number N, the task is to find the sum of all the perfect square divisors of numbers from 1 to N. Examples: Input:… Read More »

Given a positive integer N, the task is to check whether the count of even divisors and odd divisors of N are equal or not.… Read More »

Given a number N, the task is to find the count of non-prime divisors of the given number N. Examples: Input: N = 8 Output:… Read More »

Given a number N, the task is to find the sum of the all Betrothed numbers up to N. Let, A and B are a… Read More »