#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL maxn=1e6+10;
const LL mod=1e9+7;
LL vis[maxn],prime[maxn];
LL tot,ans=1;
double mx;
vector<LL> p[maxn];
LL n;
void init()
{
tot=0;
vis[1]=1;
for(LL i=2;i<=maxn-5;i++){
if(vis[i]==0){
prime[++tot]=i;
p[tot].push_back(1);
}
for(LL j=1;j<=tot&&i*prime[j]<=maxn-5;j++){
vis[i*prime[j]]=1;
if(i%prime[j]==0){
break;
}
}
}
for(LL i=1;i<=tot;i++){
for(LL pre=prime[i],sum=prime[i];sum<=n;pre=pre*prime[i],sum+=pre){
p[i].push_back(sum);
}
}
}
void dfs(LL x,LL d,LL sum,LL k,double s)
{
for(LL i=1;i<=d&&i<p[x].size();i++){
if(sum+p[x][i]>n){
if(s>mx){
mx=s;
ans=k;
}
return ;
}
dfs(x+1,i,sum+p[x][i],k*(i+1)%mod,s+log2(i+1));
}
}
int main()
{
cin>>n;
init();
dfs(1,100,0,1,0);
printf("%lld\n",ans);
return 0;
}
牛客练习赛65题解(第四题)
最新推荐文章于 2021-08-21 11:18:29 发布