#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; /* gcdは最大公約数(greatest commond diviser) */ ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); } /* lcmは最小公倍数(least commond multiple) */ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } int main() { int t1, t2, t3; cin >> t1 >> t2 >> t3; int d = t1*t2*t3; int n = 0; int t[2] = {-1, 1}; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { int gcdt = gcd(t2*t3+t[i]*t1*t2, t1*t3+t[j]*t1*t2); if (gcdt > n) { n = gcdt; } } } int div = gcd(d, n); std::cout << d/div << "/" << n/div << std::endl; }