Traveling Programmer

문제https://www.acmicpc.net/problem/1706풀이(19분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine()); int r = Integer.parseInt(st.nextToken()); int c = Integer.parseI..

문제https://www.acmicpc.net/problem/5212풀이(14분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine()); int r = Integer.parseInt(st.nextToken()); int c = Integer.parseI..

문제https://www.acmicpc.net/problem/2961풀이(32분)import java.io.*;import java.util.*;public class Main { static Queue queue = new LinkedList(); static int n; static int[][] arr; static int answer = Integer.MAX_VALUE; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; ..

문제https://www.acmicpc.net/problem/4485풀이(20분)import java.io.*;import java.util.*;class Node implements Comparable{ int x, y, weight; public Node(int x, int y, int weight){ this.x = x; this.y = y; this.weight = weight; } @Override public int compareTo(Node o) { return weight - o.weight; }}public class Main { static int n; static int[][] arr; ..

문제https://www.acmicpc.net/problem/1753풀이(50분)import java.io.*;import java.util.*;class Node implements Comparable{ int end, weight; public Node(int end, int weight){ this.end = end; this.weight = weight; } @Override public int compareTo(Node o) { return weight - o.weight; }}public class Main { private static final int INF = 100_000_000; static int v,e..

문제https://www.acmicpc.net/problem/2553풀이(35분)import java.io.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] dp = new int[20001]; // 초기 배열 값을 위한 20001 초기화 dp[1] = 1; dp[2] = 2; dp[3] = 6; dp[4..

문제https://www.acmicpc.net/problem/2210풀이(11분)import java.util.*;import java.io.*;public class Main { static String grid[][] = new String[5][5]; // 숫자 격자판 (5x5 크기) static int dx[] = {0, 0, 1, -1}; // 상하좌우 이동을 위한 배열 (x 좌표 변화) static int dy[] = {1, -1, 0, 0}; // 상하좌우 이동을 위한 배열 (y 좌표 변화) static HashSet uniqueNumbers = new HashSet(); // 중복을 방지하기 위한 HashSet public static void main(Strin..

문제https://www.acmicpc.net/problem/1347풀이(40분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int l = Integer.parseInt(br.readLine()); Character[][] arr = new Character[100][100]; // 최초 배열 초기화 ..

문제https://www.acmicpc.net/problem/1946풀이(12분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int t = Integer.parseInt(br.readLine()); for(int i = 0; i Integer.compare(o1[0], o2[0])); int answer..

문제https://www.acmicpc.net/problem/1850풀이(20분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine()); long a = Long.parseLong(st.nextToken()); long b = Long.parseLong..