56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f4e61000cf542c50fff9
|
||
challengeType: 5
|
||
title: 'Problem 378: Triangle Triples'
|
||
videoUrl: ''
|
||
localeTitle: 问题378:三角形三元组
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设T(n)为第n个三角形数,因此T(n)= <p> n(n + 1)2 </p><p> 。 </p><p>设dT(n)为T(n)的除数。例如:T(7)= 28且dT(7)= 6。 </p><p>令Tr(n)为三元组数(i,j,k),使得1≤i<j <k≤n且dT(i)> dT(j)> dT(k)。 Tr(20)= 14,Tr(100)= 5772,Tr(1000)= 11174776。 </p><p>找Tr(60 000 000)。给出答案的最后18位数字。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler378()</code>应该返回147534623725724700。
|
||
testString: 'assert.strictEqual(euler378(), 147534623725724700, "<code>euler378()</code> should return 147534623725724700.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler378() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler378();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|