Merge pull request #679 from jinoo0306/main

[조진우] 103차 라이브 코테 제출

Author: github-actions[bot]

live10/test103/문제1/조진우.js

@@ -0,0 +1,24 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.split(" ").map(Number));
+
+function solution(input) {
+  const N = input[0][0];
+  const G = input.slice(1);
+
+  for (let k = 0; k < N; k++)
+    for (let i = 0; i < N; i++)
+      for (let j = 0; j < N; j++) if (G[i][k] && G[k][j]) G[i][j] = 1;
+
+  return G.map((row) => row.join(" ")).join("\n");
+}
+
+console.log(solution(input));

live10/test103/문제2/조진우.js

@@ -0,0 +1,28 @@
+const fs = require("fs");
+const path = require("path");
+
+const filePath =
+  process.platform === "linux"
+    ? "/dev/stdin"
+    : path.join(__dirname, "input.txt");
+
+const input = fs.readFileSync(filePath, "utf8").toString().trim();
+
+function solution(input) {
+  const sugar = input;
+  let [bag3, bag5] = [0, 0];
+  bag5 = Math.floor(sugar / 5);
+  bag3 = (sugar - bag5 * 5) / 3;
+
+  while (bag5 >= 0) {
+    if (bag3 === Math.floor(bag3)) return bag5 + bag3;
+
+    if (bag3 % 3 !== 0) {
+      --bag5;
+      bag3 = (sugar - bag5 * 5) / 3;
+    }
+  }
+  return -1;
+}
+
+console.log(solution(input));

live10/test103/문제3/조진우.js

@@ -0,0 +1,15 @@
+function solution(n) {
+  const dp = [];
+  dp[0] = 0;
+  dp[1] = 1;
+  dp[2] = 2;
+  // dp[3] = 3;
+  // dp[4] = 5;
+  // dp[5] = 8;
+  // dp[6] = 13;
+  for (let i = 3; i <= n; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
+
+  return dp[n];
+}
+
+console.log(solution(6));