There are n lockers in a hallway numbered sequentially from 1 to n. Initially, all the locker doors

package xuexi;
/*
 * n把锁问题
 */
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;


public class Locker {
public static void main(String[] args) {
System.out.println("请输入N的值：");
Scanner input=new Scanner(System.in);
int t=input.nextInt();
door s=new door();
s.siwith(t);
}

}
class door{
public void siwith(int n){
int locker []=new int[n+1];
for(int i=1;i<n;i++){
locker[i]=0;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j%i==0){
locker[j]=(locker[j]==0)?1:0;
}
}
}
for(int i=1;i<n;i++){
if(locker[i]==0){
System.out.println(i);
}
}
}
}