首页 > 专题系列 > Java解POJ > POJ 1012 Joseph [解题报告] Java
2013
11-08

POJ 1012 Joseph [解题报告] Java

Joseph

问题描述 :

The Joseph’s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the last remaining person, thus saving his life to give us the message about the incident. For example when n = 6 and m = 5 then the people will be executed in the order 5, 4, 6, 2, 3 and 1 will be saved.

Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.

输入:

The input file consists of separate lines containing k. The last line in the input file contains 0. You can suppose that 0 < k < 14.

输出:

The output file will consist of separate lines containing m corresponding to k in the input file.

样例输入:

3
4
0

样例输出:

5
30

解题代码:

//* @author popop0p0popo
import java.util.*;
import java.io.*;

public class Main{
 public static void main(String[] args){
  Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in)));
  int k;
  int[] store={2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881};
  while (true){
   k=scanner.nextInt();
   if (k==0){
    break;
   }
   System.out.println(store[k-1]);
  }
 }
}

  1. 我还有个问题想请教一下,就是感觉对于新手来说,递归理解起来有些困难,不知有没有什么好的方法或者什么好的建议?