代码:

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long Barbatoss;
typedef long long Wendy;
typedef long ShaTang;
typedef int LeiZe;
Barbatoss t=1,n,i=1;
queue<Barbatoss>que;
main(){
	scanf("%llu",&n);
	for(i=1;i<=n;i++)que.push(i);
	i=1;
	while(!que.empty()){
		if(t==i*i){
			printf("%llu ",que.front());
			que.pop();
			i++;
			t=1;
		}else{
			t++;
			que.push(que.front());
			que.pop();
		}
	}
}
//优化!!!!!!!!
//从O(n^3)要搞到O(n^2)!!!!!!!!!!!!!!!