7.16数处理-1-1.pptVIP

引例： 输入2个数进行相加并输出结果。;Str1=‘3210’ Str2=‘98765’;对位（数字分离及反向保存） readln(str1); l1:=length(str1); k:=0; for i:=l1 downto 1 do begin k:=k+1; a[k]:=ord(str1[i])-ord(0); end;;相加处理 for i:=1 to j do begin a[i]:=a[i]+b[i]; {相加} a[I+1]:=a[[I+1] + a[I] div 10; {进位处理} a[I]:=a[I] mod 10; {保留余数} end;;var str1,str2:string; a,b:array[1..100] of integer; l1,l2,i,j,k:integer; begin readln(str1); readln(str2); l1:=length(str1); l2:=length(str2); if l1l2 then j:=l1 else j:=l2; k:=0; for i:=l1 downto 1 do begin k:=k+1; a[k]:=ord(str1[i])-ord(0); end;;for i:=1 to j do begin a[i]:=a[i]+b[i]; a[i+1]:=a[[i+1] + a[i] div 10; a[i]:=a[i] mod 10; end; ;2.两个正整数的减法 ;var a,b,c:array[1..200] of 0..9; n,n1,n2:string; len, lena,lenb,lenc,i,x:integer; begin readln(n1); readln(n2); if (length(n1)length(n2) ) or ((length(n1)=length(n2)) and (n1n2)) then begin n:=n1; n1:=n2; n2:=n ; write(‘-’); end;{结果为负处理} lena:=length(n1);lenb:=length(n2); len:=lena ; for i:=1 to lena do a[lena-i+1]:=ord(n1[i])-ord(‘0’); for i:=1 to lenb do b[lenb-i+1]:=ord(n2[i])-ord(‘0’); for i:=1 to len do Begin if a[i]b[i] then begin a[i+1]:=a[i+1]-1; a[i]:=a[i]+10 end; C[i]:=a[i]-b[i]; End; lenc:=len; while (c[lenc]=0) and (lenc1) do lenc:=lenc-1;{最高位的0不输出} for i:=lenc downto 1 do write(c[i]); end.;var a,b,c:array[1..200] of 0..9; n,n1,n2:string; lena,lenb,lenc,len,x:integer; begin readln(n1); readln(n2); if ((length(n1)length(n2) ) or (length(n1)=length(n2)) and (n1n2) then begin n:=n1; n1:=n2; n2:=n ; write(‘-’); end;{结果为负处理} lena:=length(n1);lenb:=length(n2); for i:=1 to lena do a[lena-i+1]:=ord(n1[i])-ord(‘0’); for i:=1 to lenb do b[lenb-i+1]:=ord(n2[i])-ord(‘0’); i:=1; while (i=l