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

fix: clean-up Project Euler 401-420 (#43028)

Browse Source
This commit is contained in:
gikf
2021-07-29 19:48:24 +02:00
committed by GitHub
parent c18554dd44
commit 7bd08ae2ee
20 changed files with 269 additions and 182 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
View File

@ -8,22 +8,22 @@ dashedName: problem-415-titanic-sets
# --description--
A set of lattice points S is called a titanic set if there exists a line passing through exactly two points in S.
A set of lattice points $S$ is called a titanic set if there exists a line passing through exactly two points in $S$.
An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.
An example of a titanic set is $S = \\{(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)\\}$, where the line passing through (0, 1) and (2, 0) does not pass through any other point in $S$.
On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.
For any positive integer N, let T(N) be the number of titanic sets S whose every point (x, y) satisfies 0 ≤ x, y ≤ N. It can be verified that T(1) = 11, T(2) = 494, T(4) = 33554178, T(111) mod 108 = 13500401 and T(105) mod 108 = 63259062.
For any positive integer $N$, let $T(N)$ be the number of titanic sets $S$ whose every point ($x$, $y$) satisfies $0 ≤ x$, $y ≤ N$. It can be verified that $T(1) = 11$, $T(2) = 494$, $T(4) = 33\\,554\\,178$, $T(111)\bmod {10}^8 = 13\\,500\\,401$ and $T({10}^5)\bmod {10}^8 = 63\\,259\\,062$.
Find T(1011) mod 108.
Find $T({10}^{11})\bmod {10}^8$.
# --hints--
`euler415()` should return 55859742.
`titanicSets()` should return `55859742`.
```js
assert.strictEqual(euler415(), 55859742);
assert.strictEqual(titanicSets(), 55859742);
```
# --seed--
@ -31,12 +31,12 @@ assert.strictEqual(euler415(), 55859742);
## --seed-contents--
```js
function euler415() {
function titanicSets() {
return true;
}
euler415();
titanicSets();
```
# --solutions--