305 - Joseph

UVa網站題目連結
My Solved Problems Performance

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.

Input

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.

Output

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

Sample Input

3
4
0

Sample Output

5
30

Solution

  1. import java.io.BufferedInputStream;
  2. import java.util.Scanner;

  3. public class Main {

  4. static Scanner in = new Scanner(new BufferedInputStream(System.in));
  5. static int k, m, p, now, kill;

  6. public static void main (String[] args) {

  7. while ((k=in.nextInt())!=0) {
  8. Joseph(k);
  9. }
  10. }

  11. private static void Joseph(int k) {
  12. p = 2*k;
  13. now = 1;
  14. m = 2;
  15. while (p > k) {
  16. kill = (now+m-1)%p;
  17. if ((kill<=k)&&(kill!=0)) {
  18. p = 2*k;
  19. m++;
  20. now = 1;
  21. } else {
  22. now = (kill==0) ? 1 : kill;
  23. p--;
  24. }
  25. }
  26. System.out.println(m);
  27. }
  28. }
關鍵字:UVa Online Judge, ACM. Java


留言

相關文章

這個網誌中的熱門文章

【汽機車燃料費】2021/110年度信用卡回饋/分期整理!

【信用卡排行榜】2021國內外必辦現金回饋信用卡推薦!

【銀行代碼查詢】3碼銀行代碼列表、7碼分行代碼查詢

【中信英雄聯盟卡】指定電商10%+遊戲/影音/外送10%!

【台新雙狗】@GoGo/FlyGo大翻新!最高6%眉角報你知!

秒級偵測網頁更新變動通知(PageMonitor,Check4Change)

【永豐開戶辦卡攻略】2021四大神卡最高10%+活存1.1%!