voidEgyptFraction(int A, int B) { int E, R; cout << A << "/" << B << "="; do { E = B / A + 1; cout << "1/" << E << "+"; A = A * E - B; B = B * E; R = gcd(B, A); //调用函数求A和B的最大公约数 if (R > 1) { A = A / R; B = B / R; } } while (A > 1) cout << "1/" << B << endl; return; }