Skip to content

Commit c29c7b5

Browse files
committed
Fix: utf-8로 수정
1 parent 6ce80a0 commit c29c7b5

9 files changed

Lines changed: 9 additions & 9 deletions

File tree

baekjoon/23235.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// The Fastest Sorting Algorithm In The World : 구현
2-
const n = require("fs").readFileSync(0, "utf8").trim().split("\n").length - 1;
2+
const n = require("fs").readFileSync(0, "utf-8").trim().split("\n").length - 1;
33
const answer = [];
44

55
for (let i = 1; i <= n; i++) {

baekjoon/24309.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// РАВЕНСТВО : 수학
22
const [a, b, c] = require("fs")
3-
.readFileSync(0, "utf8")
3+
.readFileSync(0, "utf-8")
44
.trim()
55
.split("\n")
66
.map((v) => BigInt(v));

baekjoon/26545.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// Mathematics : 수학
22
console.log(
33
require("fs")
4-
.readFileSync(0, "utf8")
4+
.readFileSync(0, "utf-8")
55
.trim()
66
.split("\n")
77
.map(Number)

baekjoon/26574.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// Copier : 구현
2-
const input = require("fs").readFileSync(0, "utf8").trim().split("\n").map(Number).slice(1);
2+
const input = require("fs").readFileSync(0, "utf-8").trim().split("\n").map(Number).slice(1);
33
const answer = [];
44

55
for (const number of input) {

baekjoon/26766.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// Serca : 구현
2-
const n = +require("fs").readFileSync(0, "utf8").trim();
2+
const n = +require("fs").readFileSync(0, "utf-8").trim();
33
const string = ` @@@ @@@
44
@ @ @ @
55
@ @ @

baekjoon/27389.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
// Metronome : 수학
2-
const n = +require("fs").readFileSync(0, "utf8").trim();
2+
const n = +require("fs").readFileSync(0, "utf-8").trim();
33
console.log((n / 4).toFixed(2));

baekjoon/28701.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// 세제곱의 합 : 수학
2-
const n = +require("fs").readFileSync(0, "utf8").trim();
2+
const n = +require("fs").readFileSync(0, "utf-8").trim();
33
const sum = (n * (n + 1)) / 2;
44

55
console.log(sum);

baekjoon/8545.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
// Zadanie próbne : 구현
2-
const str = require("fs").readFileSync(0, "utf8").trim();
2+
const str = require("fs").readFileSync(0, "utf-8").trim();
33
console.log(str.split("").reverse().join(""));

baekjoon/8871.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
// Zadanie próbne 2 : 구현
2-
const n = +require("fs").readFileSync(0, "utf8").trim() + 1;
2+
const n = +require("fs").readFileSync(0, "utf-8").trim() + 1;
33
console.log(n * 2, n * 3);

0 commit comments

Comments
 (0)