题目大意：有2k个人，前k个是好人，后k个是坏人，每隔m个人去除一个人，求k个坏人在好人前全部被去除的最小m。
代码如下：
import java.util.ArrayList;
import java.util.Scanner;
public class HDU1433{
public static void main(String []arges) {
Scanner input = new Scanner(System.in);
ArrayList ans=new ArrayList();
while (!input.hasNext(“0”)) {
int n = input.nextInt();
int m = 1;
joseph j = new joseph(n, m);
man k = j.first;
for (int i = 1; i <= j.jlength(); i++) {
k = k.next;
}
ans.add(j.circle(n,m));
}
for(int i=0;i
}
class man{
int no;
man next;
man prior;
public man(int num){
no=num;
next=null;
prior=null;
}
}
class joseph{
int n,m;
man first;
public joseph(int n1,int m1){
man p,t;
n=n1*2;
m=m1;
first=new man(1);
t=first;
for(int i=1;i n && q.jlength()>n) {
c.prior.next = c.next;
c.next.prior = c.prior;
c=c.next;
for (int i = 1; i < m; i++) {
c = c.next;
}
}
if ((c.no <= n )&& (q.jlength()>n)) {
m=m+1;
q=new joseph(n,m);
c=q.first;
}
}
return m;
}
}
