56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f4c71000cf542c50ffd8
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 346: Strong Repunits'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题346:强大的Repunits
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">数字7是特殊的,因为7是用基数2写的111,用基数6写的是11(即710 = 116 = 1112)。换句话说,7是至少两个碱基b> 1的重新排列。 <p>我们将调用一个正整数,该属性是一个强大的repunit。可以证实,在50以下有8个强大的重新命令:{1,7,13,15,21,31,40,43}。此外,1000以下的所有强大的重新命令的总和等于15864。 </p><p>找出1012以下所有强大的回购总和。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler346()</code>应该返回336108797689259260。
|
|||
|
testString: 'assert.strictEqual(euler346(), 336108797689259260, "<code>euler346()</code> should return 336108797689259260.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler346() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler346();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|