2021-07-23 게시 됨2026-04-09 업데이트 됨Algorithm / BOJ0회 방문[BOJ] 15649번 : N과 M문제 보기소스 kotlin12345678910111213141516171819202122232425262728293031import java.util.*var n = 0var m = 0val arr = IntArray(10)val isUsed = BooleanArray(10)fun main() = with(Scanner(System.`in`)) { n = nextInt() m = nextInt() backTrack(0)}fun backTrack(k : Int) { if (k == m) { for (i in 0 until m) { print("${arr[i]} ") } println() return } for (i in 1 .. n) { if (isUsed[i].not()) { arr[k] = i isUsed[i] = true backTrack(k+1) isUsed[i] = false } }} #KotlinAlgorithmBOJ백트래킹 [BOJ] 15649번 : N과 Mhttps://june0122.github.io/2021/07/23/boj-15649/AuthorKAMIYUPosted on2021-07-23Updated on2026-04-09Licensed under#KotlinAlgorithmBOJ백트래킹