freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

806 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f3c71000cf542c50feda 问题91带有整数坐标的直角三角形 5 problem-91-right-triangles-with-integer-coordinates

--description--

点Px1y1和Qx2y2绘制在整数坐标处并连接到原点O0,0以形成ΔOPQ。

正好有十四个三角形包含一个直角当每个坐标位于0和2之间时可以形成直角;即0≤x1y1x2y2≤2。

假设0≤x1y1x2y2≤50可以形成多少个直角三角形

--hints--

euler91()应返回euler91()

assert.strictEqual(euler91(), 14234);

--seed--

--seed-contents--

function rightTrianglesIntCoords() {

  return true;
}

rightTrianglesIntCoords();

--solutions--

// solution required