56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
|
id: 5900f49b1000cf542c50ffae
|
|
challengeType: 5
|
|
title: 'Problem 303: Multiples with small digits'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 303: Múltiplos con dígitos pequeños'
|
|
---
|
|
|
|
## Description
|
|
<section id="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, . <p> Encontrar . </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler303()</code> debe devolver 1111981904675169.
|
|
testString: 'assert.strictEqual(euler303(), 1111981904675169, "<code>euler303()</code> should return 1111981904675169.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler303() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler303();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|