20250513 baekjoon

code_study/Baekjoon/js/10950.js

@@ -0,0 +1,6 @@
+const n = require("fs").readFileSync(0,"utf-8").toString().split("\n");
+const t = parseInt(n[0]);
+for (let i = 1; i<=t; i++){
+    let [a,b] = n[i].split(" ").map(Number);
+    console.log(a+b);
+}

code_study/Baekjoon/js/10951.js

@@ -0,0 +1,5 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().trim().split("\n");
+for (let i=0; i<n.length; i++) {
+    let [a,b] = n[i].split(" ").map(Number);
+    console.log(a+b);
+}

code_study/Baekjoon/js/10952.js

@@ -0,0 +1,9 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+let flag = true;
+let i = 0;
+do{
+    let [a,b] = n[i].split(" ").map(Number);
+    if (a!=0 && b!=0) console.log(a+b);
+    else flag = false;
+    i++;
+}while(flag);

code_study/Baekjoon/js/11021.js

@@ -0,0 +1,5 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+for (let i=1; i<=n[0]; i++) {
+    let [a, b] = n[i].split(" ").map(Number);
+    console.log(`Case #${i}: ${a+b}`);
+}

code_study/Baekjoon/js/11022.js

@@ -0,0 +1,5 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+for (let i=1; i<=n[0]; i++) {
+    let [a, b] = n[i].split(" ").map(Number);
+    console.log(`Case #${i}: ${a} + ${b} = ${a+b}`);
+}

code_study/Baekjoon/js/15552.js

@@ -0,0 +1,7 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+let ans = "";
+for (let i=1; i<=n[0]; i++) {
+    let [a, b] = n[i].split(" ").map(Number);
+    ans += a + b + "\n";
+}
+console.log(ans);

code_study/Baekjoon/js/2438.js

@@ -0,0 +1,7 @@
+const n = Number(require("fs").readFileSync(0, "utf-8").toString());
+let ans = "";
+for (let i=0; i<n; i++) {
+    for (let j=0; j<=i; j++) ans += "*";
+    ans+= "\n";
+}
+console.log(ans);

code_study/Baekjoon/js/2439.js

@@ -0,0 +1,8 @@
+const n = Number(require("fs").readFileSync(0, "utf-8").toString());
+let ans = "";
+for (let i=0; i<n; i++) {
+    for (let j=0; j<n-i-1; j++) ans += " ";
+    for (let k=0; k<=i; k++) ans += "*";
+    if(i!=n-1) ans+= "\n";
+}
+console.log(ans);

code_study/Baekjoon/js/25304.js

@@ -0,0 +1,9 @@
+const t = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+const x = parseInt(t[0]);
+const n = parseInt(t[1]);
+let sum = 0;
+for (let i = 2; i<n+2; i++) {
+    let [a, b] = t[i].split(" ").map(Number);
+    sum += a*b;
+}
+console.log(x==sum ? "Yes" : "No");

code_study/Baekjoon/js/25314.js

@@ -0,0 +1,2 @@
+const n = Number(require("fs").readFileSync(0,"utf-8").toString());
+console.log("long ".repeat(n/4)+"int");

code_study/Baekjoon/js/2739.js

@@ -0,0 +1,2 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().trim();
+for(let i=1; i<10; i++) console.log(`${n} * ${i} = ${n*i}`);

code_study/Baekjoon/js/8393.js

@@ -0,0 +1,2 @@
+const n = Number(require("fs").readFileSync(0, "utf-8").toString());
+console.log(n*(n+1)/2);