Team P-3: The Locker Puzzle
Team #: ____________________
Problem Description:
A school has 100 lockers and 100 students. All lockers are closed on the first day of school. As the
students enter, the first student, denoted S1, opens every locker. Then the second student, S2, begins
with the second locker, denoted L2, and closes every other locker. Student S3 begins with the third
locker and changes every third locker (closes it if it was open, and opens it if it was closed). Student S4
egins with locker L4 and changes every fourth locker. Student S5 starts with L5 and changes every fifth
locker, and so on, until student S100 changes L100.
After all the students have passed through the building and changed the lockers, which lockers are
open? Write a program to find your answer. The program should display the answer like this:
Locker x is open
Locker y is open
…
Locker z is open
(Hint: Use an a
ay of 100 boolean elements, each of which indicates whether a locker is open (true) or
closed (false). Initially, all lockers are closed.
Analysis:
(Describe the problem including input and output in your own words.)
Design:
(Describe the major steps for solving the problem.)
Coding: (Copy and Paste Source Code here. Format your code using Courier 10pts)
Testing: (capture your runtime screen shots)
Submit your compressed project in Blackboard. To submit your Java project, first create a zip file for
your Java project folder. In Blackboard, click on the I-C-6 link. Click on Browse to upload your Word
document, project runtime screen shots and the compressed Java project file. Click on the Submit
utton to complete the process.