Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

56 lines
967 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f47b1000cf542c50ff8d
challengeType: 5
title: 'Problem 271: Modular Cubes, part 1'
videoUrl: ''
localeTitle: 问题271模块化立方体第1部分
---
## Description
<section id="description">对于正数n将Sn定义为整数x的总和为1 <p>当n = 91时x有8个可能的值9,16,22,29,53,74,79,81。因此S91= 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363。 </p><p>找到S13082761331670030</p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler271()</code>应返回4617456485273130000。
testString: assert.strictEqual(euler271(), 4617456485273130000);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler271() {
// Good luck!
return true;
}
euler271();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>