内存限制:256 MB
时间限制:2 S
标准输入输出
题目类型:传统
评测方式:文本比较
上传者:
提交:1
通过:1
Let's assume that
-
v(n) is the largest prime number, that does not exceed n;
-
u(n) is the smallest prime number strictly greater than n.
Find
.
Output
Print
t lines: the
i-th of them must contain the answer to the
i-th test as an irreducible fraction "
p/q", where
p,q are integers,
q>0.