λ³Έλ¬Έ λ°”λ‘œκ°€κΈ°
κ°œμΈκ³΅λΆ€/Algorithm

[λ°±μ€€][Node.js] 2525번 : 였븐 μ‹œκ³„

by πŸ‡λ°•λ΄‰λ΄‰πŸ‡ 2021. 8. 24.

 

 

Algorithm

-  였븐 μ‹œκ³„ -

 


 

문제

KOI μ „μžμ—μ„œλŠ” 건강에 μ’‹κ³  λ§›μžˆλŠ” ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄ μš”λ¦¬λ₯Ό κ°„νŽΈν•˜κ²Œ λ§Œλ“œλŠ” 인곡지λŠ₯ μ˜€λΈμ„ κ°œλ°œν•˜λ €κ³  ν•œλ‹€. 인곡지λŠ₯ μ˜€λΈμ„ μ‚¬μš©ν•˜λŠ” 방법은 μ λ‹Ήν•œ μ–‘μ˜ 였리 ν›ˆμ œ 재료λ₯Ό 인곡지λŠ₯ μ˜€λΈμ— λ„£μœΌλ©΄ λœλ‹€. 그러면 인곡지λŠ₯ μ˜€λΈμ€ μ˜€λΈκ΅¬μ΄κ°€ λλ‚˜λŠ” μ‹œκ°„μ„ λΆ„ λ‹¨μœ„λ‘œ μžλ™μ μœΌλ‘œ κ³„μ‚°ν•œλ‹€.

λ˜ν•œ, KOI μ „μžμ˜ 인곡지λŠ₯ 였븐 μ•žλ©΄μ—λŠ” μ‚¬μš©μžμ—κ²Œ ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄ μš”λ¦¬κ°€ λλ‚˜λŠ” μ‹œκ°μ„ μ•Œλ € μ£ΌλŠ” 디지털 μ‹œκ³„κ°€ μžˆλ‹€. 

ν›ˆμ œμ˜€λ¦¬κ΅¬μ΄λ₯Ό μ‹œμž‘ν•˜λŠ” μ‹œκ°κ³Ό 였븐ꡬ이λ₯Ό ν•˜λŠ” 데 ν•„μš”ν•œ μ‹œκ°„μ΄ λΆ„λ‹¨μœ„λ‘œ μ£Όμ–΄μ‘Œμ„ λ•Œ, μ˜€λΈκ΅¬μ΄κ°€ λλ‚˜λŠ” μ‹œκ°μ„ κ³„μ‚°ν•˜λŠ” ν”„λ‘œκ·Έλž¨μ„ μž‘μ„±ν•˜μ‹œμ˜€.

 

μž…μΆœλ ₯ μ˜ˆμ‹œ

 

문제 ν’€κΈ°

let fs = require("fs");
let input = fs.readFileSync("/dev/stdin")
	.toString()
	.trim()
	.split("\n")
	.map((el) => el.split(' ').map(el => Number(el)));
let time = input[0];
let addTime = input[1][0];

time[1] = time[1] + addTime;
if (time[1] >= 60) {
	time[0] = time[0] + Math.floor(time[1] / 60);
	time[1] = time[1] % 60;
	if (time[0] >= 24) time[0] = time[0] - 24;
}

console.log(time.join(" "));

 

 

 

λ°˜μ‘ν˜•

λŒ“κΈ€