求跳+求优化

#include<bits/stdc++.h>
using namespace std;
#define int long long
int k,n,cnt,f[8000010],p[8000010],ans[8000010];
signed main(){
	cin >> k >> n;
	f[1]=1;
	ans[1]=1;
	for(int i=2;i<=n;i++){
		if(!f[i]){
			p[++cnt]=i;
			ans[i]=(k%i ? 1 : i);
		}
		for(int j=1;j<=cnt&&i*p[j]<=n;j++){
			f[i*p[j]]=1;
			if(p[j]%i==0){
				if((k/ans[i])%p[j]==0) ans[i*p[j]]=ans[i]*p[j];
				else ans[i*p[j]]=ans[i];
				break;
			}
			ans[i*p[j]]=ans[i]*ans[p[j]];
		}
	}
	for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
    return 0;
}