procedure devide(a:hp;b:longint; var c:hp; var d:longint); |
{c:=a div b; d:= a mod b} |
var i,len:integer; |
begin |
fillchar(c,sizeof(c),0); |
len:=a[0]; d:=0; |
for i:=len downto 1 do begin |
d:=d*10+a[i]; |
c[i]:=d div b; |
d:=d mod b; |
end; |
while (len>1) and (c[len]=0) then dec(len); |
c[0]:=len; |
end; |