题解 | #约瑟夫环#
约瑟夫环
https://ac.nowcoder.com/acm/problem/22227
#include<algorithm>
using namespace std;
int n,k,m;
int main()
{
cin>>n>>k>>m;
int ops=0;
for(int i=2;i<=n;i++) ops=(ops+m)%i;
cout<<(ops+k)%n;
return 0;
}
约瑟夫环
https://ac.nowcoder.com/acm/problem/22227
#include<algorithm>
using namespace std;
int n,k,m;
int main()
{
cin>>n>>k>>m;
int ops=0;
for(int i=2;i<=n;i++) ops=(ops+m)%i;
cout<<(ops+k)%n;
return 0;
}
相关推荐