As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
将分母不超过 $n$ 的所有最简真分数从小到大排成一行，求第 $k$ 个位置上的分数
一个分数 $\frac{p}{q}$ 为最简真分数，当且仅当 $1\leq p < q$ 且 $p,q$ 互质
一行两个正整数 $n, k$，用空格分隔
一行两个正整数 $p, q$，用空格分隔，代表答案为 $\frac{p}{q}$
6 5
2 5
666 66666
300 607
对于$24\%$的数据： $n \leq 10$
对于$60\%$的数据： $n \leq 100$
对于$97\%$的数据： $n \leq 1000$
对于$100\%$的数据： $2\leq n \leq 10^7$，$1 \leq k < \sum_{i=1}^n \varphi (i)$，其中 $\varphi(n)$ 代表比 $n$ 小的数中与 $n$ 互质的数的个数
时间限制：$1\texttt{s}$
空间限制：$256\texttt{MB}$
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: