freeCodeCamp/problem-303-multiples-with-small-digits.spanish.md at 6db0c1e71b51b8246eec28b5cba5e1a7a766081d

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

2018-10-11 02:15:05 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f49b1000cf542c50ffae	5	Problem 303: Multiples with small digits		Problema 303: Múltiplos con dígitos pequeños

Description

Para un entero positivo n, defina f (n) como el mínimo positivo múltiplo de n que, escrito en base 10, usa solo dígitos ≤ 2. Por lo tanto, f (2) = 2, f (3) = 12, f (7) = 21, f (42) = 210, f (89) = 1121222. También, .

Encontrar .

Instructions

Tests

tests:
  - text: <code>euler303()</code> debe devolver 1111981904675169.
    testString: 'assert.strictEqual(euler303(), 1111981904675169, "<code>euler303()</code> should return 1111981904675169.");'

Challenge Seed

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

euler303();

Solution

// solution required

1.0 KiB Raw Blame History