QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 1024 MB

#23626. 倒數之和

Statistics

俾定一個整數 $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.