알고리즘 & 자료구조569 이진 탐색(Binary Search) 보호되어 있는 글 입니다. 2021. 7. 7. 순차 탐색 보호되어 있는 글 입니다. 2021. 7. 7. 백준 3052 import java.util.Scanner; public class Main3052 { public static void main(String[] args) { Scanner s = new Scanner(System.in); int[] num = new int[10]; int[] result = new int[42]; int cnt =0; for(int i=0; i 2021. 7. 7. 백준 2577 import java.util.Scanner; public class Main2577 { public static void main(String[] args) { Scanner s = new Scanner(System.in); int A = s.nextInt(); int B = s.nextInt(); int C = s.nextInt(); int result = A * B * C; int[] cnt = new int[10]; String answer = result + ""; int num = 0; for (int i = 0; i < answer.length(); i++) { for (int j = 0; j < cnt.length; j++) { if (j == (answer.charAt(i) - '0')).. 2021. 7. 7. 백준 2562 import java.util.Scanner; public class Main2562 { public static void main(String[] args) { Scanner s = new Scanner(System.in); int[] arr = new int[9]; for(int i=0; i 2021. 7. 7. 백준 10818 import java.util.Scanner; public class Main10818 { public static void main(String[] args) { Scanner s = new Scanner(System.in); int T = s.nextInt(); int[] arr = new int[T]; for (int i = 0; i < arr.length; i++) arr[i] = s.nextInt(); int max= arr[0]; int min = arr[0]; for (int i = 1; i < arr.length; i++){ if(maxarr[i]){ min = arr[i]; } } System.out.println(min+" "+max); } } 2021. 7. 7. 이전 1 ··· 84 85 86 87 88 89 90 ··· 95 다음