Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions 수요일/MyungHwan/Week05/1.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
function solution(s) {
if (s.length !== 4 && s.length !== 6)
return false;
for (let i = 0; i < s.length; i++) {
if (isNaN(Number(s[i]))) return false;
}
return true;
}
7 changes: 7 additions & 0 deletions 수요일/MyungHwan/Week05/2.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
function solution(left, right) {
let answer = 0;

for(let i = left; i <= right; i++){
Math.sqrt(i) % 1 === 0 ? answer += i : answer -= i;
} return -answer
}
8 changes: 8 additions & 0 deletions 수요일/MyungHwan/Week05/3.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
function solution(price, money, count) {
let total = 0;

for(let i = 0; i <= count; i++){
total += price * i
}
return total > money ? total - money : 0;
}
10 changes: 10 additions & 0 deletions 수요일/MyungHwan/Week05/4.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function solution(arr1, arr2) {
let answer = [];
for(let i = 0; i < arr1.length; i++){
answer[i] = [];
for(let j = 0; j < arr1[i].length; j++){
answer[i].push(arr1[i][j] + arr2[i][j])
}
}
return answer;
}
9 changes: 9 additions & 0 deletions 수요일/MyungHwan/Week05/5.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
process.stdin.setEncoding('utf8');
process.stdin.on('data', data => {
const n = data.split(" ");
const a = Number(n[0]), b = Number(n[1]);
// console.log(a);
// console.log(b);
const answer = ('*'.repeat(a)+`\n`).repeat(b)
console.log(answer)
});
10 changes: 10 additions & 0 deletions 수요일/MyungHwan/Week05/6.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
function solution(n, m) {
let answer = [];

const gcd = (n, m) => {
if( m === 0) return n
return gcd(m, n % m)
}
const lcm = (n, m) => n * m / gcd(n,m)
return [gcd(n,m), lcm(n,m)]
}