hdu 6098 Inversion

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct Node{
    int id,val;
}node[110000];
bool cmp(Node a,Node b){
    return a.val>b.val;
}
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&node[i].val);
            node[i].id=i;
        }
        sort(node+1,node+n+1,cmp);
        
        for(int i=2;i<n;i++){
            int j=1;
            while(node[j].id%i==0){
                j++;
            }
            printf("%d ",node[j].val);
        }
        int j=1;
        while(node[j].id%n==0){
            j++;
        }
        printf("%d\n",node[j].val);
    }
}