Project Euler #174: Counting the number of hollow square laminae that can form one, two, three, ... distinct arrangements.
| Problem Name: | Project Euler #174: Counting the number of hollow square laminae that can form one, two, three, ... distinct arrangements. | |
| Site: | HackerRank | |
| Links: | ||
| Tags: | ||
| Problem setters: |
