Nick Dev

문제링크https://www.codetree.ai/trails/complete/curated-cards/challenge-yutnori-1d/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai 내 풀이import java.util.*;public class Main { static int n; static ..

문제 링크[https://www.codetree.ai/trails/complete/curated-cards/test-calculations-with-alphabet/description]내 풀이import java.util.*;public class Main { static char[] input; static int size; static int max = Integer.MIN_VALUE; static Map map; static Set alph; static List list; // 알파벳에 숫자 매핑하기 static void recur(int idx) { if (idx == size) { int res = calcul..

문제 링크https://www.codetree.ai/missions/2/problems/beautiful-number?&utm_source=clipboard&utm_medium=text내 코드import java.util.*;public class Main { static int n; static int ans = 0; static ArrayList list; static boolean isBeautilful() { for (int i = 0; i (); makeNum(0); System.out.println(ans); }}설명재귀함수를 통해서 1~4 숫자로 만든 n자리 수를 만든다각 숫자에 대해서 아름다운지 판단한다makeNum()가능한 ..

문제문제 링크https://www.codetree.ai/missions/2/problems/best-cross-shape-bomb?&utm_source=clipboard&utm_medium=text내 코드import java.util.*;public class Main { static int n; static int arr[][]; static int copy[][]; static int[] dxs = new int[] {1, 0, -1, 0}; static int[] dys = new int[] {0, 1, 0, -1}; public static void copy() { for (int i = 0; i = 0; i--) { if (..

문제문제 링크https://www.codetree.ai/missions/2/problems/The-2D-wind-blows?&utm_source=clipboard&utm_medium=text내 코드import java.util.*;import java.io.*;public class Main { static int n; static int m; static int[][] grid; static int r1; static int c1; static int r2; static int c2; public static void main(String[] args) throws IOException { // 여기에 코드를 작성해주세요. Buffe..