取名不要太长,像我这样刚刚好 • 19天前
using namespace std;
queue q; int ans[100000]; int main() {
int n;
cin >> n;
int x = n;
for (int i = 1; i <= n; i++) {
q.push(x);
if (x == 1)
break;
for (int j = x % q.size(); j >= 1; j--) {
q.push(q.front());
q.pop();
}
x--;
}
for (int i = 1; i <= n; i++) {
ans[i] = q.front();
q.pop();
}
for (int i = n; i >= 1; i--)
printf("%d ", ans[i]);
return 0;
}
评论:
请先登录,才能进行评论