gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(curriculum): clean-up Project Euler 261-280 (#42905)

Browse Source 
* fix: clean-up Project Euler 261-280

* fix: typo

* fix: typo

* fix: typo
This commit is contained in:
gikf
2021-07-24 09:09:54 +02:00
committed by GitHub
parent f4dc81bce3
commit f93acf28a6
20 changed files with 219 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
View File

@ -8,24 +8,26 @@ dashedName: problem-262-mountain-range
# --description--
The following equation represents the continuous topography of a mountainous region, giving the elevation h at any point (x,y):
The following equation represents the continuous topography of a mountainous region, giving the elevation $h$ at any point ($x$,$y$):
A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ x, y ≤ 1600.
$$h = \left(5000 - \frac{x^2 + y^2 + xy}{200} + \frac{25(x + y)}{2}\right) \times e^{-\left|\frac{x^2 + y^2}{1\\,000\\,000} - \frac{3(x + y)}{2000} + \frac{7}{10}\right|}$$
Because of the intervening mountains, it first rises straight up to a point A', having elevation f. Then, while remaining at the same elevation f, it flies around any obstacles until it arrives at a point B' directly above B.
A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by $0 ≤ x$, $y ≤ 1600$.
First, determine fmin which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation fmin.
Because of the intervening mountains, it first rises straight up to a point A', having elevation $f$. Then, while remaining at the same elevation $f$, it flies around any obstacles until it arrives at a point B' directly above B.
First, determine $f_{min}$ which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation $f_{min}$.
Give that length as your answer, rounded to three decimal places.
Note: For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )
**Note:** For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`.
# --hints--
`euler262()` should return 2531.205.
`mountainRange()` should return `2531.205`.
```js
assert.strictEqual(euler262(), 2531.205);
assert.strictEqual(mountainRange(), 2531.205);
```
# --seed--
@ -33,12 +35,12 @@ assert.strictEqual(euler262(), 2531.205);
## --seed-contents--
```js
function euler262() {
function mountainRange() {
return true;
}
euler262();
mountainRange();
```
# --solutions--