# 题目

The problem is named after Flavius Josephus, a Jewish historian who participated in and chronicled the Jewish revolt of 66-70C.E. against the Romans. Josephus, as a general, managed to hold the fortress of Jotapata for 47days, but after the fall of the city he took refuge with 40 diehards in a nearby cave. There the rebels voted to perish rather than surrender. Josephus proposed that each man in turn should dispatch his neighbor, the order to be determined by casting lots. Josephus contrived to draw the last lot, and as one of the two surviving men in the cave, he prevailed upon his intended victim to surrender to the Romans. Your task:computint the position of the survivor when there are initially n people.

## 输入

a Positive Integer n is initially people. n< = 50000

## 输出

the position of the survivor

6

5

# 源代码

#include <iostream>

int Func(int, int);

int main() {
int n(0), k(2);
std::cin >> n;
std::cout << Func(n, k) + 1 << std::endl;
return 0;
}

int Func(int n, int k) {
if (n == 1)
return 0;
else
return (Func(n - 1, k) + k) % n;
}


04-08 392

06-21 324

05-21 490

09-24 263

04-05 1478

#### 约瑟夫问题 The Josephus Problem 非递归算法求解

©️2020 CSDN 皮肤主题: 点我我会动 设计师: 上身试试

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。