Meningkatkan elemen tanpa penggantian dalam program Java
Abhijit has an Array Arr which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e he changes an element X to M if X%M=0.
Your task is to tell whether the given array can be transformed to strictly increasing by performing the operation given above.
Cruel Centipede