메델_project

import java.util.Scanner; public class Main { static StringBuilder sb = new StringBuilder(); static int N, M; static int[] select; static void rec_func(int k) { if (k == M + 1) { for (int i = 1; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int num = kb.nextInt(); int[][] arr = new int [15][15]; for(int i=1; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int num = kb.nextInt(); int originalNum = num; int count = 0; do { int tensDigit = num / 10; int onesDigit = num % 10; int sum = tensDigit + onesDigit; num = (onesDigit * 10) + (sum % 10); count++; } while (num != originalNum); System.out.print(count); } }

class Solution { static boolean[] visit; static int num; static int[][] comInfo; public int solution(int n, int[][] computers) { int answer = 0; visit = new boolean[n]; num = n; comInfo = computers; for(int i=0; i< num; i++){ if(!visit[i]){ dfs(i); answer++; } } return answer; } static void dfs(int x){ visit[x] = true; for(int i=0; i

import java.util.Scanner; public class Main { static int w, h; static int[][] a; static boolean[][] visit; static int[][] dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; static int count; static void DFS(int x, int y) { visit[x][y] = true; for (int i = 0; i = h || ny >= w) contin..

import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class Main { static String[] a; static int n; static boolean[][] visit; static ArrayList group; static int groupCount; static int[][] dir = {{-1,0},{1,0},{0,-1},{0,1}}; static void DFS(int x, int y) { groupCount++; visit[x][y] = true; for(int i=0; i

import java.util.ArrayList; import java.util.Collections; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static ArrayList[] adj; static boolean[] visit; static StringBuilder sb = new StringBuilder(); static void dfs(int x) { visit[x] = true; sb.append(x).append(' '); for(int y: adj[x]) { if(visit[y]) continue; dfs(y); } } static void bfs(int x)..

import java.util.ArrayList; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String color1 = kb.next(); String color2 = kb.next(); String color3 = kb.next(); ArrayList list = new ArrayList(); list.add("black"); list.add("brown"); list.add("red"); list.add("orange"); list.add("yellow"); list.add("green"); list.add("blue");..

import java.util.*; class Solution { public int solution(int[] d, int budget) { int answer = 0; Arrays.sort(d); for(int i=0; i

import java.util.*; class Solution { public ArrayList solution(int[] numbers) { ArrayList list = new ArrayList(); for(int i=0; i