Integer subtraction force

1. Subtraction is one of the four operations. Subtracting one quantity from another is called subtraction; Given the sum of two addends and one of them, the operation of finding the other is called subtraction. The sign for subtraction is a minus sign. It's used to calculate the rection. The subtraction of borrow calculation does not have to be hard calculation, it can also be simple calculation. This method is suitable for preschool and first grade children. For example: 24-8 = 16, you can think like this: borrow 14-8, first use 10-8 = 2, then use 2 + 4 = 6, the difference must be 6, ten is simple. That is to say, after borrowing, the number of digits removed is first subtracted, and then the subtracted number is used to add the number of digits subtracted. Ten digits is not difficult. However, the premise is that the subtracted bit must be smaller than the subtracted bit in order to simplify the calculation.

2. The number of digits is added to the number of digits. If the number of decimals is full, it is ten, and the rest is still in the number of digits
add ten digits to ten digits. If the decimal is full, it is a hundred, and the rest is still ten digits
add 100 digits to 100 digits. If the decimal is full, it is a thousand digits. The rest is in the hundred
and so on.

3. ;, 203203;, 33258;, 24049;, 25353;, 29031;, 203203;, 2020204;, 32769;, 240722;, 27714;, 36827;, 36755;, 3675622223;br />
procere big sub(a:string); b:string);< br />var i,j,k,n:integer;< br />start
i:=length(a);< br /> j:=length(b);< br /> while (i>= 1)and(j>= 1) do
begin
if a[i]>= b[j] then k:=0 else k:=10;< br /> a[i]:=chr(word(ཟ 39; 0&35;39;)+ word(s)+k-word(s);< br /> n:=i-1;< br /> while k> 0 do
begin
if a[n]>&35; 39? 0&35;39; then k:=0 else k:=10;< br /> a[n]:=chr(word(a)+k-1);< br /> n:=n-1;< br /> end;< br /> i:=i-1;< br /> j:=j-1;< br /> end;< br /> writeln(a);< br />end;< br />
var a,b:string;< br />start
a:35;39;&35; 39;{ readln(a);}< br /> b:&35;39; 9999999999999&35; 39;{ readln(b);}< br /> big sub(a,b);< br /> a:35;39;35; 39;{ readln(a);}< br /> b:&35;39; 123&35; 39;{ readln(b);}< br /> big sub(a,b);< And then the second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second second third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third third"33021;" 20570;"21040;"

4. Algorithm rule:
1. Integer addition algorithm
align the same digits, add from the low order, and the number in which digit is added up to ten will be one bit forward
2. Integer subtraction algorithm
align the same digits and subtract them from the lower position. If the number in the lower position is not enough to be subtracted, it will be subtracted from the previous one as ten, combined with the number in the standard position, and then subtracted< 3. Integer multiplication rule:
(1) from the right, multiply the number on each bit of the second factor by the first factor in turn, and the end of the number will be aligned with the bit of the second factor
(2) then add up the multiplications
(multiplication of 0 at the end of an integer: you can multiply the number before 0 first, and then see how many zeros there are at the end of each factor, and then add several zeros at the end of the multiplied number.)< (1) from the high position of the divisor, first look at how many digits the divisor has, and then try to divide the first few digits of the divisor by the divisor. If it is smaller than the divisor, try to divide more digits
(2) write the quotient on the divisor
(3) after each division, the remaining number must be smaller than the divisor.

5. The rule of addition and subtraction:
add and subtract the same unit, the unit remains unchanged, the number of units is added and subtracted
integer
1
2
3; If there is not enough subtraction in subtraction, it will be back from the previous one and back several tens

6. The order of mixed operation of fraction and integer is the same, which is:
1. If the operation is at the same level, it is generally calculated from left to right
2. If there are both addition and subtraction and multiplication and division, first calculate multiplication and division, then add and subtract
3. If there are brackets, count them first

7. 1. Integer addition algorithm: align the same digit, add from the low position, and the number in which digit is added up to ten will advance to the first digit.
2. Integer subtraction algorithm: align the same digit, subtract from the low position, and the number in which digit is not enough to be reced will be retreated from the first digit to make ten, which digit is combined with the number in the standard, and then reced