ADACON - Ada and Connections
Ada the Ladybug was on a trip with her friends. They each bought a souvenir there. As all of them are mathematicians, everybody bought a number. They want to modify the numbers to have some connection between each other. They have decided to modify the numbers sou they would have their GCD greater than 1 ( gcd(a1,a2,a3,...,aN)>1). Anyway it is not easy to change a number - the only thing they can do is to go to a proffesor in mathematics, which could forge a number A into number A+1 or A-1. As this operation is not cheap, they want to minimize number of such operations. A number might be forged any number of times.
NOTE: gcd(a,0)==a (so gcd of two 0 is also 0)
The first line contains an integer 1 ≤ N ≤ 3*105, the number of friend who were on trip (and also the number of numbers).
The second line contains N integers 0 ≤ ai ≤ 106
Print a single line with minimum number of operations to make a connection between all numbers.
5 3 9 7 6 31
Example Input 2
9 3 4 5 7 8 9 11 12 13
Example Output 2
Example Input 3
5 7 7 11 17 1
Example Output 3
Last edit: 2020-06-12 22:02:47
@Rohit Agarwal you can add 1 to each number to make them all even and so gcd(array) = 2.
@morass: Could you please explain the last testcase? Why the answer is 5?Last edit: 2018-11-20 16:36:41
Getting WA, any testcases guys?
is there a solution i am starting to get disinterested i got tle with java following @manya_cod4 tip but i think approach is different :(
hey can anyone tell me what is there complexity?
@morass what is the expected time complexity of this problem.? mine is n * (number of prime numbers upto largest number )
I think it's my fault in misunderstanding the problem))) I was bound to guess that the solution must exist in any case. Meanwhile you could set one more problem (say ADACON0) with restricted rules for changing Ai ;)
@feodorv: Even though it you passed a few test-cases :P Anyway sorry for unclear statement :/
Oh, so i am solving other problem)))