约瑟夫问题解决好人与坏人问题：有n个人围成一圈，分别报数，报到为m的出列，也就是经典的约瑟夫问题。先要解决这样一个问题。围成一圈的人有k个好人，k个坏人，在进行约瑟夫问题报数时，符合在坏人没有都出列前第一个好人没有出列这样的情况的m的最小值为多少?-Joseph, good and bad problem-solving problem: there are n people form a circle, respectively, reported that the number of registration for the m out of line, that is the classic Joseph problems. First to solve such a problem. Circle of people have a good k, k a bad man, when the number reported during the Josephus problem, in line with the bad guys do not have a good man out before the first column is not a situation that the minimum number of m?