Submission #5495630

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
long N,A,dp[1<<20],ans;
main()
{
	cin>>N>>A;
	ans=N;
	for(long i=1;i*i<=N;i++)dp[i]=i;
	for(long i=1;i*i<=N;i++)
	{
		int g=1;
		for(long j=i+i;j*j<=N;j+=i)dp[j]=min(dp[j],++g+A+dp[i]);
		long s=sqrt((double)N/i);
		for(long k=max(2L,s-10);k<=s+10;k++)
		{
			ans=min(ans,dp[i]+2*A+k+(N+k*i-1)/(k*i));
		}
		ans=min(ans,dp[i]+A+(N+i-1)/i);
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result