here's my code:
const
     max = 35000;
var
   n,k,sum,t : longint;
   p : array[1..max div 2] of longint;
   num : array[1..max div 2] of integer;
function digits(i : longint) : integer;
var
   r : integer;
begin
     r := 0;
     while i > 0 do
     begin
          inc(r,i mod 10);
          i := i div 10;
     end;
     digits := r;
end;
function check : boolean;
var
   i,k : longint;
   sum : integer;
begin
     sum := digits(n);
     k := n;
     i := 1;
     check := false;
     while p[i] <= sqrt(k) do
     begin
          while k mod p[i] = 0 do
          begin
               k := k div p[i];
               dec(sum,num[i]);
          end;
          inc(i);
          if sum < 0 then exit;
     end;
     if (k = n) or ((k = 1) and (sum <> 0)) or (sum <> digits(k))
      then exit;
     check := true;
end;
procedure gen;
begin
     repeat
       inc(n);
     until check;
     writeln(n);
end;
function prime(k : longint) : boolean;
var
   i : integer;
begin
     prime := false;
     for i := 1 to t do
      if k mod p[i] = 0 then exit
       else
        if sqrt(k) < p[i] then break;
     prime := true;
end;
procedure init;
var
   i : longint;
begin
     p[1] := 2;
     t := 1;
     num[1] := 2;
     for I := 3 to max do
      if prime(I) then
      begin
           inc(t);
           p[t] := i;
           num[t] := digits(i);
      end;
end;
begin
     init;
     read(n);
     while  n > 0 do
     begin
          gen;
          readln(n);
     end;
end.

• 这题没有那么麻烦，整理一下思路，看看到底什么时候出现循环节，然后重新写吧 (1735) rruucc 2003-05-29 10:40:53
• 这个号原来这么古董 (1735) noname00 2005-11-23 18:05:53
• zan队长~~ (1735) TN 2005-11-23 18:10:40
• 报告队长：没看出来 (1735) Tifa 2005-11-23 18:11:27
• re! (1735) LiHaoyuan 2005-11-23 19:48:38
• 大家从前都用pascal哦 (1735) frkstyc 2005-11-23 20:04:29
• 晕.....我都不记得还发过这样的帖子阿..... (1735) awts 2005-11-23 21:32:44
  • 队长日理万机~~~~~~~~~~~ (0) ciciatc 2005-11-23 22:55:44
    • re! (0) LiHaoyuan 2005-11-23 23:28:25
    • 赞！ (0) TN 2005-11-24 12:34:10