约瑟夫问题。

import java.util.Scanner;

public class Yuesef {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		System.out.println("输入人数");
		int n=sc.nextInt();
		System.out.println("输入m");
		int m=sc.nextInt();
		yuesf(n,m);
	}
	static void yuesf(int n,int m)
	{
		int []a=new int[n];
		int p=1;
		int t=0;
		while(true)
		{
			for(int x=0;x<a.length;x++)
			{
				if(a[x]==1)continue;
				if(p==m)
				{
					a[x]=1;
					p=0;
					t++;
					System.out.println(x);
				}
				p++;
			}
			
			if(t==a.length)
				break;
		}
		
		
	}

}