## Querying maximum number of divisors that a number in a given range has

Given Q queries, of type: L R, for each query you must print the maximum number of divisors that a number x (L <= x… Read More »

## Exactly n distinct prime factor numbers from a to b

You are given two numbers a and b (1 <= a,b <= 10^8 ) and n. The task is to find all numbers between a… Read More »

## N’th Smart Number

Given a number n, find n’th smart number (1<=n<=1000). Smart number is a number which has at least three distinct prime factors. We are given… Read More »

## Least prime factor of numbers till n

Given a number n, print least prime factors of all numbers from 1 to n. The least prime factor of an integer n is the… Read More »

## Print all prime factors and their powers

Given a number N, print all its unique prime factors and their powers in N. Examples: Input: N = 100 Output: Factor Power 2 2… Read More »

## How to prepare for ACM – ICPC?

ACM ICPC(Association for Computing Machinery – International Collegiate Programming Contest) is a world-wide annual multi-tiered programming contest being organized for over thirteen years. The contest… Read More »

## Count Divisors of Factorial

Given a number n, count total number of divisors of n!. Examples: Input : n = 4 Output: 24 4! is 24. Divisors of 24… Read More »

## VMware Interview Experience | Set 7 (On-Campus for IT Application Developer)

Round 1: Online Multiple Choice Questions It comprised of two sections. First section consisted around 15-20 questions related to logical reasoning (Quantitative – Easy-medium-level) and… Read More »

## VMware Interview Experience | Set 6 (On-Campus for IT Application Developer)

VMWare visited an extension centre of our campus for hiring IT App Developer. Round 1 The first round a written one, conducted on HirePro platform.… Read More »

## VMware Interview Experience | Set 5 (On-Campus for IT Application Developer)

Round 1: ONLINE OBJECTIVE ROUND on HIREPRO platform This round comprised of 30 objective difficult and lengthy paragraph based aptitude questions to be solved in… Read More »

## Palindromic Primes

A palindromic prime (sometimes called a palprime) is a prime number that is also a palindromic number. Given a number n, print all palindromic primes… Read More »

## No of Factors of n!

Given a positive integer n, find the no of factors in n! where n <= 105. Examples : Input : n = 3 Output :… Read More »

## Find all divisors of a natural number | Set 2

Given a natural number n, print all distinct divisors of it. Examples: Input : n = 10 Output: 1 2 5 10 Input: n =… Read More »

## Find all divisors of a natural number | Set 1

Given a natural number n, print all distinct divisors of it. Examples : Input : n = 10 Output: 1 2 5 10 Input: n… Read More »

## Sieve of Atkin

Given a limit, print all primes smaller than or equal to the given limit. Examples : Input: limit = 10 Output: 2, 3, 5, 7… Read More »