要求
Josephus问题,n个人围坐成一圈,按顺序编号为1-n,确定一个整数m,从1号开始数数,每数到第m个人出列,剩下的人从下一个人重新开始数,直至只剩下一个人为止。对n=8,m=5,过程和结果如下图所示,黑色数字为编号,红色数字为出列顺序,最后剩下的是3号
编写程序,对任意输入的n和m,求出最后剩下的人的编号。要求利用线性表保存这n个人,分别用公式化和链表两种描述方法实现。
输入:input.txt,两个整数n(3-100),m(1-m)
输出:若输入合法,按出列顺序输出人的编号,否则输出“WRONG”。编号之间用一个空格间隔,最后一个编号后不能有空格。两种实现方法各输出一次,用回车间隔,最后输出一个回车。如上述例子的输出应为:
――――――――
5 2 8 7 1 4 6 3
5 2 8 7 1 4 6 3
―――――――――
#include<iostream>
using namespace std;
template<class T>
class list {
public:
T *a;
int num;
list() {
a = new T[100];
for (int i = 1; i < 101; i++)
a[i - 1] = i;
num = 100;
}
list(int n) {
a = new T[n];
for (int i = 1; i <n+1; i++)
a[i - 1] = i;
num = n;
}
~list() {
delete[]a;
}
T getElement(int idex) {
return a[idex];
}
T outElement(int idex) {
T m = a[idex];
a[idex] = 0;
num--;
return m;
}
int getNum() {
return num;
}
void printLastNum(int n) {
T sum=0;
for (int i = 0; i < n; i++)
sum += a[i];
cout << sum<<endl;
}
};
template<class T>
class Node{
public:
T data;
Node<T>*next;
Node() {
data = 0;
}
Node(T data) {
this->data = data;
}
};
template <class T>
class ArryList:public Node<T>{
public:
Node<T>*first,*end;
int num;
ArryList() {
first = nullptr;
num = 0;
}
ArryList(int n) {
first=end=new Node<T>(1);
for (int i = 2; i < n + 1; i++) {
Node<T>*p=new Node<T>(i);
end->next = p;
end = p;
}
num = n;
}
int getNum() {
return num;
}
T getElement(int idex) {
Node<T>*p = first;
for (int i = 0; i <idex; i++)
p = p->next;
return p->data;
}
T outElement(int idex) {
Node<T>*p = first;
for (int i = 0; i < idex; i++)
p = p->next;
T m = p->data;
p->data = 0;
num--;
return m;
}
void printLastNum(int n) {
T sum = 0;
Node<T>*p = first;
for (int i = 0; i < n; i++)
{
sum += p->data;
p = p->next;
}
cout << sum<<endl;
}
};
template<class T>
void f1(int , int );
template<class T>
void f2(int, int);
template<class T>
void f1(int n, int m) {
list<T> list1(n);
int flag = 0;
for (int i = 0; i < n; i++) {
if (list1.getNum() == 1)
{
list1.printLastNum(n);
break;
}
if (list1.getElement(i) != 0)
flag++;
if (flag == m)
{
cout << list1.outElement(i) << " ";
flag = 0;
}
if (i == n - 1)
i = -1;
}
};
template<class T>
void f2(int n, int m) {
ArryList<int> list1(n);
int flag = 0;
for (int i = 0; i < n; i++) {
if (list1.getNum() == 1)
{
list1.printLastNum(n);
break;
}
if (list1.getElement(i) != 0)
flag++;
if (flag == m)
{
cout << list1.outElement(i) << " ";
flag = 0;
}
if (i == n - 1)
i = -1;
}
}
int main() {
int n, m;
cin >> n >> m;
if (n < 3 || n>100)
{
cout << "WRONG" << endl;
return 0;
}
if (m < 1)
{
cout << "WRONG" << endl;
return 0;
}
f1<int>(n, m);
f2<int>(n, m);
return 0;
}