끄적끄적 보니타

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class SWEA15941 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int test_case_cnt = Integer.parseInt(br.readLine()); for (int tc=1; tc

첫번째 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class AD230120 { public static final int X = 0; public static final int Y = 1; public static final int[] EWSN_X = { 1, -1, 0, 0 }; public static final int[] EWSN_Y = { 0, 0, 1, -1 }; public static int N; public static int M; public static char[][] map; publ..

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AYLnPaLqvY8DFATf SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com 1차 시도 - 답안 아님 Exception in thread "main" java.lang.OutOfMemoryError: Java heap space at SWEA15231.main(SWEA15231.java:24) 발생함 import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; impor..

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AYP5JmsqcngDFATW&categoryId=AYP5JmsqcngDFATW&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=1 SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com import java.io.BufferedReader; import java.io.IOException; import j..

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AYLnMQT6vPADFATf&categoryId=AYLnMQT6vPADFATf&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=1 SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com import java.io.IOException; import java.io.BufferedReader; import j..

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AYOBfxwaAXsDFATW&categoryId=AYOBfxwaAXsDFATW&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=1 SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com import java.io.*; public class SWEA15612 { public static void main(..

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AYEXgKnKKg0DFARx&categoryId=AYEXgKnKKg0DFARx&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=1 SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com import java.io.IOException; import java.io.BufferedReader; import j..

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=test01&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=AVuoqWnqAADw5fUK&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i= 0; ds--) { printf("%d ", stack[ds]); } printf("\n"); } } 결과

알고리즘 BFS (너비 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/15/algorithm-bfs.html [알고리즘] 너비 우선 탐색(BFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io DFS (깊이 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/14/algorithm-dfs.html [알고리즘] 깊이 우선 탐색(DFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io 백트래킹 https://chanhuiseok.github.io/..