URAL/1071

来自"NOCOW"

直接枚举进制，我们设x>y，那么显然当进制k>x后还是没找到解，显然就不可能找到解了。

program cao;
const
  maxn=1000;
 
type
  Tarray=array[0..maxn] of longint;
 
var
  a,b:Tarray;
  c,d,e,f,g,h,j,i,k,l,n,m,p,q,x,y:longint;
 
procedure turn(a,b:longint; var x:tarray;var l:longint);
var
  i:longint;
begin
  l:=0;
  while a<>0 do
  begin
    inc(l);
    x[l]:=a mod b;
    a:=a div b;
  end;
end;
 
begin
  read(x,y);
  {if y>x then
  begin
    writeln(’No solution’);
    halt;
  end; }
  for k:=2 to x do
  begin
    turn(x,k,a,n);
    turn(y,k,b,m);
    i:=1;
    for j:=1 to m do
    begin
      while (i<=n)and(a[i]<>b[j]) do inc(i);
      inc(i);
      if i>n+1 then break;
    end;
    if i>n+1 then continue;
    writeln(k);
    halt;
  end;
  writeln(‘No solution’);
end.

http://www.withflying.com/?p=133

http://www.withflying.com