코드트리
[코트드리/Java] 최적의 십자 모양 폭발
풀이🛫 import java.util.Scanner; public class Main { public static final int DIR_NUM = 4; public static final int MAX_N = 50; public static final int[] dx = new int[]{-1,0,1,0}; public static final int[] dy = new int[]{0,1,0,-1}; public static int n, ans; public static int[][] orgGrid = new int[MAX_N][MAX_N]; public static int[][] grid = new int[MAX_N][MAX_N]; public static int[][] temp = new int[M..
[코드트리/Java] 금 채굴하기
풀이🛫 import java.util.Scanner; public class Main { public static final int MAX_N = 20; public static final int MAX_M = 10; public static int n, m; public static int[][] grid = new int[MAX_N][MAX_N]; // 채굴에 들어가는 비용 public static int getArea(int k) { return k*k + (k+1)*(k+1); } // 주어진 k에 대해 채굴 가능한 금의 개수 public static int getNumOfGold(int x, int y, int k) { int numOfGold = 0; for (int i=0; i