# PROBLEM LINKS:

[Practice][1] [Contest][2]# DIFFICULTY:

Simple# PREREQUISITES:

Math, [Prime Factorization][3]# PROBLEM:

The aim is to find two numbers **x** and **y** such that **x * y = N** and **|y – x|** is as small as possible.# EXPLANATION:

This looks like a simple factorization problem, doesn't it?`ans = INF for x = 1 to N: if N mod x = 0: y = N / x is integer ans = min(ans, abs(y – x))`

However, the program written by the above logic will get TLE. The reason being, **N** can be as large as **10 ^{8}**. It is safe to assume that a loop over

**10**numbers will not take less than

^{8}**1**second on the CodeChef judge. And considering that the test data will have up to 100 such numbers, we cannot pass the time limit with the above solution.

The important trick here is to notice that when we consider some **x** in the above loop that is greater than **[sqrt(N)]** (the largest integer that is not greater than square root of **N**) then **y** will be less than **[sqrt(N)]** and it means that we have considered pair **(y, x)** earlier in this loop. Also for this pair we have the same absolute value of difference as for current pair **(x, y)** and hence we can simply skip values of **x** that are greater than **[sqrt(N)]** which transforms our program to the following one

`ans = INF for x = 1 to [sqrt(N)]: if N mod x = 0: y = N / x is integer ans = min(ans, y – x)`

This solution has complexity **O(sqrt(N))** for each test and since we have **T <= 100** tests in each test file it safely fits in the time limit. Note the we get rid of **abs** since **y** now is always not less than **x**.

Also, as **x** reaches closer to **[sqrt(N)]** on the number line, **y = N / x** also reaches closer to **[sqrt(N)]** from the other side, i.e. as **x** increases, **y** decreases. This means that the difference between **x** and **y** is decreasing as we continue through the loop. Hence, the answer will be the difference between **x** and **N / x** where **x** is the largest factor of **N** which is not greater than **[sqrt(N)]**. The solution can be further optimised as:

`ans = INF for x = [sqrt(N)] downto 1: if N mod x = 0: y = N / x ans = y – x break;`

# SETTER'S SOLUTION:

Can be found [here][4].## APPROACH:

The problem setter used the above approach to solve the problem.# TESTER'S SOLUTION:

Can be found [here][5].## APPROACH:

Here, the problem tester used the above approach to solve the problem.# ALTERNATE TESTER'S SOLUTION:

Can be found [here][6].## APPROACH:

This approach uses the Sieve of Eratosthenes algorithm for finding prime numbers. Using this, we find all the primes till sqrt(N) once and store them in an array. Since the maximum value of N is 10^{8}, it is enough to find the primes till sqrt(10^{8}) = 10^{4}.

Now, for every given N, we find all its prime factors and store them in an array. This can be done by looping over the prime numbers that we generated earlier and checking if each of it is a factor of N. We check for only those numbers which are not greater than sqrt(N). If any of those prime numbers is a factor, we calculate the degree of that factor. By degree of a factor we mean the number of times the factor divides the number. For example, 24 = 2^{3}.3^{1}. Here 2 (the prime factor) has a degree of 3 and 3(the next prime factor) has a degree of 1.

Next we try to generate all the divisors of N using the above information that we gathered. Initially our divisors array will have 1 in it (1 is a divisor of every number ). We can do this by going through each prime factor x, and multiply each element in the existing divisors array by x^{i} where 0<=i<=degree[x]. For example, let N = 84.

84 can be written as 2^{2}.3^{1}.7^{1}

Divisors: 1Prime Factor: 2New

Divisors: 2x1 , 2^{2}x1

Divisors: 1, 2, 4Prime Factor: 3New

Divisors: 1, 2, 4, 3, 6, 12

Divisors: 1, 2, 4, 3, 6, 12Prime

Factor: 7New Divisors: 1, 2, 4, 3, 6,

12, 7, 14, 28, 21, 42, 84

So we finally have the array of the entire divisors. Note that we do not have these divisors in the sorted order. So we will have to check for every divisor d, and check for the minimum difference of **|d – N/d|**.

This approach is asymptotically better than the previous approach. Let’s look at the complexity of this solution. Generating the primes using the sieve has **O(sqrt(N) * log log N)** complexity. And on an average, getting all the prime factors and generating the divisors of a number will take **O(sqrt(N)/log(N))** time. So the overall complexity is **O(sqrt(N) * log log N + T * sqrt(N) / log(N))** .