56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			56 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | ||
| id: 5900f53e1000cf542c510051
 | ||
| challengeType: 5
 | ||
| title: 'Problem 466: Distinct terms in a multiplication table'
 | ||
| videoUrl: ''
 | ||
| localeTitle: 问题466:乘法表中的不同术语
 | ||
| ---
 | ||
| 
 | ||
| ## Description
 | ||
| <section id="description">令P(m,n)为m×n乘法表中的不同项的数量。 <p>例如,3×4乘法表如下所示: </p><p> ×12341 12342 24683 36912 </p><p>有8个不同的术语{1,2,3,4,6,8,9,12},因此P(3,4)= 8。 </p><p>给出:P(64,64)= 1263,P(12,345)= 1998,P(32,1015)= 13826382602124302。 </p><p>求P(64,1016)。 </p></section>
 | ||
| 
 | ||
| ## Instructions
 | ||
| <section id="instructions">
 | ||
| </section>
 | ||
| 
 | ||
| ## Tests
 | ||
| <section id='tests'>
 | ||
| 
 | ||
| ```yml
 | ||
| tests:
 | ||
|   - text: <code>euler466()</code>应该返回258381958195474750。
 | ||
|     testString: 'assert.strictEqual(euler466(), 258381958195474750, "<code>euler466()</code> should return 258381958195474750.");'
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Challenge Seed
 | ||
| <section id='challengeSeed'>
 | ||
| 
 | ||
| <div id='js-seed'>
 | ||
| 
 | ||
| ```js
 | ||
| function euler466() {
 | ||
|   // Good luck!
 | ||
|   return true;
 | ||
| }
 | ||
| 
 | ||
| euler466();
 | ||
| 
 | ||
| ```
 | ||
| 
 | ||
| </div>
 | ||
| 
 | ||
| 
 | ||
| 
 | ||
| </section>
 | ||
| 
 | ||
| ## Solution
 | ||
| <section id='solution'>
 | ||
| 
 | ||
| ```js
 | ||
| // solution required
 | ||
| ```
 | ||
| </section>
 |