-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathb6987.js
More file actions
56 lines (46 loc) · 1.13 KB
/
b6987.js
File metadata and controls
56 lines (46 loc) · 1.13 KB
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
var fs = require("fs");
var input = fs.readFileSync("/dev/stdin").toString().trim().split("\n");
const inputs = input.map((r) => r.split(" ").map(Number));
const results = inputs.map((result) => {
const nationResult = [];
for (let i = 0; i < result.length; i += 3) {
nationResult.push(result.slice(i, i + 3));
}
return nationResult;
});
let answers = [];
let ans = 0;
results.forEach((result) => {
ans = 0;
const isResultSumFive = result.reduce(
(acc, row) => acc && row.reduce((acc, v) => acc + v, 0) === 5,
true
);
function tryMatch(n, i, winIdx, lseIdx) {
if (result[n][winIdx] > 0 && result[i][lseIdx] > 0) {
result[n][winIdx] -= 1;
result[i][lseIdx] -= 1;
recursion(n, i + 1);
result[n][winIdx] += 1;
result[i][lseIdx] += 1;
}
}
function recursion(n, i) {
if (n === 5) {
ans = 1;
return;
}
if (i === 6) {
recursion(n + 1, n + 2);
return;
}
tryMatch(n, i, 0, 2);
tryMatch(n, i, 1, 1);
tryMatch(n, i, 2, 0);
}
if (isResultSumFive) {
recursion(0, 1);
}
answers.push(ans);
});
console.log(answers.join(" "));