I think that with this kind of problem, you can process in two steps.
A first easy problem with small N (to test perms for example). And a harder problem with big N, which
oblige to find another algorithm.
Project Euler: Problem 1, Multiples of 3 and 5
2 b | ~ 2 b
Rotate and display numbered tile
Rotate input square matrix 90 degrees CCW without rot90
Sums of Distinct Powers
Community Problem 500!
Points on a circle.
"Find out the best cricket"
Now 20% off!
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