---
title: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
localeTitle: 计算可以形成一个，两个，三个......不同排列的“空心”方形薄片的数量
---
## 问题174：计算可以形成一个，两个，三个......不同排列的“空心”方形薄片的数量

这是一个存根。 [帮助我们的社区扩展它](https://github.com/freecodecamp/guides/tree/master/src/pages/certifications/coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-…-distinct-arrangements/index.md) 。

[这种快速风格指南有助于确保您的拉取请求被接受](https://github.com/freecodecamp/guides/blob/master/README.md) 。