package calculate;
//约瑟夫环例子
import java.util.HashMap;
import java.util.Map;
public class MonkeyKing {
@SuppressWarnings("unchecked")
public static void main(String args[]) {
int n = 100; // 猴子总数
int m = 3; // 报数出局数
@SuppressWarnings("rawtypes")
Map map = new HashMap();
int nn = 1; // 报数序号
int mm = 1; // 报数号
System.out.println("-----------------------" + n + "只猴子选大王开始-----------------------");
for (int i = 1; i < n + 1; i++) {
map.put(i, i);
}
while (map.size() > 1) {
if (mm == 3) {
map.remove(nn);
}
nn++;
if (nn == n + 1) {
nn = 1;
}
if (map.get(nn) != null) {
mm++;
}
if (mm == m + 1) {
mm = 1;
}
}
String result = map.values().toString();
System.out.println("第" + result.substring(1, result.length() - 1) + "只猴子当选猴王");
}
}