Wednesday, March 27, 2013

project euler problem 068

Magic 5-gon ring

This is a simple problem. My old code is pure brute force and can only be used for 5-gon.  I rewrote the code, it can be used of n-gon ring.  It takes 4ms to get the correct answer. 

update 09/21/2017 
a bug is found in my old code, an obvious one, which still successfully found the maximum value required in the problem but cannot generate all qualified sequences. 

 

No comments:

Post a Comment