zoukankan      html  css  js  c++  java
  • [POJ 1012] Joseph(约瑟夫)

    Description

    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
    
    

    Source

    My Code

     1 #include <iostream>
     2 using namespace std;
     3 int x[]={2,7,5,30,169,441,1872,7632,1740,93313,459901,1358657,2504881};
     4 int main() {
     5     for(;;) {
     6         int n;
     7            cin>>n;
     8         if(n==0) break;
     9         cout<<x[n-1]<<endl;    
    10     }
    11     return 0;
    12 } 
  • 相关阅读:
    最大子串和
    [USACO1.5]数字金字塔 Number Triangles
    数字金字塔
    台阶问题
    取余运算
    数列分段pascal程序
    Java 集合-Collection接口和迭代器的实现
    Java 集合-集合介绍
    Java IO流-File类
    Git学习记录
  • 原文地址:https://www.cnblogs.com/TonyNeal/p/POJ1012.html
Copyright © 2011-2022 走看看