2
How can we find numbers which are sums of squares of some subset of divisors?
source link: https://codeforces.com/blog/entry/109612?f0a28=1
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
How can we find numbers which are sums of squares of some subset of divisors till 10^10? First of all, I try to use dynamic programming with a subset sum algorithm, but I think it's not an optimal solution. Then I try to connect it with Pythagoras but I'm not getting a number pattern from it.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK