-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIteration1.js
More file actions
53 lines (41 loc) · 1018 Bytes
/
Copy pathIteration1.js
File metadata and controls
53 lines (41 loc) · 1018 Bytes
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
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", (inputStdin) => {
inputString += inputStdin;
});
process.stdin.on("end", (_) => {
inputString = inputString
.trim()
.split("\n")
.map((string) => {
return string.trim();
});
main();
});
function readLine() {
return inputString[currentLine++];
}
function sides(literals, ...expressions) {
let a = expressions[0];
let p = expressions[1];
let s1 = (p - Math.sqrt(Math.pow(p, 2) - 16 * a)) / 4;
let s2 = (p + Math.sqrt(Math.pow(p, 2) - 16 * a)) / 4;
return [s1, s2];
}
/*
* S1 is always the smaller one because of the (-)
* So I don't need to sort the array!
*/
function main() {
let s1 = +readLine();
let s2 = +readLine();
[s1, s2] = [s1, s2].sort();
const [x, y] = sides`The area is: ${s1 * s2}.\nThe perimeter is: ${
2 * (s1 + s2)
}.`;
console.log(s1 === x ? s1 : -1);
console.log(s2 === y ? s2 : -1);
}