56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | ||
| id: 5900f43e1000cf542c50ff50
 | ||
| challengeType: 5
 | ||
| title: 'Problem 210: Obtuse Angled Triangles'
 | ||
| videoUrl: ''
 | ||
| localeTitle: 问题210:钝角三角形
 | ||
| ---
 | ||
| 
 | ||
| ## Description
 | ||
| <section id="description">考虑点(x,y)的集合S(r),其中整数坐标满足| x | + | y | ≤r。设O为点(0,0),C为点(r / 4,r / 4)。令N(r)为S(r)中的点B的数量,使得三角形OBC具有钝角,即最大角度α满足90°<α<180°。因此,例如,N(4)= 24并且N(8)= 100。 <p>什么是N(1,000,000,000)? </p></section>
 | ||
| 
 | ||
| ## Instructions
 | ||
| <section id="instructions">
 | ||
| </section>
 | ||
| 
 | ||
| ## Tests
 | ||
| <section id='tests'>
 | ||
| 
 | ||
| ```yml
 | ||
| tests:
 | ||
|   - text: <code>euler210()</code>应该返回1598174770174689500。
 | ||
|     testString: 'assert.strictEqual(euler210(), 1598174770174689500, "<code>euler210()</code> should return 1598174770174689500.");'
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Challenge Seed
 | ||
| <section id='challengeSeed'>
 | ||
| 
 | ||
| <div id='js-seed'>
 | ||
| 
 | ||
| ```js
 | ||
| function euler210() {
 | ||
|   // Good luck!
 | ||
|   return true;
 | ||
| }
 | ||
| 
 | ||
| euler210();
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </div>
 | ||
| 
 | ||
| 
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Solution
 | ||
| <section id='solution'>
 | ||
| 
 | ||
| ```js
 | ||
| // solution required
 | ||
| ```
 | ||
| </section>
 |