## Number formed after K times repeated addition of smallest divisor of N

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 »

- 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
- Maximize sum of minimum difference of divisors of nodes in N-ary tree
- Check if count of even divisors of N is equal to count of odd divisors
- Sum of all perfect square divisors of numbers from 1 to N
- Largest odd divisor Game to check which player wins
- 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
- Smallest N digit number with none of its digits as its divisor
- Palindromic divisors of a number
- Sum of all divisors from 1 to N | Set 2
- Sum of all divisors from 1 to N | Set 3
- Count of Array elements to be divided by 2 to make at least K elements equal
- Check if a number exists with X divisors out of which Y are composite
- Find elements in a given range having at least one odd divisor
- Coprime divisors of a number
- Count of square free divisors of a given number

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 »

Given an array arr[] of size N and a number K, the task is to find the smallest number M such that the sum of… Read More »

Given an array arr[] of positive integers of size N, the task is to count number of triplets in the array such that a[i] divides… Read More »

Given an integer N which denotes the number of divisors of any number, the task is to find the maximum prime divisors that are possible… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a Perfect number.… Read More »

Given an array arr[] of integer elements, the task is to find the length of the largest sub-array of arr[] such that all the elements… Read More »

Given an array arr of size N and Q queries of the form [L, R], the task is to find the number of divisors of… Read More »

Given an array arr[][] consisting of Q queries where every row consists of two numbers L and R which denotes the range [L, R]; the… Read More »

Given an array arr[] of N integers. The task is to find all the common divisors of all N integers. Examples Input: arr[] = {6,… Read More »

Prerequiste: Find all divisors of a natural number Given a number N. The task is to find all the palindromic divisors of N. Examples: Input:… Read More »

Given an array arr[] of N integers, the task is to find the largest divisor for each element in an array other than 1 and… Read More »