Given a number N, the task is to find the count of non-prime divisors of the given number N....
Given an integer number n, find the largest sum of digits in all divisors of n....
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 N.Examples:...
Given two numbers N and M, the task is to find the minimum number of moves to change N to M or -1 if it’s impossible. In one move, add to the current number any of its divisors not equal to 1 and the number itself....
Given two integer numbers, the task is to find the count of all common divisors of given numbers?...
Given a natural number n, print all distinct divisors of it....
Given a natural number n, print all distinct divisors of it....
Given a number N(1<=N<=109), the task is to find the total number of integers less than equal to n which have exactly 9 divisors....
Given three integers a, b, n .Your task is to print number of numbers between a and b including them also which have n-divisors. A number is called n-divisor if it has total n divisors including 1 and itself. Examples:...
Given a positive integer n, we have to find the total number of divisors for n....
Given n, find the smallest integer which has n factors or more. It may be assumed that the result is less than 1000001....
