QOJ.ac

QOJ

Süre Sınırı: 2 s Bellek Sınırı: 1024 MB

#23626. 倒数和

İstatistikler

Bu problem aşağıdaki yarışmalarda kullanıldı:

The 2026 ICPC UK & Ireland Programming Contest (UKIEPC 2026)

给定一个整数 $n > 1$ 以及如下方程：

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

请找出两个不同的正整数 $a, b$，使得它们满足上述方程，且它们的和 $a + b$ 最小。

输入格式

输入仅一行，包含一个整数 $n$（$1 < n \le 10^8$）——表示方程左边的数。

输出格式

按升序输出 $a$ 和 $b$ 的最优选择。

样例

输入格式 1

输出格式 1

6 12

输入格式 2

输出格式 2

108 11556

输入格式 3

输出格式 3

1998000 2002000

输入格式 4

输出格式 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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
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.