多线程算法题：国王、毒酒、侍卫

public class Client {

	public static void main(String[] args) {
		HashMap<Integer,Boolean> jiuMap = getJiuMap(100);
		HashMap<Integer,Boolean> shiMap = getShiMap(7);
		for (Map.Entry<Integer,Boolean> entryShi : shiMap.entrySet()) {
			for (Map.Entry<Integer,Boolean> entryJiu : jiuMap.entrySet()) {
				if((entryShi.getKey() & entryJiu.getKey()) == entryShi.getKey()){
					if(!entryJiu.getValue().booleanValue()){
						entryShi.setValue(false);
					}
				}
			}
		}
		//try { Thread.sleep(30*60*1000); } catch (InterruptedException e) {}
		int dujiu = 0;
		for (Map.Entry<Integer,Boolean> entryShi : shiMap.entrySet()) {
			if(!entryShi.getValue()){
				dujiu = dujiu | entryShi.getKey();
			}
		}
		System.out.println("毒酒二进制："+Integer.toBinaryString(dujiu));
	}
	
	private static HashMap<Integer,Boolean> getShiMap(int shiNumber) {
		System.out.println("侍卫数："+shiNumber);
		HashMap<Integer,Boolean> shiMap = new HashMap<Integer,Boolean>();
		for (int i = 0; i < shiNumber; i++) {
			int shi = 1 << i;
			shiMap.put(shi, true);
		}
		return shiMap;
	}
	private static HashMap<Integer,Boolean> getJiuMap(int jiuNumber) {
		HashMap<Integer,Boolean> jiuMap = new HashMap<Integer,Boolean>();
		int dujiu = (int) (1 + Math.random() * jiuNumber);
		System.out.println("酒数量："+jiuNumber);
		System.out.println("毒酒号："+dujiu);
		for (int i = 1; i <= jiuNumber; i++) {
			if(i == dujiu){
				jiuMap.put(i, false);
			}else{
				jiuMap.put(i, true);
			}
		}
		return jiuMap;
	}

}