freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md

---
id: 5900f47b1000cf542c50ff8d
challengeType: 5
videoUrl: ''
title: 问题271：模块化立方体，第1部分
---

## Description
<section id="description">对于正数n，将S（n）定义为整数x的总和，为1 <p>当n = 91时，x有8个可能的值，即：9,16,22,29,53,74,79,81。因此，S（91）= 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363。 </p><p>找到S（13082761331670030）。 </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>