* 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>
806 B
806 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f3c71000cf542c50feda | 问题91:带有整数坐标的直角三角形 | 5 | problem-91-right-triangles-with-integer-coordinates |
--description--
点P(x1,y1)和Q(x2,y2)绘制在整数坐标处并连接到原点O(0,0),以形成ΔOPQ。
正好有十四个三角形包含一个直角,当每个坐标位于0和2之间时,可以形成直角;即,0≤x1,y1,x2,y2≤2。
假设0≤x1,y1,x2,y2≤50,可以形成多少个直角三角形?
--hints--
euler91()
应返回euler91()
。
assert.strictEqual(euler91(), 14234);
--seed--
--seed-contents--
function rightTrianglesIntCoords() {
return true;
}
rightTrianglesIntCoords();
--solutions--
// solution required