#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 = q.front();
q.pop();
if (cur == 3)
{
cur = 1;
}
else
{
q.push(x);
cur++;
}
}
cout << q.front() << endl;
return 0;
}
C++STL解决约瑟夫环问题
最新推荐文章于 2023-09-14 13:11:19 发布