freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.spanish.md

id, localeTitle, challengeType, title

id	localeTitle	challengeType	title
5	5900f49b1000cf542c50ffae	5	Problem 303: Multiples with small digits

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,.

Buscar.

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