题解：CF2048B Kevin and Permutation

#include<bits/stdc++.h>
using namespace std;
int n,a,k,ans[100001];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a>>k;
		memset(ans,0,sizeof(ans));
		for(int j=k;j<=a;j+=k)ans[j]=j/k;
		int tmp=a/k+1;
		for(int j=1;j<=a;j++){
			if(j%k==0)continue;
			ans[j]=tmp;
			tmp++;
		}
		for(int j=1;j<=a;j++)cout<<ans[j]<<" ";
		cout<<endl;
	}
	return 0;
}