Melody Coding

[Baekjoon] 29634_Hotel

문제(출처: https://www.acmicpc.net/problem/29634) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _29634_ { // Hotel static boolean arr[][]; static int dx[] = { -1, 1, 0, 0 }; static int dy[] = { 0, 0, -1, 1 }; public..

[Baekjoon] 14546_Prison Break

문제(출처: https://www.acmicpc.net/problem/14546) 문제 풀이  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 _14546_ { // Prison Break static int dx[] = { -1, 1, 0,..

[Baekjoon] 26999_Satellite Photographs

문제(출처: https://www.acmicpc.net/problem/26999) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _26999_ { // Satellite Photographs static boolean arr[][]; static int dx[] = { -1, 1, 0, 0 }; static int dy[] = { 0, 0,..

문제(출처: https://www.acmicpc.net/problem/6229) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _6229_ { // Bronze Lilypad Pond static boolean arr[][]; public static void main(String[] args) throws IOException { Buf..

문제(출처: https://www.acmicpc.net/problem/6080) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _6080_ { // Bad Grass static boolean arr[][]; static int dx[] = { -1, 1, 0, 0, -1, -1, 1, 1 }; static int dy[] = { 0, 0,..

문제(출처: https://www.acmicpc.net/problem/11448) 문제 풀이  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;public class _11448_ { // Ga static int dx[] = { -1, 1, 0, 0, -1, -1, 1, 1 }; static int dy[] = { 0, ..

문제(출처: https://www.acmicpc.net/problem/6189) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _6189_ { // Munching static int R, C; static boolean arr[][]; static int dx[] = { -1, 1, 0, 0 }; static int dy[] = { 0, ..

문제(출처: https://www.acmicpc.net/problem/15240) 문제 풀이  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 _15240_ { // Paint bucket public static void main(Strin..

문제(출처: https://www.acmicpc.net/problem/4993) 문제 풀이  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 _4993_ { // Red and Black static boolean arr[][]; static..

문제(출처: https://www.acmicpc.net/problem/6031) 문제 풀이  bfs를 사용하여 문제를 해결한다.  my solution (Java)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class _6031_ { // Feeding Time static boolean arr[][]; static int result; static int dx[] = { -1, 1, 0, 0, -1, -1, 1, 1 }; sta..