[백준_javascript] 반복문(25314, 15552, 11021)

#25314 (코딩은 체육과목 입니다)

solution1.

const fs = require("fs");
const file = process.platform === "linux" ? "/dev/stdin" : __dirname + "/input.txt";

const input = fs.readFileSync(file).toString().trim();

let num = parseInt(input) / 4;
let result = "";
for (let i = 0; i < num; i++) {
  result += "long ";
}
console.log(`${result}int`);

 

solution2_repeat함수 활용.

const fs = require("fs");
const file = process.platform === "linux" ? "/dev/stdin" : __dirname + "/input.txt";

const input = fs.readFileSync(file).toString().trim();

let num = parseInt(input);
console.log("long ".repeat(num / 4) + "int");

 

#15552 (빠른 A+B)

 

시간초과

const fs = require("fs");
const file = process.platform === "linux" ? "/dev/stdin" : __dirname + "/input.txt";

const input = fs.readFileSync(file).toString().trim().split("\n");

let cnt = parseInt(input[0]);
for (let i = 1; i <= cnt; i++) {
  let [a, b] = input[i].split(" ").map(Number);
  console.log(a + b);
}

 ► console.log를 호출하는 횟수가 늘어날 수록 프로그램 실행 시간이 급격하게 늘어난다.

 

 

solution.

const fs = require("fs");
const file = process.platform === "linux" ? "/dev/stdin" : __dirname + "/input.txt";

const input = fs.readFileSync(file).toString().trim().split("\n");

let cnt = parseInt(input[0]);
let result = "";
for (let i = 1; i <= cnt; i++) {
  let [a, b] = input[i].split(" ").map(Number);
  result += a + b + "\n";
}

console.log(result);

 

#11021 (A+B-7)

const fs = require("fs");
const file = process.platform === "linux" ? "/dev/stdin" : __dirname + "/input.txt";

const input = fs.readFileSync(file).toString().trim().split("\n");

let cnt = parseInt(input[0]);
let result = "";
for (let i = 1; i <= cnt; i++) {
  let [a, b] = input[i].split(" ").map(Number);
  result += `Case #${i}: ${a + b}\n`;
}

console.log(result);

 

 

#11021 (A+B-7)

solution1_fs.

const fs = require('fs');
const file = process.platform == 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const input = fs.readFileSync(file).toString().trim().split('\n');

let num = parseInt(input[0]);
for(let i=1; i<=num; i++) {
    let [a,b] = input[i].split(' ').map(Number);
    console.log(`Case #${i}: ${a} + ${b} = ${a+b}`);
}

 

solution2_readline.

const readline = require('readline');

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout
});

const input = [];

rl.on('line', function(line) {
    input.push(line.split(' ').map(Number));
}).on('close', function() {
    let num = parseInt(input[0]);
    let cases = '';
    for(let i=1; i<=num; i++) {
        let a = input[i][0];
        let b = input[i][1];
        cases += `Case #${i}: ${a} + ${b} = ${a+b}\n`;
    }

    console.log(cases);

    process.exit();
})

 

 

### 참고한 블로그

https://dygreen.tistory.com/entry/알고리즘-백준-25314번-JavaScriptNodejs-풀기

[알고리즘] 백준 25314번 : JavaScript(Node.js) 풀기

https://mule-heo.tistory.com/242

[node.js] 백준 문제풀이 시간초과(console.log)

https://jb-dailylife.tistory.com/entry/%EB%B0%B1%EC%A4%80-nodejs-11022%EB%B2%88-AB-8

[백준 / node.js] 11022번: A+B - 8