3842: Meteor
内存限制：256 MB
时间限制：8.000 S
评测方式：文本比较
命题人：
提交：2
解决：1
题目描述
Though time passes, there is always someone we will never forget.
"The probability of being hit by a meteor is one in a billion, but it is much more miraculous, to meet you in my life." said Tom to Jerry with affection.
"One in a billion? I may not agree with you." answered Jerry proudly, "Let's do the math."
....
Thinking of the days they have happily spent together, Tom can't help bursting into tears. Though Jerry has been gone for a long time, Tom still misses him every day. He remembers it was a sunny afternoon when Jerry and him were lying in the yard, working on the probability of a man being hit by a meteor.
Unlike Jerry, he was always slow. Jerry got the answer soon, but Tom was stuck as usual. In the end, Tom lost patience and asked Jerry to tell him the answer.
"I can't be so straightforward," snickered Jerry, "the only thing I will tell you is that the answer is pq, where p,q≤n,gcd(p,q)=1."
"Is it 1/n?"
"Is it 1/n−1?"
...
If answered "No" , he would try the minimum larger number that satisfies the requirement.
Tom only remembered n given by Jerry, and k, the times that he tried, but forgot what matters the most: Jerry's answer. Now, he wants you to help him find it.
"The probability of being hit by a meteor is one in a billion, but it is much more miraculous, to meet you in my life." said Tom to Jerry with affection.
"One in a billion? I may not agree with you." answered Jerry proudly, "Let's do the math."
....
Thinking of the days they have happily spent together, Tom can't help bursting into tears. Though Jerry has been gone for a long time, Tom still misses him every day. He remembers it was a sunny afternoon when Jerry and him were lying in the yard, working on the probability of a man being hit by a meteor.
Unlike Jerry, he was always slow. Jerry got the answer soon, but Tom was stuck as usual. In the end, Tom lost patience and asked Jerry to tell him the answer.
"I can't be so straightforward," snickered Jerry, "the only thing I will tell you is that the answer is pq, where p,q≤n,gcd(p,q)=1."
"Is it 1/n?"
"Is it 1/n−1?"
...
If answered "No" , he would try the minimum larger number that satisfies the requirement.
Tom only remembered n given by Jerry, and k, the times that he tried, but forgot what matters the most: Jerry's answer. Now, he wants you to help him find it.
输入
The first line contains an integer T(T≤10^2), the number of test cases.
The next Tlines, each line contains two numbers, n,k(2≤n≤10^6), indicating a query.
The answer is guaranteed to be in (0,1].
The next Tlines, each line contains two numbers, n,k(2≤n≤10^6), indicating a query.
The answer is guaranteed to be in (0,1].
输出
Tlines, each line contains a fraction in term of p/q ,where gcd(p,q)=1.
样例输入 复制
5
4 6
5 1
9 9
3 4
7 11样例输出 复制
1/1
1/5
1/3
1/1
3/5提示
g++ compiler on HDOJ supports __int128.