EN
RU
ES
ZH
FR
DE
PT
AR
HI
question@mail.ru
·
The amount of cubes with recursion - finding the best amount of cubes
📁 Advanced Python Topics, AI
sumofcubes ( n ): if n == 0 : return sumofcubes (n - ( int (n ** ( 1 / 3 ))) ** 3 ) print (( int (n ** ( 1 / 3 )) ** 3 ), end = '' ') sumofcubes ( int ( input ())) Important! The task should be solved by a recursive function.
The task is to represent
No answers yet.
Log in to leave an answer
Blogs
Deploying Rust on Kubernetes: A Practical Basic Guide
JavaScript Application Performance Optimization: A Practical Guide
Mock Objects and Fixtures in C#: The Secret to Perfect Unit Tests
Server-Sent Events in Java: How to Send Real-Time Data Without WebSocket
