Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 35 additions & 0 deletions live8/test89/문제1/황장현.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
const input = require('fs')
.readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
.toString()
.trim()
.split('\n')
.map((el) => el.split(' ').map(Number));

function solution(input) {
const N = input[0][0];
const elemets = input
.slice(1)
.flat()
.sort((a, b) => a - b);

let answer = 4;

for (let i = 0; i < N; i++) {
let start = i;
let end = N - 1;

while (start < end) {
if (elemets[end] - elemets[start] > 4) {
end--;
} else {
const temp = 4 - (end - start);
answer = Math.min(answer, temp);
break;
}
}
}

return answer;
}

console.log(solution(input));
33 changes: 33 additions & 0 deletions live8/test89/문제2/황장현.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
const input = require('fs')
.readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
.toString()
.trim()
.split('\n')
.map((el) => el.split(' ').map(Number));

function solution(input) {
const [N, M] = input[0];
const A = input[1];

let answer = 0;
for (let i = 0; i < N; i++) {
let p1 = i;
let sum = 0;

while (p1 < N) {
sum += A[p1];

if (sum === M) {
answer++;
break;
}
if (sum > M) {
break;
}
p1++;
}
}
return answer;
}

console.log(solution(input));
14 changes: 14 additions & 0 deletions live8/test89/문제3/황장현.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
function compare(a, b) {
if (b.toString()[0] !== a.toString()[0])
return b.toString()[0] - a.toString()[0];
else {
}
}

function solution(numbers) {
numbers.sort((a, b) => compare(a, b));
console.log(numbers);
}

console.log(solution([6, 10, 2, 11]));
// console.log(solution([3, 30, 34, 5, 9]));