Leetcode 1006. Clumsy Factorial

Compute the "clumsy factorial" by applying the operations *, /, +, - in a repeating cycle to the integers n down to 1, using standard precedence (multiplication/division before addition/subtraction) and floor division for '/'. The challenge is to simulate or exploit the repeating 4-number pattern to produce the final integer result efficiently.