Submission #993934

---

Source Code Expand

#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<map>
using namespace std;
map<pair<long long,int>,long long>dp;
long long A;
long long calc(long long N,int last){
	if(N<=A)return N;
	if(dp.count(make_pair(N,last))){
		return dp[make_pair(N,last)];
	}
	long long ret=N;
	for(long long i=max(max(2,last),(int)sqrt(2*A)-10);i<sqrt(2*A)+10;i++){
		ret=min(ret,i+A+calc((N+i-1)/i,i));
	}
	return ret;
}
int main(){
	long long a,b;
	scanf("%lld%lld",&a,&b);
	A=b;
	long long ret=a;
	for(int i=1;i<42;i++){
		long long cur=a;
		long long P=pow(a,1.0/(i+1))-1;
		for(int j=0;j<4;j++){
			long long t=P+j;
			long long now=0;
			for(int k=0;k<=i;k++){
				now=t;
				long long f=t;
				for(int l=0;l<i;l++){
					f+=t;
					if(l<k)f++;
					now*=(t+(l<k));
					if(now>=a)now=a+1;
				}
				if(now>=a){
					cur=min(cur,f);
				}
			}
		}
		ret=min(ret,cur+i*b);
	}
	printf("%lld\n",ret);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld",&a,&b);
                         ^

Judge Result