56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3d01000cf542c50fee2
|
||
challengeType: 5
|
||
title: 'Problem 99: Largest exponential'
|
||
videoUrl: ''
|
||
localeTitle: 问题99：最大的指数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">比较以索引形式（如211和37）编写的两个数字并不困难，因为任何计算器都会确认211 = 2048 <37 = 2187.但是，确认632382518061> 519432525806会更加困难，因为这两个数字都包含超过三百万个数字。使用base_exp.txt（右键单击并“将链接/目标另存为...”），一个22K文本文件包含每行上带有基数/指数对的一千行，确定哪个行号具有最大数值。注意：文件中的前两行代表上面给出的示例中的数字。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler99()</code>应该返回709。
|
||
testString: 'assert.strictEqual(euler99(), 709, "<code>euler99()</code> should return 709.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler99() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler99();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|