JLOI 斯迈利的赌注

直接高精度模拟，加上简单贪心

 Program XJOI2263;
 type arr=array[..] of longint;
 var a,b:arr;
     s1,s2:ansistring;
     i,j:longint;
     sum:int64;
 operator *(a:arr;x:longint) c:arr;
 var i:longint;
 begin
     fillchar(c,sizeof(c),);
     for i:= to a[] do c[i]:=a[i]*x;
     for i:= to a[] do
     begin
         c[i+]:=c[i+]+c[i] div ;
         c[i]:=c[i] mod ;
     end;
         c[]:=a[];
     while c[c[]+]<> do
     begin
         inc(c[]);
         i:=c[];
         c[i+]:=c[i+]+c[i] div ;
         c[i]:=c[i] mod ;
     end;
     exit(c);
 end;
 function check(a,b:arr):boolean;
 begin
     if a[]<b[] then exit(true);
     if a[]>b[] then exit(false);
     for i:=a[] downto  do
     begin
         if a[i]<b[i] then exit(true);
         if a[i]>b[i] then exit(false);
     end;
     exit(true);
 end;
 begin
     readln(s1);
     readln(s2);
     a[]:=length(s1);
     b[]:=length(s2);
     for i:= to a[] do a[i]:=ord(s1[a[]-i+])-;
     for i:= to b[] do b[i]:=ord(s2[b[]-i+])-;
     while check(a,b) do
     begin
         inc(sum);
         a:=a*;
     end;
     sum:=sum-;
     sum:=sum mod ;
     if sum= then writeln() else
     begin
         j:=;
         for i:= to sum do j:=j*;
         writeln(j);
     end;
 end.