欧几里得算法求最大公因数

/**
	 * 欧几里得算法求最大公因数
	 * @param a
	 * @param b
	 * @return
	 */
	public static long gcd(long a, long b) {
		if (a < b) {
			a = a ^ b;
			b = b ^ a;
			a = a ^ b;
		}
		while (b != 0) {
			long rem = a % b;
			a = b;
			b = rem;
		}
		return a;
	}