LockersDivTwo
Member SRM 482 · 2010-03-12 · by pieguy
Problem Statement
A hallway is filled with lockers numbered 1 through N, initially all closed. Out of boredom, Dave and Earl decide to open all the lockers. They make multiple passes through the hallway, each beginning at locker 1. On the first pass, they open the first unopened locker, and every second unopened locker thereafter. On the second pass, they open the first unopened locker, and every third unopened locker thereafter. In general, on the nth pass, they open the first unopened locker, and every (n+1)th unopened locker thereafter.
For example, with 9 lockers, on the first pass they open 1, 3, 5, 7, and 9, leaving 2, 4, 6, and 8. On the second pass they open 2 and 8, leaving 4 and 6. On the third pass they open locker 4, and on the final pass locker 6.
You will be given N, the number of lockers. Return the number of the locker opened last.
Constraints
- N will be between 1 and 10000, inclusive.
9 Returns: 6
The example from the problem statement.
42 Returns: 42
314 Returns: 282
10000 Returns: 9894
1 Returns: 1
Submissions are judged against all 106 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Language: C++17 · define a public class LockersDivTwo with a public method int lastOpened(int N) · 106 test cases · 2 s / 256 MB per case