package suanfa;
import java.util.ArrayList;
import java.util.Scanner;
/*n个人围成一圈,从第s个人开始报数,当报数的那个人的数是m的倍数时即出列,要求依次输出出列人的序号 */
public class josephus
{
private static void removeNM(int n, int m,int s)
{
ArrayList<Integer> list = new ArrayList<Integer>();
for (int i = 1; i <=n; i++)
{
list.add(new Integer(i));
}//将数据添加如链表
int removed = s;
int j=0;
while (list.size() > 0)
{
removed = (removed + m - 1) % list.size();
System.out.print(list.get(removed)+"\t");
if(++j%10==0) System.out.println(); //每十个数一行
list.remove(removed);//输出该数,并从 链表中删除
}
}
public static void main(String[] args) throws Exception
{
System.out.println("请输入n,m,s(以空格隔开,结束运行直接输入OK):");
Scanner sc=new Scanner(System.in);
String read=sc.nextLine();
if(read.toLowerCase().equals("OK"))
{
sc.close();
return;
}
String [] num=read.split(" ");
int n=Integer.parseInt(num[0]);
int m=Integer.parseInt(num[1]);
int s=Integer.parseInt(num[2]);
removeNM(n,m,s);
}
}