Java-POJ1012-Joseph

打表啦

约瑟夫环，处理时下表统一为从0开始更方便！

 import java.util.Scanner;

 public class poj1012 {
     public static boolean calc(int k,int m) {
         boolean flag=true;
         for(int pos=0,res=2*k;res>k;res--) {
             pos=(pos+m-1)%res;//1~2k转为0~2k-1
             if(pos<k) flag=false;//<=k转为<k
         }
         return flag;
     }
     public static void main(String[] args) {

         Scanner cin = new Scanner(System.in);
         int[] ans = new int[30];
         for (int k = 1; k < 14; k++) {
             int m = k + 1;
             while (true) {
                 if (!calc(k, m))m++;
                 else {ans[k] = m;break;}
             }
         }
         while (cin.hasNext()){
             int i=cin.nextInt();
             if(i!=0)System.out.println(ans[i]);
             else break;
         }
     }
 }