diff --git "a/BOJ/1000-5000353円262円210円/JY_1405.java" "b/BOJ/1000-5000353円262円210円/JY_1405.java"
new file mode 100644
index 00000000..2084b332
--- /dev/null
+++ "b/BOJ/1000-5000353円262円210円/JY_1405.java"
@@ -0,0 +1,56 @@
+import java.io.*;
+import java.util.*;
+
+public class JY_1405 {
+
+	static int N, M;
+	static double[] arr;
+	static boolean[][] visited;
+	// 동 서 남 북
+	static int[] dx = {0, 0, 1, -1};
+	static int[] dy = {1, -1, 0, 0};
+	static double ans;
+	
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		
+		N = Integer.parseInt(st.nextToken());
+		
+		arr = new double[4];
+		for(int i=0; i<4; i++) { + arr[i] = Integer.parseInt(st.nextToken()) * 0.01; + } + + // N <= 14 이므로 상하좌우 방향으로 최대 14까지 갈 수 있으므로 보드판 크기: 30 + M = 30; + visited = new boolean[M][M]; + visited[M/2][M/2] = true; + ans = 0; + dfs(M/2, M/2, 0, 1); + + System.out.println(ans); + } + public static boolean inRange(int x, int y) { + return x>=0 && x<m && y>=0 && y<m; + } + public static void dfs(int x, int y, int cnt, double total) { + if(cnt == N) { + ans += total; + return; + } + + for(int i=0; i<4; i++) { + int nx = x + dx[i]; + int ny = y + dy[i]; + + if(!inRange(nx, ny)) continue; + if(visited[nx][ny]) continue; + + visited[nx][ny] = true; + dfs(nx, ny, cnt+1, total*arr[i]); + visited[nx][ny] = false; + } + } + +} diff --git "a/BOJ/1000-5000353円262円210円/JY_1938.java" "b/BOJ/1000-5000353円262円210円/JY_1938.java" new file mode 100644 index 00000000..c3ebfad3 --- /dev/null +++ "b/BOJ/1000-5000353円262円210円/JY_1938.java" @@ -0,0 +1,147 @@ +import java.io.*; +import java.util.*; + +public class JY_1938 { + + static int N; + static char[][] g; + // 상, 좌, 하, 우 + static int[] dx = {-1, 0, 1, 0}; + static int[] dy = {0, -1, 0, 1}; + static int ans; + static class Step { + int x, y; + int dir; // 세로: 0, 가로: 1 + int cnt; + public Step(int x, int y, int dir, int cnt) { + super(); + this.x = x; + this.y = y; + this.dir = dir; + this.cnt = cnt; + } + @Override + public String toString() { + return "Step [x=" + x + ", y=" + y + ", dir=" + dir + ", cnt=" + cnt + "]"; + } + + } + + + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + + N = Integer.parseInt(st.nextToken()); + g = new char[N][N]; + + List<int[]> bList = new ArrayList<strong>();
+		for(int i=0; i<n; i++) { + String line = br.readLine(); + for(int j=0; j<n; j++) { + g[i][j] = line.charAt(j); + + if(g[i][j] == 'B') { + g[i][j] = '0'; + bList.add(new int[] {i, j}); + } + } + } + + // 초기 나무 가로 or 세로인지 찾기 + int cDir = -1; + int[] t = bList.get(0); + int[] c = bList.get(1); + // 세로인가? (cDir =0: 세로, cDir=1: 가로) + if(c[0]+dx[0] == t[0] && c[1]+dy[0] == t[1]) { + cDir = 0; + } else { + cDir = 1; + } + + + ans = 0; + bfs(c[0], c[1], cDir); + + System.out.println(ans); + + } + public static boolean inRange(int x, int y) { + return x>=0 && x<n && y>=0 && y<n; + } + public static boolean isExit(int x, int y, int dir) { + int ax = x + dx[dir]; + int ay = y + dy[dir]; + int bx = x + dx[dir+2]; + int by = y + dy[dir+2]; + + return (g[ax][ay]=='E') && (g[x][y]=='E') && (g[bx][by] =='E'); + + } + public static void bfs(int sx, int sy, int sDir) { + // 방문처리: (i,j)좌표에 중심점이 세로(0) or 가로(1)로 방문한적이 있는지 체크 + boolean[][][] visited = new boolean[N][N][2]; + Queue<step> q = new LinkedList<strong>();
+		
+		q.add(new Step(sx, sy, sDir, 0));
+		visited[sx][sy][sDir] = true;
+		
+		while(!q.isEmpty()) {
+			Step now = q.poll();
+			
+			if(isExit(now.x, now.y, now.dir)) {
+				ans = now.cnt;
+				break;
+			}
+			
+			// U, L, D, R
+			for(int i=0; i<4; i++) { + int nx = now.x + dx[i]; + int ny = now.y + dy[i]; + + // 중심 통나무 체크 + if(!inRange(nx, ny)) continue; + if(visited[nx][ny][now.dir]) continue; + if(g[nx][ny] == '1') continue; + + + // 나머지 통나무들 체크 + int ax = nx + dx[now.dir]; + int ay = ny + dy[now.dir]; + int bx = nx + dx[now.dir+2]; + int by = ny + dy[now.dir+2]; + if(!inRange(ax, ay) &#124;&#124; !inRange(bx, by)) continue; + if(g[ax][ay] == '1' &#124;&#124; g[bx][by] == '1') continue; + + // 이동가능 + visited[nx][ny][now.dir] = true; + q.add(new Step(nx, ny, now.dir, now.cnt+1)); + } + + if(!canTurn(now.x, now.y)) continue; + // turn + int nDir = Math.abs(now.dir-1); + if(visited[now.x][now.y][nDir]) continue; // 회전한 방향으로 회전한 적이 있음 + int ax = now.x + dx[nDir]; + int ay = now.y + dy[nDir]; + int bx = now.x + dx[nDir+2]; + int by = now.y + dy[nDir+2]; + if(!inRange(ax, ay) &#124;&#124; !inRange(bx, by)) continue; + if(g[ax][ay] == '1' &#124;&#124; g[bx][by] == '1') continue; + + visited[now.x][now.y][nDir] = true; + q.add(new Step(now.x, now.y, nDir, now.cnt+1)); + } + + } + public static boolean canTurn(int x, int y) { + for(int i=x-1; i<x+2; i++) { + for(int j=y-1; j<y+2; j++) { + if(!inRange(i, j)) return false; + if(g[i][j] == '1') return false; + } + } + return true; + } + +} diff --git "a/BOJ/10001-15000353円262円210円/JY_13334.java" "b/BOJ/10001-15000353円262円210円/JY_13334.java" new file mode 100644 index 00000000..11002d52 --- /dev/null +++ "b/BOJ/10001-15000353円262円210円/JY_13334.java" @@ -0,0 +1,74 @@ +import java.io.*; +import java.util.*; + +public class JY_13334 { + + static int N; + static long D; + static class Pos implements Comparable<pos>{
+		long h, o;
+
+		public Pos(long h, long o) {
+			super();
+			this.h = h;
+			this.o = o;
+		}
+		
+		// 끝점 기준으로 정렬
+		@Override
+		public int compareTo(Pos other) {
+			return (int)(this.o - other.o);
+		}
+
+		@Override
+		public String toString() {
+			return "Pos [h=" + h + ", o=" + o + "]";
+		}
+		
+	}
+	
+	
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		
+		N = Integer.parseInt(st.nextToken());
+		
+		// 끝점이 작은 순으로 정렬 => 시작점만 신경쓰면됨
+		// 반대로) 시작점 기준으로 정렬하면, 시작점이 이동할 때 이전 것들의 시작점, 끝점을 모두 신경써줘야 함
+		PriorityQueue<pos> pq = new PriorityQueue<strong>();
+		for(int i=0; i<n; i++) { + st = new StringTokenizer(br.readLine()); + long h = Long.parseLong(st.nextToken()); + long o = Long.parseLong(st.nextToken()); + + if(h <= o) { + pq.add(new Pos(h, o)); + } else { + pq.add(new Pos(o, h)); + } + + } + + D = Long.parseLong(br.readLine()); + + int ans = 0; + PriorityQueue<long> tpq = new PriorityQueue<strong>();
+		while(!pq.isEmpty()) {
+			Pos now = pq.poll();
+			long start = now.o - D;
+			tpq.add(now.h);
+			
+			while(!tpq.isEmpty() && tpq.peek() < start) {
+				// 현재 시작지점 보다 작은 시작점들은 현재 구간에 포함될 수 없음
+				tpq.poll();
+			}
+			
+			ans = Math.max(ans, tpq.size());
+		}
+		
+		System.out.println(ans);
+		
+	}
+
+}
diff --git "a/SQL/19354円243円274円354円260円250円/JY_Montly_Transactions_1.sql" "b/SQL/19354円243円274円354円260円250円/JY_Montly_Transactions_1.sql"
new file mode 100644
index 00000000..74265b06
--- /dev/null
+++ "b/SQL/19354円243円274円354円260円250円/JY_Montly_Transactions_1.sql"
@@ -0,0 +1,9 @@
+-- 1193. Monthly Transactions I
+-- https://leetcode.com/problems/monthly-transactions-i/
+SELECT DATE_FORMAT(trans_date, "%Y-%m") AS month, country
+ , COUNT(*) AS trans_count
+ , COUNT(IF(state = 'approved', state, NULL)) AS approved_count
+ , SUM(amount) AS trans_total_amount
+ , SUM(IF(state = 'approved', amount, 0)) AS approved_total_amount
+FROM TRANSACTIONS
+GROUP BY YEAR(trans_date), MONTH(trans_date), country
\ No newline at end of file
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/GreatAlgorithm-Study/AlgorithmStudy/pull/261.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/GreatAlgorithm-Study/AlgorithmStudy/pull/261.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>