QOJ.ac

QOJ

时间限制: 2 s 内存限制: 1024 MB

#23626. 逆数の和

统计

整数 $n > 1$ と次の方程式が与えられます:

$$\frac{1}{n} = \frac{1}{a} + \frac{1}{b}$$

上の方程式を満たし、かつ和 $a + b$ が最小となるような 2 つの相異なる正の整数 $a, b$ を求めてください。

入力

  • 入力は 1 行のみで、方程式の左辺に用いられる 1 つの整数 $n$($1 < n \le 10^8$)からなります。

出力

最適な $a$ と $b$ の組を昇順に出力してください。

入出力例

入力例 1

4

出力例 1

6 12

入力例 2

107

出力例 2

108 11556

入力例 3

999999

出力例 3

1998000 2002000

入力例 4

1000000

出力例 4

1800000 2250000

Discussions

About Discussions

The discussion section is only for posting: 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.

Open Discussions 0
No discussions in this category.

Issues

About Issues

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.