myesn

myEsn2E9

hi
github

Modulo operation in computer science

For example, 1%3=1, the calculation process is to convert the dividend to a floating-point number, that is, 1.0 / 3, then the exponent part of the quotient, which is the integer part, if it is 0, no longer calculates downwards, the remainder = quotient * divisor + dividend, here it is 1 = 0 * 3 + 1, so the remainder is 1, from this it can be concluded that if the dividend is less than the divisor, then the remainder is equal to the dividend. When humans calculate, they can accurately calculate the quotient with decimals, so the remainder calculated by humans is 0.1.

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.