728x90

알고리즘 46

93 삐약 : 백준 1780| 종이의 개수 [바킹독| 재귀 |JAVA]

https://www.acmicpc.net/problem/1780 package BKD_0x0B_Recursion;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_1780 { static int[][] input; static int minus, zero, plus =0; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamRe..

80 삐약 : 백준 14501| 퇴사 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/14501  package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_14501 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine());..

75 삐약 : 백준 11659| 구간 합 구하기 4 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/11659 package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_11659 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st= new StringTokenizer(b..

74 삐약 : 백준 11726| 2xn 타일링 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/11726  package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class BOJ_11726 { 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[1001];..

72 삐약 : 백준 9095| 1,2,3 더하기 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/9095 package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class BOJ_9095 { static int[] dp; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int T = Integer.parseInt(br.readLine()); // test case ..

69 삐약 : 백준 13913| 숨바꼭질4 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/13913  우엑 꽝 기각...중략... q.offer(new Location(N, new StringBuilder().append(N)));...중략... while(!q.isEmpty()){ Location l = q.poll();...중략... ways=l.way.toString(); } } if(l.x+1 초반에는 위치 값과 진행 순서를 문자열로 저장하는 클래스를 선언하여 문제를 풀이하려 했다.그러나 이전에도 겪었듯이 문자열 클래스를 사용하는 것은 메모리상에도 접근하는 시간 상에도 큰 부담을 줄 수 있다는 것을 알고 있기에변동성..

64 삐약 : 백준 6593| 상범 빌딩 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/6593 package BKD_0x9_BFS;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 BOJ_6593 { static int[] dz ={0,0,0,0,1,-1}; static int[] dy ={0,0,1,-1,0,0}; static int[] dx ={1,-1,0,0,0,0}; static int L; static int R; ..

63 삐약 : 백준 10026| 적록색약 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/10026 package BKD_0x9_BFS;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;public class BOJ_10026 { static char[][] RGB_colors; static char[][] RG_B_colors; static int[] dx ={0,1,0,-1}; static int[] dy ={1,0,-1,0}; static int N; public static void main(Str..

728x90