#include <iostream> #include <vector> #include <deque> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { int n; cin >> n; int *array = new int[n]; deque<int*> deq; for (int i = 0; i < n; i++) deq.push_back((array + i)); int cnt = 1; while (!deq.empty()) { int *x = deq.front(); deq.pop_front(); deq.push_back(x); x = deq.front(); *x = cnt++; deq.pop_front(); } int index = 0; for (; index < n - 1; index++) cout << array[index] << " "; cout << array[index] << endl; } return 0; }
点赞 评论

相关推荐

头像
03-20 22:00
重庆大学 Java
适彼乐土:“他们不行再找你” 最后的底牌吗?有点意思
点赞 评论 收藏
分享
牛客网
牛客企业服务