1. 程式人生 > >【洛谷 1601】A+B Problem(高精)

【洛谷 1601】A+B Problem(高精)

問題描述
高精度加法(無負數)
樣例輸入
1
1
樣例輸出
2

const
  maxn=100;
var
  a,b:array[1..maxn] of longint;
procedure init;
var
  s1,s2:string;
  l1,l2,i:longint;
begin
  fillchar(a,sizeof(a),0);
  fillchar(b,sizeof(b),0);
  readln(s1);
  readln(s2);
  l1:=length(s1);
  l2:=length(s2);
  for i:=l1 downto 1 do
    a[maxn-l1+i]:=ord(s1[i])-48
; for i:=l2 downto 1 do b[maxn-l2+i]:=ord(s2[i])-48; end; procedure add; var i,g,s:longint; begin g:=0; for i:=maxn downto 1 do begin s:=a[i]+b[i]+g; a[i]:=s mod 10; g:=s div 10 end; end; procedure print; var i,j:longint; begin j:=1; for i:=1 to maxn do if
(j<maxn) and (a[j]=0) then inc(j); for i:=j to maxn do write(a[i]) end; begin init; add; print end.

這裡寫圖片描述
Pixiv ID:61550681