freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-303-multiples-with-...

56 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5900f49b1000cf542c50ffae
challengeType: 5
title: 'Problem 303: Multiples with small digits'
videoUrl: ''
localeTitle: 'Problema 303: Múltiplos com dígitos pequenos'
---
## Description
<section id="description"> Para um inteiro positivo n, defina f (n) como o múltiplo menos positivo de n que, escrito na base 10, usa apenas dígitos ≤ 2. Assim f (2) = 2, f (3) = 12, f (7) = 21, f (42) = 210, f (89) = 1121222. Além disso, . <p> Encontrar . </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler303()</code> deve retornar 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>