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..

: 힌트 2차원 배열을 활용해 보자. package doit.chap5.실습; import java.util.*; public class Main { static String pattern(int n) { String head; String body; String bottom; if (n == 3) { head = "***"; body = "* *"; bottom = "***"; } else { head = pattern(n / 3).repeat(n / 3); body = pattern(n / 3) + pattern(n / 3).replace("*", " ") + pattern(n / 3); bottom = pattern(n / 3).repeat(n / 3); } return head + "\n" + b..