要求
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;
}