[2739번] 구구단
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
const readline = require('readline');
const rl = readline.createInterface({
input: process.stdin,
});
rl.on('line', (num) => {
for (let x = 1; x <= 9; x++) {
console.log(`${num} * ${x} = ${num * x}`);
}
rl.close();
}).on('close', () => {
process.exit();
});
|
cs |
[10950번] A+B-3
1
2
3
4
5
6
7
|
let input = require('fs').readFileSync('/dev/stdin').toString().split('\n');
for (let x = 1; x <= input[0]; x++) {
let numbers = input[x].split(' ');
console.log(Number(numbers[0]) + Number(numbers[1]));
}
|
cs |
[8393번] 합
1
2
3
4
5
6
7
8
9
|
const input=require('fs').readFileSync('/dev/stdin').toString().split('\n')
const num = Number(input[0])
let sum = 0;
for(let x=1; x<=num; sum+=x++) {
}
console.log(sum)
|
cs |
[15552번] 빠른 A+B
1
2
3
4
5
6
7
8
9
10
11
|
let input = require('fs').readFileSync('/dev/stdin').toString().split('\n');
let max = Number(input[0]);
let answer = '';
for (let x = 1; x <= max; x++) {
let num = input[x].split(' ');
answer += Number(num[0]) + Number(num[1]) + "\n";
}
console.log(answer);
|
cs |
[2741번] N 찍기
1
2
3
4
5
6
7
8
9
|
let input = Number(require('fs').readFileSync('/dev/stdin').toString());
let answer = '';
for (let x = 1; x <= input; x++) {
answer += x + "\n";
}
console.log(answer);
|
cs |
[2742번] 기찍 N
1
2
3
4
5
6
|
let input = Number(require('fs').readFileSync('/dev/stdin').toString());
let answer = '';
for (let x = input; x >= 1; x--) {
answer += x + "\n";
}
console.log(answer);
|
cs |
[11021번] A+B-7
1
2
3
4
5
6
7
|
let input = require('fs').readFileSync('/dev/stdin').toString().split('\n');
for (let x = 1; x <= input[0]; x++) {
let numbers = input[x].split(' ');
console.log(`Case #${x}: ${Number(numbers[0]) + Number(numbers[1])}`);
}
|
cs |
[11022번] A+B-8
1
2
3
4
5
6
7
8
9
10
|
let input = require('fs').readFileSync('/dev/stdin').toString().split('\n');
for (let x = 1; x <= input[0]; x++) {
let numbers = input[x].split(' ');
let num1 = Number(numbers[0]);
let num2 = Number(numbers[1]);
console.log(`Case #${x}: ${num1} + ${num2} = ${num1 + num2}`);
}
|
cs |
[2438번] 별 찍기 -1
1
2
3
4
5
6
7
8
|
let input = require('fs').readFileSync('/dev/stdin').toString();
let stars = "";
for (let x = 0; x < input; x++) {
stars += "*"
console.log(stars);
}
|
cs |
[2439번] 별 찍기 -2
1
2
3
4
5
6
7
8
9
10
11
12
13
|
let input = require('fs').readFileSync('/dev/stdin').toString();
let num = Number(input);
for (let x = 0; x < num; x++) {
let stars = '';
for (let y = num - 1; y >= 0; y--) {
stars += y <= x ? '*' : ' ';
}
console.log(stars);
}
|
cs |
[10871번] x보다 작은 수
1
2
3
4
5
6
7
8
9
10
11
12
13
|
let input = require('fs').readFileSync('/dev/stdin').toString().split('\n');
let totalNum = input[0].split(' ').map(x => Number(x));
let arr = input[1].split(' ').map(x => Number(x));
let result = [];
for (let x = 0; x <= totalNum[0]; x++) {
if (totalNum[1] > arr[x]) {
result.push(arr[x]);
}
}
console.log(result.join(' '));
|
cs |

'백준' 카테고리의 다른 글
7/6[문제풀이] 백준 단계2 / if문 (0) | 2021.07.06 |
---|---|
7/5[문제풀이] 백준 단계1 / 입출력과 사칙연산 (0) | 2021.07.05 |