지구정복

-문제 https://www.acmicpc.net/problem/16174 16174번: 점프왕 쩰리 (Large) 쩰리는 맨 왼쪽 위의 칸에서 출발해 (행, 열)로 나타낸 좌표계로, (1, 1) -> (2, 1) -> (3, 1) -> (3, 3)으로 이동해 게임에서 승리할 수 있다. www.acmicpc.net -코드 자바 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { static int N; static int[][] map; static boolean[][] visit; public ..

-문제 https://www.acmicpc.net/problem/1303 1303번: 전쟁 - 전투 첫째 줄에는 전쟁터의 가로 크기 N, 세로 크기 M(1 ≤ N, M ≤ 100)이 주어진다. 그 다음 두 번째 줄에서 M+1번째 줄에는 각각 (X, Y)에 있는 병사들의 옷색이 띄어쓰기 없이 주어진다. 모든 자리에는 www.acmicpc.net -자바 1번 package bfs_dfs; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ1303 { static int N, M, our_val, enemy_..

ㅇ Be supposed to ~ 1. What am I supposed to do with this? 2. What am I supposed to do with this shirts? 3. What am I supposed to do with this thing? 4. How am I supposed to live? 5. I was supposed to do some work this weekend, but I couldn't. 6. Do you know what the weather is supposed to be like tommorrow? 7. He was supposed to be on a business trip to Lisbon. 8. He was supposed to be back by n..

-문제 https://www.acmicpc.net/problem/16953 16953번: A → B 첫째 줄에 A, B (1 ≤ A < B ≤ 109)가 주어진다. www.acmicpc.net -문제풀이 자바 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; class Pair2 { long a; int res; public Pair2( long a, int res ) { this.a = a; this.res = res; } } publ..