Files

Evgeny Klimenchenko db369fbed1 fix(client): remove JS comments from user code for tests (#41873 )

* Removes comments in js challanges by default

* fix local-scope-and-functions test regex

* fix all languages

* revert language changes

* removed unnecessary removeJSComments from challenges

* fix challanges in other languages

* removed removeJSComments from all challanges

2021-04-28 10:18:54 -05:00

1.8 KiB

Raw Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3971000cf542c50feaa	Problem 43: Sub-string divisibility	5	302100	problem-43-sub-string-divisibility

--description--

The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.

Let d₁ be the 1^st digit, d₂ be the 2^nd digit, and so on. In this way, we note the following:

d₂d₃d₄ = 406 is divisible by 2
d₃d₄d₅ = 063 is divisible by 3
d₄d₅d₆ = 635 is divisible by 5
d₅d₆d₇ = 357 is divisible by 7
d₆d₇d₈ = 572 is divisible by 11
d₇d₈d₉ = 728 is divisible by 13
d₈d₉d₁₀ = 289 is divisible by 17

Find the numbers of all 0 to 9 pandigital numbers with this property.

--hints--

substringDivisibility() should return an array.

assert(Array.isArray(substringDivisibility()));

substringDivisibility() should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].

assert.sameMembers(substringDivisibility(), [
  1430952867,
  1460357289,
  1406357289,
  4130952867,
  4160357289,
  4106357289
]);

You should not copy and return the array.

assert(
  !code.match(/(1430952867)|(1460357289)|(1406357289)|(4130952867)|(4160357289)|(4106357289)/)
);

--seed--

--seed-contents--

function substringDivisibility() {

  return [];
}

substringDivisibility();

--solutions--

// solution required

1.8 KiB Raw Blame History