Algorithm

A. Die Roll
time limit per test
1 second
memory limit per test
64 megabytes
Problem Link- https://codeforces.com/problemset/problem/9/A
input
standard input
output
standard output

Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.

But to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.

Yakko thrown a die and got Y points, Wakko — W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.

It is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.

Input

The only line of the input file contains two natural numbers Y and W — the results of Yakko's and Wakko's die rolls.

Output

Output the required probability in the form of irreducible fraction in format «A/B», where A — the numerator, and B — the denominator. If the required probability equals to zero, output «0/1». If the required probability equals to 1, output «1/1».

Examples
input
Copy
4 2
output
Copy
1/2
Note

Dot will go to Transylvania, if she is lucky to roll 4, 5 or 6 points.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

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

int main(){

    int first, second; scanf("%d %d", &first, &second);
    if(first < second){first = second;}

    const int numSides(6);
    int nom(numSides - first + 1), den(numSides);
    int div(gcd(nom, den)); nom /= div; den /= div;
    printf("%d/%d", nom, den>;
    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
4 2

Output

x
–
+
cmd
1/2
Advertisements

Demonstration

Codeforces Solution-A. Die Roll-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+