In case divisor is always positive, you can use these variants: int divF(int a, int b) { return a / b - (a % b < 0); } int divC(int a, int b) { return

In case divisor is always positive, you can use these variants: int divF(int a, int b) { return a / b - (a % b < 0); } int divC(int a, int b) { return a / b + (a % b > 0); } They should be faster as it avoids branching: https://godbolt.org/z/qrraj8s6j https://godbolt.org/z/qrraj8s6j