View Code of Problem 66

#include <iostream>

using namespace std;

/**
 * kkmd66 四刷
 * @param a 
 * @param b 
 * @return 
 */
int gcd(int a, int b) {
    if (b == 0)
        return a;
    else
        return gcd(b, a % b);
}

/**
 * kkmd66 四刷
 * @return 
 */
int main() {

    int a, b;
    while (cin >> a >> b && a != 0 && b != 0) {
        //相等
        if (a == b)
            cout << 1 << endl;
        //不相等
        else {
            int max = gcd(a, b);
            cout << a / max << "/" << b / max << endl;
        }
    }

    return 0;
}