乘:
procedure c1(x:longint);
var
i,j,k:longint;
y:int64;
begin
y:=0;
for i:=1 to ans[0] do
begin
ans[i]:=ans[i]*x+y;
y:=ans[i] div mo;
ans[i]:=ans[i] mod mo;
end;
while y>0 do
begin
inc(ans[0]);
ans[ans[0]]:=y mod mo;
y:=y div mo;
end;
end;
待续……