Codeforces Round 613 (Div. 2)
翻译中…
Today, Osama gave Fadi an integer $X$, and Fadi was wondering about the minimum possible value of $max(a, b)$ such that $LCM(a, b)$ equals $X$. Both $a$ and $b$ should be positive integers.
翻译中…
$LCM(a, b)$ is the smallest positive integer that is divisible by both $a$ and $b$. For example, $LCM(6, 8) = 24$, $LCM(4, 12) = 12$, $LCM(2, 3) = 6$.
翻译中…
Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?
翻译中…
Input
翻译中…
The first and only line contains an integer $X$ ($1 \le X \le 10^{12}$).
翻译中…
Output
翻译中…
Print two positive integers, $a$ and $b$, such that the value of $max(a, b)$ is minimum possible and $LCM(a, b)$ equals $X$. If there are several possible such pairs, you can print any.
翻译中…
样例
Input #1
2
Output #1
1 2
InputCopy
OutputCopy
Input #2
6
Output #2
2 3
InputCopy
OutputCopy
Input #3
4
Output #3
1 4
InputCopy
OutputCopy
Input #4
1
Output #4
1 1
InputCopy
OutputCopy
题目信息
标签
暴力
数学
数论
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。