#t163. 亲和数
亲和数
Amicable Numbers
Problem Background
Special for beginners, ^_^
Problem Description
A divisor of a natural number is any natural number that divides , excluding itself. For example, the divisors of are . If the sum of the divisors of equals , and the sum of the divisors of equals , then and are called a pair of "amicable numbers". Find the smallest pair of amicable numbers ().
Input Format
(None)
Output Format
One line containing and ().
Constraints
1s, 1024KiB for each test case.