Tastynut

package step_by_step.level15; import java.util.*; public class N_Queen { static int[] arr; static int count = 0; static boolean check (int row) { for (int j = 0; j < row; j++) { if ((arr[j]) == arr[row] || ( row - j == Math.abs(arr[row] - arr[j]))) { return false; } } return true; } static void nQueen(int n, int row) { if (row == n) { count++; return; } for (int column = 0; column < n; column++)..

import java.util.Scanner; public class Main { static int count_0(int n) { int count_2 = 0; int count_5 = 0; while (n > 0) { for (int i = 2; (n % i) == 0; i *= 2) { count_2++; } for (int i = 5; (n % i) == 0; i *= 5) { count_5++; } n--; } return Math.min(count_2, count_5); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); if..

package step_by_step.level14; import java.util.*; public class 검문 { static int Euclid(int s, int l) { if (l%s == 0) { return s; } else { return Euclid(l%s, s); } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < arr.length; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); HashSet set = new LinkedHash..

접혀 들어간 부분을 어떻게 찾아내야 할지 전혀 모르겠다..

문제에서 제시한 입력으로 출력은 알맞게 나오는데 틀렸다고 한다. 그 이유를 모름 public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = sc.nextInt(); } int m = sc.nextInt(); Map map = new LinkedHashMap(); for(int i = 0; i < m; i++) { map.put(sc.nextInt(), 0); } for (int j : arr) { if (map.containsKey(j)) { map.put(j, map.get..

https://github.com/lhj0954/Baekjoon-codingTest.git GitHub - lhj0954/Baekjoon-codingTest: 백준 코딩 테스트 백준 코딩 테스트. Contribute to lhj0954/Baekjoon-codingTest development by creating an account on GitHub. github.com

import java.util.*; public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); HashSet set1 = new HashSet(); for (int i = 0; i < n; i++) { set1.add(sc.nextInt()); } int m = sc.nextInt(); int[] arr = new int[m]; for (int i = 0; i < m; i++) { arr[i] = sc.nextInt(); } for (int i = 0; i < arr.length; i++) { if (set1.contains(arr[i])) { arr[..

import java.io.*; import java.util.*; public class Main { static void swap (char[] arr, int a, int b) { char temp = arr[a]; arr[a] = arr[b]; arr[b] = temp; } public static void main(String[] args) throws IOException { Scanner sc = new Scanner(System.in); String n = sc.next(); char[] arr = new char[n.length()]; for (int i = 0; i < n.length(); i++) { arr[i] = n.charAt(i); } for (int i = 0; i < arr..

import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = Integer.parseInt(br.readLine()); int[] arr = new int[n]; int[] result = new int[4]; for (int i = 0; i < arr.length; i++) {..

계수 정렬 참고 : https://st-lab.tistory.com/104 자바 [JAVA] - 카운팅 정렬 (Counting Sort / 계수 정렬) [정렬 알고리즘 모음] 더보기 1. 계수 정렬 (Counting Sort) - [현재 페이지] 2. 선택 정렬 (Selection Sort) 3. 삽입 정렬 (Insertion Sort) 4. 거품 정렬 (Bubble Sort) 5. 셸 정렬 (Shell Sort) 6. 힙 정렬 (H.. st-lab.tistory.com import java.io.*; import java.util.*; public class Main { static int max (int[] arr) { int max = arr[0]; for (int j : arr) { if (j >..