##
Find politeness of a number
March 24, 2017

Given an integer n. Find politeness of number n. Politeness of a number is defined as the number of ways it can be expressed as… Read More »

March 24, 2017

Given an integer n. Find politeness of number n. Politeness of a number is defined as the number of ways it can be expressed as… Read More »

March 23, 2017

Given two numbers x and n, find number of ways x can be expressed as sum of n-th power of unique natural numbers. Examples: Input… Read More »

Given an integer n. Check whether the number n is superperfect number or not. A superperfect number is a positive integer which satisfies σ2(n) =… Read More »

March 22, 2017

Given a number, the task is to check if a number is divisible by 4 or not. The input number may be large and it… Read More »

March 21, 2017

Given two numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find difference of… Read More »

Given a number n, find all generators of cyclic additive group under modulo n. Generator of a set {0, 1, … n-1} is an element… Read More »

March 20, 2017

Given an integer n. Check whether the number is refactorable or not. A refactorable number is an integer n that is divisible by count of… Read More »

March 19, 2017

Given a number, the task is that we divide number by 3. The input number may be large and it may not be possible to… Read More »

March 18, 2017

Given two numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find sum of… Read More »

Given a number, the task is to check if the number is divisible by 11 or not. The input number may be large and it… Read More »

Given two integers n and k, Find the lexicographical nth palindrome of k digits. Input : n = 5, k = 4 Output : 1441… Read More »

March 14, 2017

Given a number n, count total perfect divisors of n. Perfect divisors are those divisors which are square of some integer. For example a perfect… Read More »

March 11, 2017

Given a number N, find sum of all GCDs that can be formed by selecting all the pairs from 1 to N. Input : 4… Read More »

March 10, 2017

We can calculate the prime factorization of a number “n” in O(sqrt(n)) as discussed here. But O(sqrt n) method times out when we need to… Read More »

March 9, 2017

A Seed of a number n is a number x such that multiplication of x with its digits is equal to n. The task is… Read More »