QOJ.ac

QOJ

시간 제한: 2 s 메모리 제한: 1024 MB

#23626. 倒數和

통계

給定一個整數 $n > 1$ 以及以下方程式:

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

請找出兩個相異的正整數 $a, b$,使得它們滿足上述方程式,且它們的總和 $a + b$ 最小。

輸入格式

  • 輸入僅一行,包含一個整數 $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.