[백준 node.js] 3단계 for

2739번 구구단

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
let input = fs.readFileSync(filePath).toString().split("\n");

solution(input[0]);

function solution(num) {
	for (let i = 1; i < 10; i++) {
		console.log(`${num} * ${i} = ${num*i}`);
        // console.log(num + ' * '+ i+ ' = ' +num*i )
	}
}
;

10950번 A+B-3

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
let input = fs.readFileSync(filePath).toString().split("\n");


let num = +input[0];

let numbers = [];

for(let i= 1; i<=num; i++){
    numbers.push(input[i].split(' ').map(item=>+item))
}

solution(num, numbers);

function solution(num,numbers){

    for(let i=0; i<num; i++){
        console.log(numbers[i][0]+numbers[i][1]);
    }
};

2438번 별찍기 - 1

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
let input = fs.readFileSync(filePath).toString().split("\n");

solution(+input[0]);

function solution(num) {
	for (let line = 1; line <= num; line++) {
        let star="";
        for(let i =0; i<line; i++){
            star=star+"*";
        }
        console.log(star);
}
}

2438번 별찍기 - 2

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
let input = fs.readFileSync(filePath).toString().split("\n");

solution(+input[0]);

function solution(num) {
for (let line = 1; line <= num; line++) {

	let space = "";
    	let star = "";

	for (let i = 0; i < line; i++) {
    	star = star + "*";
		}
       	for (let i = 0; i < num - line; i++) {
        space = space + " ";
        	}
            console.log(space+star);
	}
}

10871번 X보다 작은 수

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
let input = fs.readFileSync(filePath).toString().split("\n");

let number = input[0].split(' ').map((item) => +item);

let numbers = input[1].split(" ").map((item) => +item);

solution(number, numbers);
function solution(number, numbers) {
	let N = number[0];
	let X = number[1];
    let result = '';
	for (let i = 0; i < N; i++) {
		if (numbers[i] < X) {
            result= result + numbers[i]+ ' ';
		}
	}
    console.log(result);
}