#include <iostream>
#include <algorithm>
#include <cmath>

int gcd(int a, int b) {
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

int main() {
    int Y, W;
    std::cin >> Y >> W;

    int max_num = std::max(Y, W);
    int remaining_chances = 6 - max_num + 1;
    int numerator = remaining_chances;
    int denominator = 6;

    int divisor = gcd(numerator, denominator);
    numerator /= divisor;
    denominator /= divisor;

    std::cout << numerator << "/" << denominator << std::endl;

    return 0;
}
``

原文地址: http://www.cveoy.top/t/topic/h8O0 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录