# Tag Archives: divisors

## Number formed after K times repeated addition of smallest divisor of N

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 »

## Sum of all perfect square divisors of numbers from 1 to N

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:… Read More »

## Check if count of even divisors of N is equal to count of odd divisors

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 »

## Count of the non-prime divisors of a given number

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:… Read More »

## Find the sum of all Betrothed numbers up to N

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 »

## Smallest number to make Array sum at most K by dividing each element

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 »

## Count of triplets (a, b, c) in the Array such that a divides b and b divides c

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 »

## Maximum possible prime divisors that can exist in numbers having exactly N divisors

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 »

## Count the nodes in the given Tree whose weight is a Perfect Number

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 »

## Length of largest subarray whose all elements Powerful number

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 »

## Count of divisors of product of an Array in range L to R for Q queries

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 »

## Sum of product of proper divisors of all Numbers lying in range [L, R]

Given an array arr[][] consisting of Q queries where every row consists of two numbers L and R which denotes the range [L, R]; the… Read More »

## Common divisors of N numbers

Given an array arr[] of N integers. The task is to find all the common divisors of all N integers. Examples Input: arr[] = {6,… Read More »

## Palindromic divisors of a number

Prerequiste: Find all divisors of a natural number Given a number N. The task is to find all the palindromic divisors of N. Examples: Input:… Read More »

## Largest Divisor for each element in an array other than 1 and the number itself

Given an array arr[] of N integers, the task is to find the largest divisor for each element in an array other than 1 and… Read More »