INT The program below, while has the correct output, doesn't follow the game's logic at all. Instead, it follows a certain pattern that's present in the game. Consider the 10eth locker. Following the games rules, this locker should be visited by the 1st, 2nd, 3rd, 4th, 5th, 1eth, 20th, 25th, 50th, and 10eth student. Coincidentally, these are also the positive divisors of 10e. Similarly, the 30th locker is visited by the students whose numbers are 1, 2, 3, 5, 6, 10, 15, and 30. Note that if the numbers of positive divisors of a locker number is odd, then at the end of the game, the locker is open. if the numbers of positive divisors of a locker number is * even, then at the end of the game, the locker is closed. */ import java.util.Random; public class Locker{ public static void main(String[] args){ Scanner keyboard = new Scanner(System.in); int studentVisitCount = 0; System.out.print("Enter the number of lockers: "); int numberofLockers = console.nextInt(); for(int x=0; x<=number0fLockers; x++){ if(x%y==0){ studentVisitCount--; for (int y=0; y<=x; y++){ if(studentVisitCount%3!=0){ System.out.print(y+" "); } } } System.out.println("The number of lockers and students are: "+number0fLockers); System.out.print("The locker numbers left open at the end of the game are: "); }
INT The program below, while has the correct output, doesn't follow the game's logic at all. Instead, it follows a certain pattern that's present in the game. Consider the 10eth locker. Following the games rules, this locker should be visited by the 1st, 2nd, 3rd, 4th, 5th, 1eth, 20th, 25th, 50th, and 10eth student. Coincidentally, these are also the positive divisors of 10e. Similarly, the 30th locker is visited by the students whose numbers are 1, 2, 3, 5, 6, 10, 15, and 30. Note that if the numbers of positive divisors of a locker number is odd, then at the end of the game, the locker is open. if the numbers of positive divisors of a locker number is * even, then at the end of the game, the locker is closed. */ import java.util.Random; public class Locker{ public static void main(String[] args){ Scanner keyboard = new Scanner(System.in); int studentVisitCount = 0; System.out.print("Enter the number of lockers: "); int numberofLockers = console.nextInt(); for(int x=0; x<=number0fLockers; x++){ if(x%y==0){ studentVisitCount--; for (int y=0; y<=x; y++){ if(studentVisitCount%3!=0){ System.out.print(y+" "); } } } System.out.println("The number of lockers and students are: "+number0fLockers); System.out.print("The locker numbers left open at the end of the game are: "); }
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
comment what each line does in the program
![/**
The program below, while has the correct output, doesn't follow the game's logic at all.
Instead, it follows a certain pattern that's present in the game.
Consider the 100th locker. Following the games rules, this locker should be visited by the 1st,
2nd,
3rd, 4th, 5th, 10th, 20th, 25th, 50th, and 100th student. Coincidentally, these are also the
positive
divisors of 100. Similarly, the 30th locker is visited by the students whose numbers are 1, 2,
3, 5,
6, 10, 15, and 30. Note that if the numbers of positive divisors of a locker number is odd, then
at
the end of the game, the locker is open. if the numbers of positive divisors of a locker number
is * even, then at the end of the game, the locker is closed. */
import java.util. Random; public
class Locker{
public static void main(String[] args){
Scanner keyboard = new Scanner(System.in);
int studentVisitCount = 0;
System.out.print("Enter the number of lockers: ");
int numberofLockers = console.nextInt();
for(int x=0; x<=number0fLockers; x++){
if(x%y==0){
studentVisitCount--;
}
for (int y=0; y<=x; y++){
if(studentVisitCount%3!=0){
System.out.print(y+" ");
}
}
System.out.println("The number of lockers and students are: "+numberofLockers);
System.out.print("The locker numbers left open at the end of the game are: ");
}
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F65995b94-2dd7-4a67-a870-8a89877dce6c%2F4426caea-ff64-4edc-b344-d91d3e5a8e1b%2Fv24nsyb_processed.png&w=3840&q=75)
Transcribed Image Text:/**
The program below, while has the correct output, doesn't follow the game's logic at all.
Instead, it follows a certain pattern that's present in the game.
Consider the 100th locker. Following the games rules, this locker should be visited by the 1st,
2nd,
3rd, 4th, 5th, 10th, 20th, 25th, 50th, and 100th student. Coincidentally, these are also the
positive
divisors of 100. Similarly, the 30th locker is visited by the students whose numbers are 1, 2,
3, 5,
6, 10, 15, and 30. Note that if the numbers of positive divisors of a locker number is odd, then
at
the end of the game, the locker is open. if the numbers of positive divisors of a locker number
is * even, then at the end of the game, the locker is closed. */
import java.util. Random; public
class Locker{
public static void main(String[] args){
Scanner keyboard = new Scanner(System.in);
int studentVisitCount = 0;
System.out.print("Enter the number of lockers: ");
int numberofLockers = console.nextInt();
for(int x=0; x<=number0fLockers; x++){
if(x%y==0){
studentVisitCount--;
}
for (int y=0; y<=x; y++){
if(studentVisitCount%3!=0){
System.out.print(y+" ");
}
}
System.out.println("The number of lockers and students are: "+numberofLockers);
System.out.print("The locker numbers left open at the end of the game are: ");
}
}
Transcribed Image Text:3. Consider the following scenario:
A high school has 1000 students and 1000 lockers, one locker for each student. On the first day
of school, the principal plays the following game: She asks the first student to open all the
lockers. She then asks the second student to close all the even-numbered lockers. The third
student is asked to check every third locker. If it is open, the student closes it; if it is closed, the
student opens it. The fourth student is asked to check every fourth locker. If it is open, the
student closes it; if it is closed, the student opens it. The remaining students continue this game.
In general, the nth student checks every nth locker. If it is open, the student closes it; if it is
closed, the student opens it. After all the students have taken turns, some of the lockers are
open and some are closed.
The program below, when ran, will prompt the user to enter the number of lockers in the
school. After the game is over, the program will output the number of lockers and the lockers
numbers of the lockers that are open. However, the statements are in the wrong order, and
there are some bugs in this program. Rearrange the statements and also find and remove the
bugs so that the program can run properly. RENAME THE CLASS TO
"LASTNAME_CLASSCODE_LOCKER".
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY