求大神指教

var
  n,m,q,l,s:longint;
  r,h,max1,max2:array[1..20] of longint;
procedure dfs(k:longint);
var
  i,j:longint;
begin
  if (k>m) and (l=0) then begin
    s:=s+sqr(r[1]);
    if s<q then q:=s;

  end;
  for i:=max1[k]-1 downto 1 do begin
    max2[1]:=trunc(sqrt(n));
    for j:=max2[k]-1 downto 1 do begin
      max1[k]:=i;
      max2[k]:=j;
      r[k]:=i;
      h[k]:=j;
      l:=l-sqr(r[k])*h[k];
      s:=s+2*r[k]*h[k];
      dfs(k+1);
      s:=s-2*r[k]*h[k];
      l:=l+sqr(r[k])*h[k];
    end;
  end;
end;
begin
  //assign(input,'birth.in');reset(input);
  //assign(output,'birth.out');rewrite(output);
  readln(n);
  readln(m);
  q:=maxlongint;
  max1[1]:=trunc(sqrt(n));
  max2[1]:=trunc(sqrt(n));
  l:=n;
  dfs(1);
  write(q);
  close(input);close(output);
end.