约瑟夫问题的链表模拟方法（STL list)

F.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+    int n, m;
+    while (cin >> n >> m) {
+        list<int> L;
+        for (int i = 1; i <= n; i++) L.push_back(i);
+        list<int>::iterator it = L.begin();
+        while (L.size() > 1) {
+            for (int k = 1; k < m; k++) {
+                ++it;
+                if (it == L.end()) it = L.begin();
+            }
+            it = L.erase(it);
+            if (it == L.end()) it = L.begin();
+        }
+        cout << *L.begin() << endl;
+    }
+    return 0;
+}