Algorithm (138) 썸네일형 리스트형 [백준_JAVA_알고리즘] 11651 좌표 정렬하기 2 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter .. [백준_JAVA_알고리즘] 11650 좌표 정렬하기 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new Buff.. [백준_JAVA_알고리즘] 1427 소트인사이드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; import javax.sound.sampled.ReverbType; public class Main { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedW.. [백준_JAVA_알고리즘] 2751 수 정렬하기 2 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; public class Main { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new BufferedWrit.. [백준_JAVA_알고리즘] 25305 커트라인 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int N = scanner.nextInt(); int k = scanner.nextInt(); int tmp = 0; int[] arr = new int[N]; for(int i = 0; i < N; i++) arr[i] = scanner.nextInt(); for(int i = 0; i < N; i++) { for(int j = 0; j < N-1-i; j++) { if(arr[j] < arr[j+1]) { tmp = arr[j+1]; arr[j+1] = arr[j]; ar.. [백준_JAVA_알고리즘] 2587 대표값2 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int sum = 0; int tmp = 0; int[] arr = new int[5]; for(int i = 0; i arr[j+1]) { tmp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = tmp; } } } System.. [백준_JAVA_알고리즘] 2750 수 정렬하기 (1) Arrays.sort() 정렬 풀이방법 import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int N = scanner.nextInt(); int[] arr = new int[N]; for(int i = 0; i < N; i++) arr[i] = scanner.nextInt(); Arrays.sort(arr); for(int i = 0; i < N; i++) System.out.println(arr[i]); scanner.close(); } } Arrays.sort()를 배열을.. [백준_JAVA_알고리즘] 2839 설탕 배달 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int N = scanner.nextInt(); if (N == 4 || N == 7) { System.out.println(-1); } else if (N % 5 == 0) { System.out.println(N / 5); } else if (N % 5 == 1 || N % 5 == 3) { System.out.println((N / 5) + 1); } else if (N % 5 == 2 || N % 5 == 4) { System.out.println((N / 5) + 2).. 이전 1 ··· 4 5 6 7 8 9 10 ··· 18 다음
