OpenJudge

1012:Joseph

总时间限制:
1000ms
内存限制:
65536kB
描述
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

来源
Central Europe 1995
全局题号
14
添加于
2009-10-29
提交次数
1952
尝试人数
704
通过人数
484
您的评价 很水 简单 一般 较难 变态
  • 标签(多个标签用空格分隔):
  • 常用标签:
    递归   动态规划   贪心   搜索   枚举   模拟   数学   字符串处理   几何   高精度计算   图论  

共有4人评分

25.0%
50.0%
0.0%
0.0%
25.0%

已有的标签

数学(2) 打表(1)