소프티어

JS

const fs = require('fs'); let input = fs.readFileSync('input.txt', 'utf8').trim().split('\n').slice(1).map(line => line.split(' ')); const output = [] input.map(list => { const xIndex = list[0].search(/x/i); output.push(list[1][xIndex].toUpperCase()) }) console.log(output.join(''))

JS

const fs = require('fs'); let input = fs.readFileSync('input.txt', 'utf8').trim().split('\n')[1].split(' ').map(Number); const array = Array(101).fill(0) input.forEach(v => {     for (let i = 1; i <= Math.sqrt(v); i++) {         if (v % i === 0) {             array[i]++             if (i !== Math.sqrt(v)) {                 array[v/i]++;             }         }     } }) array[1] = 0 console.log(Math.max(...array));

JS

const fs = require('fs'); let input = fs.readFileSync('input.txt', 'utf8').trim().split('\n').map(line => line.split(' ').map(Number)); let result = 10 for (let i = 0; i < 3; i++) {     for (let j = 1; j <= 3; j++) {         const min1 = Math.abs(input[i][0] - j) + Math.abs(input[i][1] - j) + Math.abs(input[i][2] - j)         const min2 = Math.abs(input[0][i] - j) + Math.abs(input[1][i] - j) + Math.abs(input[2][i] - j)         result = Math.min(result, min1, min2);     } ...

JS

const fs = require('fs'); let [bagInfo, ...jewelInfos] = fs.readFileSync('input.txt', 'utf8').trim().split('\n'); jewelInfos = jewelInfos.map(jewelInfo => jewelInfo.split(' ').map(Number)).sort((a, b) => b[1] - a[1]); let weight = bagInfo.split(' ')[0] let result = 0 let jewelIndex = 0; while (weight > 0) { if (weight >= jewelInfos[jewelIndex][0]) { weight -= jewelInfos[jewelIndex][0] result += jewelInfos[jewelIndex][0] * jewelInfos[jewelIndex][1] ...

JS

BigInt 필수 const fs = require('fs'); let [size, base, exponential] = fs.readFileSync('input.txt', 'utf8').trim().split(' ').map(BigInt); const mod = 1000000007n;  // BigInt로 변환 let stack = 1n; let result = 1n; while (exponential > 0n) {  // BigInt에서 0도 0n으로 표기     if (stack === 1n) {         stack = base % mod;     } else {         stack = (stack * stack) % mod;     }     if ((exponential & 1n) === 1n) result = (result * stack) % mod;     exponential >>= 1n;  // BigInt에...

JS

const fs = require('fs'); const input = fs.readFileSync('input.txt', 'utf8').trim().split(' ').map(Number); const origin = input.join('') const ascending = input.sort((a, b) => a - b).join('') const descending = input.reverse().join('') console.log(origin === ascending ? 'ascending' : origin === descending ? 'descending' : 'mixed');

JS

const fs = require('fs'); const [range, ...input] = fs.readFileSync('input.txt', 'utf8').trim().split('\n'); let box = input.map(v => v.split('').map(Number)); let nextGroup = 2; const count = [0,0]; function DFS(x, y) {     box[x][y] = nextGroup;     count[nextGroup]++;     if (box[x - 1] && box[x - 1][y] === 1) DFS(x - 1, y);     if (box[x + 1] && box[x + 1][y] === 1) DFS(x + 1, y);     if (box[x] && box[x][y + 1] === 1) DFS(x, y + 1);     if (box[x] && box[x][y -...

JS

const fs = require('fs'); const dotX = Array(+fs.readFileSync('input.txt', 'utf8').trim()).fill(0).reduce((a, b) => a + a - 1, 2) console.log(dotX ** 2);

JS 코드는 없길래...

const fs = require('fs'); const [NM, ...input] = fs.readFileSync(0, 'utf8').trim().split('\n'); const [N, M] = NM.split(' ').map(Number); const sectionsA = input.slice(0, N).map(v => v.split(' ').map(Number)); const sectionsB = input.slice(N).map(v => v.split(' ').map(Number)); let max = 0; let [Aindex, Bindex] = [0, 0]; while (sectionsA[Aindex] !== undefined && sectionsB[Bindex] !== undefined) { const minRange = Math.min(sectionsA[Aindex][0], sectionsB[Bindex][0]); c...