We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #150: Searching a triangular array for a sub-triangle having minimum-sum.
  4. Discussions

Project Euler #150: Searching a triangular array for a sub-triangle having minimum-sum.

  • RamtinA
     + 0 comments

    I have O(n^3) complexity but only the first case passes (used C++). This is a frustrating problem. It may even timeout in IO!