## Sum of all second largest divisors after splitting a number into one or more parts

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 »

- Find two numbers whose divisors are given in a random order
- Smallest integer with digit sum M and multiple of N
- Find sum of inverse of the divisors when sum of divisors and the number is given
- Find integers that divides maximum number of elements of the array
- Sum of all second largest divisors after splitting a number into one or more parts
- Sum of all odd factors of numbers in the range [l, r]
- Find number from its divisors
- Find the sum of the number of divisors
- Check if the given array contains all the divisors of some integer
- Sum of multiplication of triplet of divisors of a number
- Maximum sum after repeatedly dividing N by a divisor
- Smallest divisor D of N such that gcd(D, M) is greater than 1
- Find the number of integers x in range (1,N) for which x and x+1 have same number of divisors

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 »

Given an integer N. The task is to find the maximum possible sum of intermediate values (Including N and 1) attained after applying the beow… Read More »

Given an array of N numbers which has all divisors of two numbers in any order. The task is to find the two numbers whose… Read More »

Given a number N. The task is to express N as sum two Abundant Numbers. If it is not possible print -1. Examples: Input :… Read More »

Given a number N. FInd the sum of he all amicable numbers up to N. If A and B are Amicable pairs (Two numbers are… Read More »