题解：P14127 [SCCPC 2021] K-skip Permutation

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int n,k;
bool a[maxn];
vector<int> ans;
int main(){
	memset(a,0,sizeof(a));
    scanf("%d%d",&n,&k);
    int h=1;
    while(h<=n){
    	if(!a[h]){
    		ans.push_back(h);
    		for(int i=h+k;i<=n;i+=k){
    			ans.push_back(i);
    			a[i]=1;
			}
		}
		h++;
	}
	for(int i=0;i<ans.size()-1;++i) cout<<ans[i]<<" ";
	cout<<ans[ans.size()-1];
    return 0;
}