freeCodeCamp/problem-393-migrating-ants.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

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.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4f61000cf542c510008	5	false	Problem 393: Migrating ants	302058

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);

Challenge Seed

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

euler393();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape