## Minimum number of moves to reach N starting from (1, 1)

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… 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
- Largest odd divisor Game to check which player wins
- 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 3
- Find elements in a given range having at least one odd divisor
- Sum of all divisors from 1 to N | Set 2
- Coprime divisors of a number
- Check if a number exists with X divisors out of which Y are composite
- Count of square free divisors of a given number

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More »

Given an integer N, the task is to find all of its divisors using its prime factorization. Examples: Input: N = 6 Output: 1 2… Read More »

Given two integers K and N, the task is to find the count of integers from the range [2, N – 1] whose sum of… Read More »

Given an array A of size N (> 2). The task is to find the maximum value of A[i] / A[j] Note: A[i] ≠ 0.… Read More »

Given an integer N( 2 <= N <= 10^9 ), split the number into one or more parts(possibly none), where each part must be greater… Read More »

Given an integer N and the sum of its divisors. The task is to find the sum of the inverse of the divisors of N.… Read More »

Given an integer array arr[], the task is to check if that array contains all the divisor of some integer. Examples: Input: arr[] = {… Read More »

Given an array arr[] of N integers. The integers represent all the divisors of a number X except 1 and X itself. The task is… Read More »

Given three integers A, B, C, the task is to find ΣAi=1 ΣBj=1ΣCk=1 d(i.j.k), where d(x) is the number of divisors of x. Answer can… Read More »

Given an integer N. The task is to find the number of integers 1 < x < N, for which x and x + 1… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given two positive integers N and M., The task is to find the smallest divisor D of N such that gcd(D, M) > 1. If… Read More »

Given a range [l, r], the task is to find the sum of all the odd factors of the numbers from the given range. Examples:… Read More »

Given an array arr[] of integers, the task is to find the element (other than 1) which is the factor of maximum number of elements… Read More »

Given two positive integers N and M, the task is to find the smallest positive integer which is divisible by N and whose digit sum… Read More »