QOJ.ac

QOJ

Límite de tiempo: 2 s Límite de memoria: 1024 MB

#23626. Somme d'inverses

Estadísticas

On vous donne un entier $n > 1$, ainsi que l'équation :

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

Trouvez deux entiers strictement positifs distincts $a, b$ qui vérifient l'équation ci-dessus et dont la somme $a + b$ est minimale.

Entrée

  • La seule ligne d'entrée contient un entier $n$ ($1 < n \le 10^8$) — le nombre figurant dans le membre de gauche de l'équation.

Sortie

Affichez les meilleurs choix pour $a$ et $b$ par ordre croissant.

Exemples

Entrée 1

4

Sortie 1

6 12

Entrée 2

107

Sortie 2

108 11556

Entrée 3

999999

Sortie 3

1998000 2002000

Entrée 4

1000000

Sortie 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.