freeCodeCamp/problem-270-cutting-squares.english.md at 92377cf71af628cb5ea6b28ff7d6fa66a9b52449

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.3 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f47c1000cf542c50ff8e	5	false	Problem 270: Cutting Squares	301920

Description

A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules: We only make straight cuts between two points lying on different sides of the square, and having integer coordinates. Two cuts cannot cross, but several cuts can meet at the same border point. Proceed until no more legal cuts can be made. Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).

What is C(30) mod 108 ?

Instructions

Tests

tests:
  - text: <code>euler270()</code> should return 82282080.
    testString: assert.strictEqual(euler270(), 82282080);

Challenge Seed

function euler270() {
  // Good luck!
  return true;
}

euler270();

Solution

// solution required

1.3 KiB Raw Blame History Unescape Escape