HARD
Posts
4 postsMasterbrain
Code public class Masterbrain { String score(String g, String p) { int b = 0, w = 0; boolean[] ug = new boolean[4]; boolean[] up = new boolean[4]; for (int i = 0; i < 4; i++) { if (g.charAt(i)==p.charAt(i)) { b++; ug[i] = true; up[i] = true; } } for (int i = 0; i < 4; i++
BridgeCrossing
Code import java.util.Arrays; public class BridgeCrossing{ int n, min; boolean[] a; int[] times; void go(int t, int num) { for (int i = 0; i < n; i++) { if (!a[i]) continue; a[i] = false; for (int j = i+1; j < n; j++) { if (!a[j]) continue; a[j] = false; if (num==2 && t+time
HillHike
Code public class HillHike{ public long numPaths(int distance, int maxHeight, int[] _landmarks) { long[][][] cache1 = new long[2][52][51]; long[][][] cache2 = new long[2][52][51]; cache1[0][0][0] = 1; int[] landmarks = new int[_landmarks.length+1]; System.arraycopy(_landmarks,0,landmarks,0,_landmarks.length); landmarks[_landmarks.length] = -1;
PowerOutage
Code import java.util.LinkedList;import java.util.Queue; public class PowerOutage{ public int estimateTimeout(int[] fromJunction, int[] toJunction, int[] ductLength) { int n = fromJunction.length; int sum = 0; int len = 0; int[] dlSum = new int[50]; for (int i = 0; i < n; i++) sum += ductLength[i]; Queue q = new Link
![[웹툰단행본] 『통제구역관리부』 1권 후기 : 이상한 변칙과 기이한 일들이 일어나는 공간에 대하여](https://img.zoomtrend.com/2026/06/09/1780996474-SE-5eda86fa-0d63-4afd-b8dd-b801879fed52.jpg)


![[CV] [Comi] 'あかね噺'(아카네 이야기) 22권. 아카네의 첫 전력 승부](https://img.zoomtrend.com/2026/06/08/1780982081-EC9D8CEC9585EC9D98EBA6ACEB93ACEC9CBCEBA19C.jpg)