主要是剪枝的问题,见代码,讲的很详细
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
inline int read(){
char chr = getchar(); int f = 1,ans = 0;
while(!isdigit(chr)) {if(chr == '-') f = -1;chr = getchar();}
while(isdigit(chr)) {ans = (ans << 3) + (ans << 1);ans += chr - '0';chr = getchar();}
return ans* f ;
}
void write(int x){
if(x < 0) putchar('-'),x = -x;
if(x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int r[50],h[50];
int N,M;
int ans=0x3f3f3f3f;
void dfs(int x,int V,int S,int kk){
if(S+r[1]*r[1]+kk>=ans) return;
if(x>M+1) return;
if(N-V-r[x-1]*r[x-1]*h[x-1]*kk>0) return;
if(V==N && x==M+1){
ans=min(ans,S+r[1]*r[1]);
return;
}
for(int H=h[x-1]-1;H>=kk;H--)
for(int R=r[x-1]-1;R>=kk;R--){
h[x]=H;
r[x]=R;
V+=r[x]*r[x]*h[x];
S+=2*r[x]*h[x];
dfs(x+1,V,S,kk-1);
V-=r[x]*r[x]*h[x];
S-=2*r[x]*h[x];
}
}
int main(){
N=read(),M=read();
h[0]=(int)sqrt(N);
r[0]=(int)sqrt(N);
dfs(1,0,0,M);
if(ans==0x3f3f3f3f)
cout<<-1;
else
cout<<ans;
return 0;
}