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 #174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements.
  4. Discussions

Project Euler #174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements.

  • gautamsw5
     + 0 comments

    Useless problem Time limit excceds by small margin even for O(N) pre-computation and O(1) queries Tried 6-7 languages, worked in Python 2