20250511 baekjoon

code_study/Baekjoon/js/1330.js

@@ -0,0 +1,2 @@
+const n = require("fs").readFileSync("/dev/stdin").toString().split(" ").map(Number);
+console.log(n[0]>n[1]?">":n[0]<n[1]?"<":"==");

code_study/Baekjoon/js/14681.js

@@ -0,0 +1,2 @@
+const n = require("fs").readFileSync(0, 'utf-8').toString().split("\n");
+console.log([[3,2],[4,1]][+(n[0]>0)][+(n[1]>0)]);

code_study/Baekjoon/js/2480.js

@@ -0,0 +1,2 @@
+const [a,b,c] = require("fs").readFileSync(0,"utf-8").toString().split(" ").map(Number);
+console.log(a==b && b==c ? a*1000+10000 : a==b || a==c ? a*100+1000 : b==c ? b*100+1000 : Math.max(a,b,c)*100);

code_study/Baekjoon/js/2525.js

@@ -0,0 +1,5 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split("\n");
+const [h, m] = n[0].split(" ").map(Number);
+const d = parseInt(n[1]);
+const t = h*60 + m + d + 1440;
+console.log("%d %d",Math.floor(t/60)%24, t%60);

code_study/Baekjoon/js/2753.js

@@ -0,0 +1,2 @@
+const n = require("fs").readFileSync("/dev/stdin").toString();
+console.log(n%400==0||((n%4==0 && n%100!=0))?1:0);

code_study/Baekjoon/js/2884.js

@@ -0,0 +1,3 @@
+const n = require("fs").readFileSync(0, "utf-8").toString().split(" ").map(Number);
+const t = 60*n[0] + n[1] +1395;
+console.log("%d %d",Math.floor(t/60)%24,t%60);

code_study/Baekjoon/js/9498.js

@@ -0,0 +1,2 @@
+const n = require("fs").readFileSync("/dev/stdin").toString();
+console.log("FFFFFFDCBAA"[Math.floor(n/10)]);