约瑟夫环-队列.rar

#include<iostream> using namespace std; const int QueueSize = 100; template<typename T> class JC { public: JC(); ~JC(); void Queue_Joseph(int n, int m,JC<T>& jc); //出环 void CreateJC(T x); //入队 T Pop(); //出队 private: T data[QueueSize]; int rear, front; }; template<typename T> JC<T>::JC() { rear = front = QueueSize - 1; } template<typename T> JC<T>::~JC() { } template<typename T> void JC<T>::CreateJC(T x) { if (front == (rear + 1) % QueueSize)throw"上溢！"; data[rear] = x; rear = (rear + 1) % QueueSize; } template<typename T> T JC<T>::Pop() { if (rear == front)throw"下溢"; front = (front + 1) % QueueSize; return data[front]; } template<typename T> void JC<T>::Queue_Joseph(int n, int m,JC<T>& jc) { for (int i = 1; i <= n; i++) { jc.CreateJC(i); } for(int i = 1; i <= n; i ++) { for (int j = 1; j < m ; j++) { jc.Pop(); jc.CreateJC(i); } if (i = m)cout << "指定元素出环：" << jc.Pop() << endl; } } int main() { JC<int>jc; int n, m; cout << "请输入人数：" << endl; cin >> n; cout << "请输入出环密码：" << endl; cin >> m; jc.Queue_Joseph(n, m,jc); return 0; }