C++STL解決約瑟夫環問題

#include <iostream> #include <queue> using namespace std; int main() { int n; cin >> n; queue<int> q; for (int i = 1; i <= n; i++) { q.push(i); } int cur = 1; while(q.size() > 1) { int x

>>阅读原文<<