56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f3ca1000cf542c50fedc
|
||
challengeType: 5
|
||
title: 'Problem 93: Arithmetic expressions'
|
||
videoUrl: ''
|
||
localeTitle: 问题93:算术表达式
|
||
---
|
||
|
||
## Description
|
||
<section id="description">通过使用集合中的每个数字{1,2,3,4},恰好一次,并利用四个算术运算(+, - ,*,/)和括号/括号,可以形成不同的正整数目标。例如,8 =(4 *(1 + 3))/ 2 14 = 4 *(3 + 1/2)19 = 4 *(2 + 3) - 1 36 = 3 * 4 *(2 + 1)注数字的连接,如12 + 34,是不允许的。使用集合{1,2,3,4},可以获得31个不同的目标数,其中36个是最大的,并且在遇到第一个不可表达之前可以获得数字1到28中的每一个。数。找到四个不同数字的集合,a <b <c <d,可以获得最长的一组连续正整数,1到n,给出你的答案字符串:abcd。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler93()</code>应返回1258。
|
||
testString: 'assert.strictEqual(euler93(), 1258, "<code>euler93()</code> should return 1258.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler93() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler93();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|