# Tag Archives: divisors

Given an array A[] with N integers, for each integer A[i] in the array, the task is to find the number of integers A[j] (j… Read More
Given a positive integer N, the task is to find the number of binary strings of length N that are repeated concatenation of only one… Read More
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… Read More
Given a positive integer N, the task is to find the Nth smallest number in the sequence which is having exactly 4 divisors. Examples: Input:… Read More
Given a number N, the task is to find the sum of all the prime factors of N.  Examples: Input: 10Output: 7Explanation: 2, 5 are… Read More
Given an array arr[] consisting of N integers, the task is to find the number of pairs, where i ≤ j, such that the sum… Read More
Given a positive integer N, the task is to print all the numbers, say K, such that K is a divisor of N and K… Read More
Given a positive integer N, the task is to find the minimum number of operations required to reduce N to 1 by repeatedly dividing N… Read More
Given an array arr[] consisting of N positive integers and an array Query[] consisting of Q queries of the form {L, R}, the task is… Read More
Given an array arr[] consisting of N positive integers, the task is to find the number of array elements whose count of divisors is a… Read More
Given a positive integer N, the task is to generate an array such that the sum of the Euler Totient Function of each element is… Read More
Given an array arr[] consisting of N integers and an integer X, the task is to check if it is possible to modify the array… Read More
Given two positive integers N and K, the task is to find the sum of the quotients of the division of N by powers of… Read More
Given a positive integer N, the task is to check if the given number N has at least 1 odd divisor from the range [2,… Read More
Given an array arr[] consisting of N natural numbers, the task is to find the length of the longest subsequence from the array which does… Read More