Shulou(Shulou.com)06/01 Report--

This article is about how to use java to solve the affinity problem. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

Note that d (n) is the sum of all true factors of n (positive integers less than n and divisible n).

If d (a) = b and d (b) = a, and a ≠ b, then an and b form an affinity pair, and an and b are called affinity numbers.

For example, the true factor of 220 includes 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 100, so d (220) = 284, while the true factor of 284 includes 1, 2, 4, 71 and 142, so d (284) = 220.

Find the sum of all affinity numbers less than 10000.

System.out.println (factorialDigitSum)

Analysis:

Neither int nor long can be represented, so if you want to use BinInteger, it's easy not to introduce it.

Thank you for reading! This is the end of this article on "how to use java to solve affinity problems". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.