56 lines
		
	
	
		
			1.3 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
		
		
			
		
	
	
			56 lines
		
	
	
		
			1.3 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
|   | --- | |||
|  | id: 5900f3f71000cf542c50ff0a | |||
|  | challengeType: 5 | |||
|  | title: 'Problem 139: Pythagorean tiles' | |||
|  | videoUrl: '' | |||
|  | localeTitle: 问题139:毕达哥拉斯瓷砖 | |||
|  | --- | |||
|  | 
 | |||
|  | ## Description
 | |||
|  | <section id="description">设(a,b,c)表示具有整数长边的直角三角形的三个边。可以将四个这样的三角形放在一起以形成长度为c的正方形。例如,(3,4,5)三角形可以放在一起形成一个5乘5的正方形,中间有一个1个洞,可以看到5乘5的正方形可以用二十五个平铺1个方格。 <p>但是,如果使用(5,12,13)三角形,则孔将按7乘7测量,并且这些不能用于平铺13乘13平方。鉴于直角三角形的周长小于一亿,有多少毕达哥拉斯三角形允许这样的平铺? </p></section> | |||
|  | 
 | |||
|  | ## Instructions
 | |||
|  | <section id="instructions"> | |||
|  | </section> | |||
|  | 
 | |||
|  | ## Tests
 | |||
|  | <section id='tests'> | |||
|  | 
 | |||
|  | ```yml | |||
|  | tests: | |||
|  |   - text: <code>euler139()</code>应该返回10057761。 | |||
|  |     testString: 'assert.strictEqual(euler139(), 10057761, "<code>euler139()</code> should return 10057761.");' | |||
|  | 
 | |||
|  | ``` | |||
|  | 
 | |||
|  | </section> | |||
|  | 
 | |||
|  | ## Challenge Seed
 | |||
|  | <section id='challengeSeed'> | |||
|  | 
 | |||
|  | <div id='js-seed'> | |||
|  | 
 | |||
|  | ```js | |||
|  | function euler139() { | |||
|  |   // Good luck! | |||
|  |   return true; | |||
|  | } | |||
|  | 
 | |||
|  | euler139(); | |||
|  | 
 | |||
|  | ``` | |||
|  | 
 | |||
|  | </div> | |||
|  | 
 | |||
|  | 
 | |||
|  | 
 | |||
|  | </section> | |||
|  | 
 | |||
|  | ## Solution
 | |||
|  | <section id='solution'> | |||
|  | 
 | |||
|  | ```js | |||
|  | // solution required | |||
|  | ``` | |||
|  | </section> |