今天继续加油吧!👊🏻👊🏻👊🏻
求各位大佬不喜勿喷,多多关照!
方案二.
#include <bits/stdc++.h>
using namespace std;
int main()
{
queue<int> que;
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; ++i)
que.push(i);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m - 1; ++j)
{
que.push(que.front());
que.pop();
}
cout << que.front() << ' ';
que.pop();
}
return 0;
}
方案一.
#include <bits/stdc++.h>
using namespace std;
int main()
{
bool isOut[1005] = {};
int n, m, p = 0;
cin >> n >> m;
for(int i = 1; i <= n; ++i)
{
for(int j = 0; j < m-1; ++j)
{
while(isOut[p] == true)
p = (p+1)%n;
p = (p+1)%n;
}
while(isOut[p] == true)
p = (p+1)%n;
isOut[p] = true;
cout << p+1 << ' ';
}
return 0;
}
既然都看完了,就点点赞吧,评论,关注➕
本人不胜感激🥹