61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
1.4 KiB
Markdown
57 lines
1.4 KiB
Markdown
---
|
||
id: 5900f40e1000cf542c50ff21
|
||
challengeType: 5
|
||
title: 'Problem 162: Hexadecimal numbers'
|
||
videoUrl: ''
|
||
localeTitle: 问题162：十六进制数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">在十六进制数中，系统使用16个不同的数字表示数字：0,1,2,3,4,5,6,7,8,9，A，B，C，D，E，F写入时的十六进制数AF在十进制数系统中等于10x16 + 15 = 175。在3位十六进制数10A，1A0，A10和A01中，数字0,1和A都存在。就像用十进制数写的数字一样，我们写十六进制数而不带前导零。包含最多十六个十六进制数字的十六进制数是多少，所有数字0,1和A至少出现一次？将答案作为十六进制数字给出。 （A，B，C，D，E和F大写，没有任何前导或尾随代码将数字标记为十六进制且没有前导零，例如1A3F而不是：1a3f而不是0x1a3f而不是$ 1A3F而不是＃1A3F而不是0000001A3F） </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler162()</code> 应该返回3D58725572C62302。
|
||
testString: assert.strictEqual(euler162(), '3D58725572C62302');
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler162() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler162();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|