Logo

Programming-Idioms

# 359 Euclidean division
Set q and r to the quotient and the remainder of the integer a divided by the integer b, such that a = b * q + r.

a is the dividend, b is the divisor.

E.g. a=31, b=7 ⟶ q=4, r=3
New implementation

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations 
import "math/big"
q := new(big.Int)
r := new(big.Int)
q.DivMod(a, b, r)
math
divmod(a,b,q,r);
q, r = divmod(a, b)
q, r = a.divmod(b)

Preview