Function gcd

gecode/int/linear/post.hpp:88–96

Compute the greatest common divisor of \a a and \a b

  /// Compute the greatest common divisor of \a a and \a b
  inline int
  gcd(int a, int b) {
    if (b > a)
      std::swap(a,b);
    while (b > 0) {
      int t = b; b = a % b; a = t;
    }
    return a;
  }