tju1103.pas

同济大学ACM题库TJU1103的题解代码.深度优先搜索的一个好例子.

Program tju1103;
Const
     prime   : array[1..10] of integer=(2,3,5,7,11,13,17,19,23,29);
Var
     n,best,bestcount:longint;

Procedure search(number:int64;count,posi,max:longint);
var
    k:integer;
begin
     if (count>bestcount) or (count=bestcount) and (number<best) then begin
        bestcount:=count;
        best:=number;
     end;
     for k:=1 to max do begin
         number:=number*prime[posi];
         if number>n then exit;
         search(number,count*(k+1),posi+1,k);
     end;
end;

BEGIN
     While not(Seekeof) do begin
       readln(n);
       best:=0;
       bestcount:=0;
       search(1,1,1,99);
       writeln(best);
     end;
END.