https://www.freecodecamp.org/learn/project-euler/#project-eu...
> A number is a perfect square, or a square number, if it is the square of a positive integer. For example, is a square number because ; it is also an odd square. The first 5 square numbers are: , and the sum of the odd squares is . Among the first 881 thousand square numbers, what is the sum of all the odd squares?
I wanted to use Uiua, and hence:
/+ⁿ2+1⍜÷⇡ 2 881000
But Uiua doesn’t support big ints, just f64. So yuck, python to get an accurate answer. Just sad now.
Skills are trained by practice and thinking. Skilled people will never be subsidized by AI. Unskilled juniors, who don't train properly will go into tranches (as it's already happening).
Hmm. Given such a triangle, let m be the largest number in the triangle. For each x in the triangle, replace it with m - x. For the resulting triangle, solve it to give the shortest path using one of the well known network shortest path algorithms.
By the time you've actually done these two steps, you could have already finished the problem with a dynamic programming approach.
(Starting from the bottom row and working upward, replace each cell in the row with the length of the longest path from itself to the bottom, which you can know by checking which of its two children has the longer path associated.)