freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-...

43 lines
806 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f3c71000cf542c50feda
title: 问题91带有整数坐标的直角三角形
challengeType: 5
videoUrl: ''
dashedName: problem-91-right-triangles-with-integer-coordinates
---
# --description--
点Px1y1和Qx2y2绘制在整数坐标处并连接到原点O0,0以形成ΔOPQ。
正好有十四个三角形包含一个直角当每个坐标位于0和2之间时可以形成直角;即0≤x1y1x2y2≤2。
假设0≤x1y1x2y2≤50可以形成多少个直角三角形
# --hints--
`euler91()`应返回`euler91()` 。
```js
assert.strictEqual(euler91(), 14234);
```
# --seed--
## --seed-contents--
```js
function rightTrianglesIntCoords() {
return true;
}
rightTrianglesIntCoords();
```
# --solutions--
```js
// solution required
```