Divisor is a one digit division algorithm

1. Divisor calculation is a one digit division. Starting from the (high) digit of the divisor, try to divide the (first digit) of the divisor with the divisor each time. If it is smaller than the divisor, try to divide the (first two digits) again

2. When divisor is a two digit division, the order of calculation and the method of trial quotient are exactly the same as those when divisor is a one digit division. When divisor is a two digit division, first use the
divisor to divide the first
two digits of the divisor. If the first
two digits are smaller than the
divisor, then divide the first
three digits; The quotient is written on the digit of the divisor; For each quotient, the remainder must be smaller than the divisor; Divisor, quotient; Remainder, divide by

3. Unknown_Error

4. Divisor is a one digit division. If the highest order of the divisor is smaller than the divisor, try to divide the first two digits of the divisor. The quotient is written on the top of the divisor. The remainder of each division must be smaller than the divisor

5. The quotient is written on the top of the highest digit of the divisor. The remainder must be smaller than the divisor.

6. Move the decimal point of the divisor back to an integer, move the decimal point of the corresponding divisor back a few places, and add a few zeros after the divisor

7. Divisor is the division of decimals. When the decimal point of divisor is removed, the divisor is expanded by a corresponding multiple, that is, when it is one decimal place, it is expanded by 10 times; When it is two decimal places, it is expanded by 100 times; When it's three decimal places, expand 1000 times... And then calculate the division.

8. 1. Start from high position
2. The quotient will be written to the divisor
3. The remainder of each division is smaller than the divisor.