freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f43f1000cf542c50ff52	5	Problem 211: Divisor Square Sum		问题211：除数平方和

Description

对于正整数n，令σ2（n）为其除数的平方和。例如，σ2（10）= 1 + 4 + 25 + 100 = 130.找到所有n的总和，0 <n <64,000,000，使得σ2（n）是完美的平方。

Instructions

Tests

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

Challenge Seed

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

euler211();

Solution

// solution required