Portfolio

문제

코테 페이지에서 확인하기! 화요일이니까 답지가 있어서 거기서 확인할게요!

풀이

효성


const readline = require('readline');

(async () => {
	let rl = readline.createInterface({ input: process.stdin });

	const inputs = [];

	rl.on('line', (line) => inputs.push(line.trim().split(' '))).on(
		'close',
		() => {
			main(inputs);

			process.exit();
		}
	);
})();

function main(data) {
	const [N, M] = data.shift();
	const n = Number(N);
	const m = Number(M);
	const dir = [
		[-1, 0],
		[0, 1],
		[1, 0],
		[0, -1],
	];
	let answer = 0;

	const dfs = (x, y, depth, isVisited) => {
		if(depth >= m) {
			return;
		}
		for(let k = 0; k < dir.length; k++) {
			const [nx, ny] = dir[k];
			if(x + nx >= 0 && x + nx < n && y + ny >= 0 && y + ny < n) {
				if(isVisited[x + nx][y + ny]) {
					return;
				}
				if(data[x + nx][y + ny] == 2) {
					answer += 1;
					return;
				}
				isVisited[x + nx][y + ny] = true;
				dfs(x + nx, y + ny, depth + 1, isVisited);
			} 
		}
	}

	for(let i = 0; i < n; i++) {
		for(let j = 0; j < n; j++) {
			if(data[i][j] == 1) {
				let isVisitedArr = Array.from(Array(n), () => Array(n).fill(false));
				isVisitedArr[i][j] = true;
				dfs(i, j, 0, isVisitedArr);
			}
		}
	}

	console.log(answer);
}

재영

1번


// Run by Node.js
const readline = require('readline');

(async () => {
	let rl = readline.createInterface({ input: process.stdin });
	
	const inputs = [];
	
	rl.on('line', (line) => inputs.push(line)).on('close', () => {
		main(inputs);
	process.exit();
	})
})();

function main(p) {
	for (let s of p) {
		const sArr = [...s]
		let total = sArr.filter((v, idx) => !(idx % 2)).reduce((acc, cur) => acc + +cur, 0);
		const res = sArr.filter((v, idx) => (idx % 2) && +v).reduce((acc, cur) => (acc * cur) % 10, total);
		
		console.log(res % 10)
	}
}

2번


// Run by Node.js
const readline = require('readline');

(async () => {
  let rl = readline.createInterface({ input: process.stdin });

  const inputs = [];
  rl.on('line', (line) => inputs.push(line)).on('close', () => {
    main(inputs);
    process.exit();
  });
})();

function main(p) {	
	const N = p[0];
	const S = p[1];
	
	const alphabets = 'abcdefghijklmnopqrstuvwxyz';

	console.log(S.replace(/[a-z0-9]{2,2}/g, ([alphabet, num]) => alphabets[((num ** 2 + alphabets.indexOf(alphabet)) % 26)]))
}

구름 코테 5주차

문제

풀이