## Divide N into K unique parts such that gcd of those parts is maximum

Given a positive integer N, the task is to divide it into K unique parts such that the sum of these parts is equal to… Read More »

- Count of integers that divide all the elements of the given array
- Subsequence X of length K such that gcd(X[0], X[1]) + (X[2], X[3]) + ... is maximized
- Find two co-prime integers such that the first divides A and the second divides B
- Count the number of subsequences of length k having equal LCM and HCF
- Find the number of pairs such that their gcd is equals to 1
- Nth number in a set of multiples of A , B or C
- GCD of elements which occur prime number of times
- Find numbers which are multiples of first array and factors of second array
- Sand Timer Flip Counting Problem
- Maximum count of common divisors of A and B such that all are co-primes to one another
- Find the ratio of number of elements in two Arrays from their individual and combined average

Given a positive integer N, the task is to divide it into K unique parts such that the sum of these parts is equal to… Read More »

Given an array arr[] of length N, the task is the find the length of the longest sub-array with maximum possible GCD value. Examples: Input:… Read More »

Given a point (A, B) such that distance from each point on the curve M.y = N.x2 + O.x + P with (A, B) is… Read More »

Given an array arr[] of length N, the task is to find the largest number dividing the maximum number of elements from the array. Examples:… Read More »

Given an array of positive distinct integers arr[], the task is to find the final number obtained by performing the following operation on the elements… Read More »

Given an array of integers, the task is to calculate the sum of GCD of all the subarrays of an array. GCD of an array… Read More »

Given an array arr[] of size N > 1. The task is to find the maximum possible GCD of the array by replacing at most… Read More »

Given N types of money denomination in a country as an array arr[]. A person and the shopkeeper can choose notes of each denomination any… Read More »

Given an array arr[], the task is to find the count of sub-arrays with GCD equal to 1. Examples: Input: arr[] = {1, 1, 1}… Read More »

Given an array health[] where health[i] is the health of the ith player in a game, any player can attack any other player in the… Read More »

Given an array arr[], the task is to find the smallest sub-arrays with GCD equal to 1. If there is no such sub-array then print… Read More »

Given an array arr[], the task is to find the number of sub-arrays with GCD value equal to 1. Examples: Input: arr[] = {1, 1,… Read More »

Given an array arr[] of length N, the task is to find the length of the longest sub-sequence with maximum possible GCD. Examples: Input: arr[]… Read More »

Given the average of elements in two arrays as ‘a’ and ‘b’ respectively, and their combined average as ‘c’, the task is to find the… Read More »

Given two arrays A[] and B[], the task is to find the integers which are divisible by all the elements of array A[] and divide… Read More »