The 8th test case is correct and can be solved within Cody's time limit. Why is it not being used? Up to 200.000, there are 20 amicable pairs.
For instance 176272,180848 is the 20th pair. For 3e5 my code can't go fast enough for Cody (45s), but I've found just 2 additional pairs 196724, 202444 and 185368, 203432.
Read a Soroban Abacus
Project Euler: Problem 8, Find largest product in a large string of numbers
Back to basics 22 - Rotate a matrix
Convert a structure into a string
Replace multiples of 5 with NaN
An n-sided regular polygon is drawn within a circle whose radius is 'r', what will be the area of the polygon?
Can the knight take out the pawn?
Find the treasures in MATLAB Central and discover how the community can help you!
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