-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path22b.js
75 lines (58 loc) · 1.66 KB
/
22b.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import {readInput} from "./lib.js";
const input = readInput(22);
function next(prev) {
let result;
let secret = prev;
result = secret * 64n;
secret = secret ^ result;
secret = secret % 16777216n;
result = secret / 32n;
// result = Math.floor(result);
secret = secret ^ result;
secret = secret % 16777216n;
result = secret * 2048n;
secret = secret ^ result;
secret = secret % 16777216n;
return secret;
}
const counts = new Map();
input
.map(BigInt)
.map(x => {
const numbers = [x];
for (let i = 0; i < 2000; i++) {
x = next(x);
numbers.push(x);
}
return numbers;
})
.map((numbers) => {
return numbers.map((num, i) => {
return parseInt(num.toString().at(-1));
});
})
// .map((numbers) => {
// return numbers.map((num, i) => {
// return [num, num - numbers[i - 1]];
// })
// })
.map((numbers) => {
const seen = new Set();
for (let i = 0; i < numbers.length - 4; i++) {
const [a, b, c, d, e] = numbers.slice(i, i + 5);
const key = `${b - a},${c - b},${d - c},${e - d}`;
if (seen.has(key)) {
continue;
}
seen.add(key);
if (counts.has(key)) {
// counts.get(key).push(e);
counts.set(key, counts.get(key) + e);
} else {
// counts.set(key, [e]);
counts.set(key, e);
}
}
});
const answer = [...counts.entries()].sort((a, b) => b[1] - a[1]);//.at(0).at(1);
console.log(answer.at(0).at(1));