Node.js) 백준 20157번: 화살을 쏘자!

https://www.acmicpc.net/problem/20157

20157번: 화살을 쏘자!

const [N, ...targets] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' ').map(Number));
const getGCD = (num1, num2) => {
	while (num2 > 0) {
		let r = num1 % num2;
		num1 = num2;
		num2 = r;
	}
	return num1;
};

const leans = new Map();

targets.forEach((v) => {
	[x, y] = v;

	let lean;

	if (x == 0 && y > 0) {
		lean = '+0';
	} else if (x == 0 && y < 0) {
		lean = '-0';
	} else if (x < 0 && y == 0) {
		lean = '-Infinity';
	} else if (x > 0 && y == 0) {
		lean = 'Infinity';
	} else {
		const gcd = getGCD(Math.abs(x), Math.abs(y));
		lean = `${x / gcd}/${y / gcd}`;
	}

	if (leans.has(lean)) {
		const cnt = leans.get(lean);
		leans.set(lean, cnt + 1);
	} else {
		leans.set(lean, 1);
	}
});
const max = Math.max(...leans.values());
console.log(max);