Merge pull request #592 from eric-hjh/main

[황장현] 83차 라이브 코테 제출

Author: eric-hjh

live8/test82/문제2/황장현.js

@@ -10,24 +10,53 @@ const input = fs
 function solution(input) {
   const [N, M] = input[0];
   const relation = input.slice(1);
-  const graph = Array.from({ length: N + 1 }).map((_) =>
-    Array.from({ length: 0 })
-  );
+  const graph = Array.from({ length: N + 1 }, () => []);
 
   for (const [f1, f2] of relation) {
     graph[f1].push(f2);
     graph[f2].push(f1);
   }
 
-  function dfs(start, target) {}
+  function bfs(start, target) {
+    const queue = [[start, 0]];
+    const visited = Array(N + 1).fill(false);
+    visited[start] = true;
+
+    while (queue.length > 0) {
+      const [current, depth] = queue.shift();
+
+      if (current === target) return depth;
+
+      for (let nearNode of graph[current]) {
+        if (!visited[nearNode]) {
+          visited[nearNode] = true;
+          queue.push([nearNode, depth + 1]);
+        }
+      }
+    }
+    return Infinity;
+  }
+
+  let minKevinBacon = Infinity;
+  let minUser = -1;
 
   for (let i = 1; i <= N; i++) {
-    const temp = [];
+    let kevinBacon = 0;
     for (let j = 1; j <= N; j++) {
-      if (graph[i].includes(j)) temp.push(1);
-      else dfs(i, j);
+      if (i !== j) {
+        kevinBacon += bfs(i, j);
+      }
+    }
+
+    if (kevinBacon < minKevinBacon) {
+      minKevinBacon = kevinBacon;
+      minUser = i;
+    } else if (kevinBacon === minKevinBacon) {
+      minUser = Math.min(minUser, i);
     }
   }
+
+  console.log(minUser);
 }
 
-console.log(solution(input));
+solution(input);

live8/test83/문제1/황장현.js

@@ -0,0 +1,36 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+function binarySearch(arr, target) {
+  let start = 0;
+  let end = arr.length - 1;
+
+  while (start <= end) {
+    let mid = Math.floor((start + end) / 2);
+
+    if (arr[mid] === target) return 1;
+    if (arr[mid] < target) start = mid + 1;
+    else end = mid - 1;
+  }
+
+  return 0;
+}
+
+function solution(input) {
+  const N = input[0][0];
+  const cards = input[1];
+  const M = input[2][0];
+  const sangenCards = input[3];
+
+  cards.sort((a, b) => a - b);
+
+  const result = sangenCards.map((sangen) => binarySearch(cards, sangen));
+
+  return result.join(' ');
+}
+
+console.log(solution(input));

live8/test83/문제2/황장현.js

@@ -0,0 +1,49 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+const LIMIT = 1299709;
+const isPrime = Array(LIMIT + 1).fill(true);
+isPrime[0] = isPrime[1] = false;
+const primes = [];
+
+for (let i = 2; i <= LIMIT; i++) {
+  if (isPrime[i]) {
+    primes.push(i);
+    for (let j = i * 2; j <= LIMIT; j += i) {
+      isPrime[j] = false;
+    }
+  }
+}
+
+function solution(input) {
+  const T = input[0];
+  const list = input.slice(1);
+  const result = [];
+
+  for (let numb of list) {
+    if (isPrime[numb]) {
+      result.push(0);
+      continue;
+    }
+
+    let left = 0,
+      right = primes.length - 1;
+    while (left < right) {
+      let mid = Math.floor((left + right) / 2);
+      if (primes[mid] >= numb) right = mid;
+      else left = mid + 1;
+    }
+
+    let prevPrime = primes[left - 1];
+    let nextPrime = primes[left];
+
+    result.push(nextPrime - prevPrime);
+  }
+  return result.join('\n');
+}
+
+console.log(solution(input));