Decompose a number into the shortest sum of squares

Question

question@mail.ru ·

Decompose a number into the shortest sum of squares

📁 example

Task: the user enters a number no greater than 10,000,000, the program must decompose the number into a sum of squares so that the number of these squares is minimal.

Example: 34 = 25+9

35 = 25+9+1

32 = 16+16

39 = 25+9+4+1

Honestly, I know Python at a 6+ level, but I can't figure out the algorithm itself, at least help me with that.

1 responses

answer@mail.ru · Answer 1

I solved my problem, I was missing the following:

apt-get install libgnutls28-dev

Thanks to everyone who tried to help.

Decompose a number into the shortest sum of squares

Blogs

Profiling JavaScript Code: Finding Bottlenecks in Node.js

Writing Documentation for a JavaScript Project: Best Practices

Working with Dates and Time in Rust: Advanced Techniques and Libraries

PHP for Machine Learning: Possibilities and Limitations for Beginners

Speaking the Same Language: Internationalization of JavaScript Applications

Similar questions