freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-193-squarefree-numb...

56 lines
927 B
Markdown
Raw Normal View History

---
id: 5900f42f1000cf542c50ff41
challengeType: 5
title: 'Problem 193: Squarefree Numbers'
videoUrl: ''
localeTitle: 问题193无广场数字
---
## Description
<section id="description">如果没有素数的平方除n则正整数n称为squarefree因此1,2,3,5,6,7,10,11是无平方的但不是4,8,9,12。 <p> 250以下有多少平方数 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler193()</code>应该返回684465067343069。
testString: 'assert.strictEqual(euler193(), 684465067343069, "<code>euler193()</code> should return 684465067343069.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler193() {
// Good luck!
return true;
}
euler193();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>