freeCodeCamp/problem-393-migrating-ants.english.md at 0a330e65f902dcbf750d0f0666c737dd9335f76d

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4f61000cf542c510008	5	Problem 393: Migrating ants

Description

An n×n grid of squares contains n2 ants, one ant per square. All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners). We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.

You are given that f(4) = 88. Find f(10).

Instructions

Tests

tests:
  - text: <code>euler393()</code> should return 112398351350823100.
    testString: assert.strictEqual(euler393(), 112398351350823100, '<code>euler393()</code> should return 112398351350823100.');

Challenge Seed

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

euler393();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape