56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | ||
| id: 5900f3bc1000cf542c50fecf
 | ||
| challengeType: 5
 | ||
| title: 'Problem 80: Square root digital expansion'
 | ||
| videoUrl: ''
 | ||
| localeTitle: 问题80:平方根数字扩展
 | ||
| ---
 | ||
| 
 | ||
| ## Description
 | ||
| <section id="description">众所周知,如果自然数的平方根不是整数,那么它是不合理的。这种平方根的十进制扩展是无限的,没有任何重复模式。二的平方根是1.41421356237309504880 ...,前一百个十进制数字的数字和是475.对于前一百个自然数,找到所有的前一百个十进制数字的数字总和的总和。不合理的平方根。 </section>
 | ||
| 
 | ||
| ## Instructions
 | ||
| <section id="instructions">
 | ||
| </section>
 | ||
| 
 | ||
| ## Tests
 | ||
| <section id='tests'>
 | ||
| 
 | ||
| ```yml
 | ||
| tests:
 | ||
|   - text: <code>euler80()</code>应返回40886。
 | ||
|     testString: 'assert.strictEqual(euler80(), 40886, "<code>euler80()</code> should return 40886.");'
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Challenge Seed
 | ||
| <section id='challengeSeed'>
 | ||
| 
 | ||
| <div id='js-seed'>
 | ||
| 
 | ||
| ```js
 | ||
| function euler80() {
 | ||
|   // Good luck!
 | ||
|   return true;
 | ||
| }
 | ||
| 
 | ||
| euler80();
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </div>
 | ||
| 
 | ||
| 
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Solution
 | ||
| <section id='solution'>
 | ||
| 
 | ||
| ```js
 | ||
| // solution required
 | ||
| ```
 | ||
| </section>
 |