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);
}
}
}
}

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

【算法-----＞Locker Doors】
LockerDoors 题目输入输出代码实现(Java) 例子题目 There are n lockers in a hallway numbered sequentially from 1 ...
SWUSTOJ #480 Locker doors
SWUSTOJ #480 Locker doors 题目输入输出样例输入样例输出源代码题目 There are n lockers in a hallway numbered sequen ...
Craking the Interview-1
1.6 90度旋转NxN矩阵 Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes ...
Google面试之快乐智力题（Cracking the Coding Interview）
问:有20瓶药,其中19瓶装的都是1.0克的药片,只有1瓶装了1.1克的药.给你一个能称出具体克数的电子秤,只允许你称一次,怎么找出那瓶不一样的? 答:如果药片足够,从第i(1<i<20) ...
计算机导论简答芯片,吉大计算机 - 计算机导论简答题 (2011级)
C1 2. Q: What model is the basis for today's computers? A: Von Neumann Model. 5. Q: What are the sub ...
正则表达式语法规则收集
turnmissile 的 Blog http://blog.csdn.net/turnmissile/ Microsoft已经把正则表达式的规则收录在了msdn里面了,有兴趣的朋友可以自己去研究一下 ...
NYOJ-232 How to eat more Banana
How to eat more Banana 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 A group of researchers are designing a ...
HDOJ 1069 Monkey and Banana
1:每一组X,Y,Z对应3个立方体 2:按面积从小到大DP Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...
HDU 1069 Monkey and Banana 最长上升子序列进阶（动态规划）
HDU 1069(动态规划) Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K ...

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

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

最新文章

热门文章