freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-120-square-remainders.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3e41000cf542c50fef7	5	Problem 120: Square remainders		问题120：方形剩余部分

Description

设r是（a-1）n +（a + 1）n除以a2时的余数。例如，如果a = 7且n = 3，则r = 42：63 + 83 =728≡42mod 49.并且当n变化时，r也将变化，但是对于a = 7，结果是rmax = 42。对于3≤a≤1000，找到Σrmax。

Instructions

Tests

tests:
  - text: <code>euler120()</code>应返回333082500。
    testString: 'assert.strictEqual(euler120(), 333082500, "<code>euler120()</code> should return 333082500.");'

Challenge Seed

function euler120() {
  // Good luck!
  return true;
}

euler120();

Solution

// solution required