Consider a long alley with a N number of doors on one side. All the doors are closed initially. You move to and fro in the alley changing the states of the doors as follows: you open a door that is already closed and you close a door that is already opened. You start at one end go on altering the state of the doors till you reach the other end and then you come back and start altering the states of the doors again.
In the first go, you alter the states of doors numbered 1, 2, 3, … , n.
In the second go, you alter the states of doors numbered 2, 4, 6…
In the third go, you alter the states of doors numbered 3, 6, 9 …
You continue this till the Nth go in which you alter the state of the door numbered N.
You have to find the number of open doors at the end of the procedure.
Input: N = 2 Output: 1 Explanation: Initially all doors are closed. After 1st go, all doors will be opened. After 2nd go second door will be closed. So, Only 1st door will remain Open.
Input: N = 4 Output: 2 Explanation: Following the sequence 4 times, we can see that only 1st and 4th doors will remain open.
You don't need to read input or print anything. Your task is to complete the function noOfOpenDoors() which takes an Integer N as input and returns the answer.
Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)
1 <= N <= 1012
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes