56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4f11000cf542c510002
|
||
challengeType: 5
|
||
title: 'Problem 388: Distinct Lines'
|
||
videoUrl: ''
|
||
localeTitle: 问题388：不同的线条
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑所有格点（a，b，c），其中0≤a，b，c≤N。 <p>从原点O（0,0,0）开始，所有线都被绘制到其他格点。设D（N）是不同的这种线的数量。 </p><p>您被给予D（1 000 000）= 831909254469114121。 </p><p>找到D（1010）。将前9位数字后跟最后9位数字作为答案。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler388()</code>应该返回831907372805130000。
|
||
testString: 'assert.strictEqual(euler388(), 831907372805130000, "<code>euler388()</code> should return 831907372805130000.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler388() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler388();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|