7409：An Easy question

题目描述

Xiao Ming is faced with a complex math problem. Given n, m, he is going to find a real number α such that f(1/2+α) is maximized, where f(t)=min|i/n-j/m+t|,i,j∈Z

. Please help him!

输入解释

The input contains zero or more test cases and is terminated by EOF.
Each test case contains two integers n,m.
1≤n,m≤〖10〗^9
The number of tests cases does not exceed 〖10〗^4.

输出解释

For each case, output a fraction p/q which denotes the result.

输入样例

1 1
1 3

输出样例

1/2
1/6

该题目包含在题集 SSPU新生赛中

题目来源 2017 2nd Shanghai Polytechnic University Programming Contest For Freshman

共提交 1 次

通过率 100.0%

时间上限	内存上限
1000 MS	128 MB