gcd
cycles = gcd(len, rot); /* number of cycles */
static int gcd(int, int);
return (gcd(b, r));
} while (gcd(room_num, delta + 1) != 1);
ncycle = gcd(nnonopts, nopts);
static int gcd(int, int);
return gcd(n, m);
return gcd(n, m % n);
while ((f > (1<<16) || b > (1<<16)) && (d = gcd(f, b)) > 1) {
static u_int gcd(u_int, u_int);
return (b == 0) ? a : gcd(b, a % b);
return a * b / gcd(a, b);