[알고리즘 문제] attackRange
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt() - 1; // 행렬 크기 int y = sc.nextInt() - 1; // 행크기 int x = sc.nextInt() - 1; // 열 크기 int length = sc.nextInt(); // 범위 int ax, bx, cx, dx; int ay, by, cy, dy; int aax, bbx, ccx, ddx; int aay, bby, ccy, ddy; int count = 1; int[][] ary = new int[n + 1][n + 1];..
2019. 4. 8.