알고리즘 & 자료구조569 백준 2439 import java.util.Scanner; public class Main2439 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T= sc.nextInt(); for(int i=1; i 2021. 7. 2. 백준 2438 import java.util.Scanner; public class Main2438 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T= sc.nextInt(); for(int i=1; i 2021. 7. 2. 백준 11022 import java.util.Scanner; public class Main11022 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); int[] A = new int[T]; int[] B = new int[T]; for(int i=0; i 2021. 7. 2. 백준 11021 import java.util.Scanner; public class Main11021 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); int[] A = new int[T]; int[] B = new int[T]; for(int i=0;i 2021. 7. 2. 백준 10871 import java.util.Scanner; public class Main10871 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int X = sc.nextInt(); int[] A = new int[N]; for(int i=0; i 2021. 7. 2. 공간복잡도(Space Complexity) 보호되어 있는 글 입니다. 2021. 7. 2. 이전 1 ··· 87 88 89 90 91 92 93 ··· 95 다음