0

GCD for small numbers (1<=x<=64) without using L1 cache.
The goal is to compute the Greatest Common Divisor (GCD) of two small numbers ($1 ≤ x ≤ 64$) as quickly as possible without using the L1 cache.
Constraints:
You are not allowed to store the result in an array.
You can memoize auxiliary tab...