남갯의 개발,일상블로그

최신 글

• 알고리즘 [백준] 1로만들기 https://www.acmicpc.net/problem/1463 fun main() = with(Scanner(System.`in`)) { val size = nextInt() val count = Array(size + 1) { 0 } count[0] = 0 count[1] = 1 if (size == 1) { return println(0) } count[2] = 1 if (size == 2) { return println(count[size]) } count[3] = 1 if (size == 3) { return println(count[size]) } for (i in 4 until cou..

• 알고리즘 [백준] 2xn 타일링 https://www.acmicpc.net/problem/11726 fun main() = with(Scanner(System.`in`)) { val size = nextInt() val count = Array(size + 1) { 0 } count[0] = 0 count[1] = 1 if(size == 1){ return println(count[size]) } count[2] = 2 for (i in 3 until count.size) { count[i] = (count[i - 2] + count[i - 1]) % 10007 } println(count[size])}

• 알고리즘 [백준] 2xn 타일링2 https://www.acmicpc.net/problem/11727 fun main() = with(Scanner(System.`in`)) { val size = nextInt() val count = Array(size + 1) { 0 } count[0] = 0 count[1] = 1 if(size == 1){ println(count[1]) return } count[2] = 3 for (i in 3 until count.size) { count[i] = (count[i - 2] * 2 + count[i - 1]) % 10007 ..

• 알고리즘 [백준] 차이를 최대로 https://www.acmicpc.net/problem/10819 fun main() = with(Scanner(System.`in`)) { val count = nextInt() val visited = Array(count) { false } val array = Array(count) { 0 } for (i in array.indices) { array[i] = nextInt() } var result = 0 fun dfs(depth: Int, total: Int , current : Int) { if (depth == count - 1) { result = max(result, total) re..

• 알고리즘 [백준] 1,2,3 더하기 https://www.acmicpc.net/problem/9095fun main() = with(Scanner(System.`in`)) { val number = nextInt() val array = Array(number) { 0 } for (i in array.indices) { array[i] = nextInt() } for (i in array) { var count = 0; fun dfs(total: Int) { if (total >= i) { if (total == i) { count++ } re..