Skip to content

Tag Archives: divisors

Given two integers X and Y representing the total number of divisors and the number of composite divisors respectively, the task is to check if… Read More
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… Read More
Given a n-ary tree having nodes with a particular weight, our task is to find out the maximum sum of the minimum difference of divisors… Read More
Given two numbers X and Y, the task is to find the probability that an arbitrary positive divisor of 10X is an integral multiple of… Read More
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: N… 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: 3 Explanation: Divisors… 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

Start Your Coding Journey Now!