static long gcf(long m, long n)
{
if (m < n) goto l2;
l1: if ((m %= n) == 0) return n;
l2: if ((n %= m) == 0) return m;
goto l1;
}Greatest Common Factor using Euclid’s algorithm and, gasp, gotos to be fast (about 50% faster)
artizba news russia