문제(출처: https://www.acmicpc.net/problem/6601) 문제 풀이 bfs 알고리즘을 활용한다. my solution (Java)import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _6601_ { // Knight Moves static int dx[] = { -1, -2, -2, -1,..
