Posts
2 postsBridgeCrossing
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;
![[굿즈] 웹툰 『악역의 엔딩은 죽음뿐』 트럼프 카드 : 아는 장면이라도 플레잉 카드로 수집하는 이 맛](https://img.zoomtrend.com/2026/06/05/1780650880-SE-1c22cf84-12af-4fb2-95c5-c6354bd47dfd.jpg)
