ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
41 lines
997 B
Markdown
41 lines
997 B
Markdown
---
|
||
id: 5900f47c1000cf542c50ff8e
|
||
title: 问题270：切割方块
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-270-cutting-squares
|
||
---
|
||
|
||
# --description--
|
||
|
||
放置具有整数尺寸N×N的正方形纸，在原点处具有拐角，并且沿x轴和y轴具有两个侧面。然后，我们按照以下规则进行切割：我们只在位于正方形不同侧面的两个点之间进行直线切割，并且具有整数坐标。两个切口不能交叉，但是几个切口可以在相同的边界点处相遇。继续进行，直到不再进行合法削减。将任何反射或旋转计数为不同，我们将C（N）称为切割N×N平方的方式的数量。例如，C（1）= 2且C（2）= 30（如下所示）。
|
||
|
||
什么是C（30）mod 108？
|
||
|
||
# --hints--
|
||
|
||
`euler270()`应该返回82282080。
|
||
|
||
```js
|
||
assert.strictEqual(euler270(), 82282080);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler270() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler270();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|