Find two triangular numbers whose sum is input.
Note: The difference beetween the triangular numbers should be minimum.
When I click on solutions, a single solution is appearing and other solutions are like sub-solutions of this single solution. Something odd is going on here.
That solution is too wide to fit in Cody's editor, and it is automatically truncated into incomplete text (thus is valid only for the first run and becomes invalid upon re-scoring). Since it is very wide, it somehow shifts all other solutions to the right, making them look like sub-solutions.It has been re-scored to invalid and should not give confusion any more.
Ok. Thanks for the explanation.
Project Euler: Problem 5, Smallest multiple
Return the Fibonacci Sequence
Matlab Basics - Rounding III
Divide by 4
MATLAB Basic: rounding IV
longest sequence of nans
Integer to boolean
Fill the Matrix - 2
Low level NaN
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office