DEVKDH

#풀이import java.io.*;import java.util.Arrays;import java.util.HashSet;import java.util.Set;import java.util.StringTokenizer;public class Main { public static int[][][] isH = new int[10][10][10]; // 합이 아니면 0, 합이면 1, 외쳤으면 2이상 (1이 없으면 결) public static boolean checkH(Card a, Card b, Card c){ Set Sset = new HashSet(); Set Cset = new HashSet(); Set Bset = new HashSet(); ..

#풀이import java.io.*;import java.util.StringTokenizer;public class Main { static int N; static int[] arr; static int ans = -1; static int[] dx = {-1,0,1}; static int check(int dif, int now,int add){ int sum = add; int index = 2; while(true){ if(index==arr.length)break; if(arr[index]-now == dif){ now = arr[ind..

#풀이import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N; long G,K; StringTokenizer st = new StringTokenizer(br.readLine()); N = Integer.parseInt(st.nextToken()); G = Long.p..

#풀이import java.io.*;import java.util.Arrays;import java.util.Comparator;import java.util.StringTokenizer;public class Main { static int[] square = new int[20]; static int findNum(int n){ for(int i = 1; i=0; i--){ if(ans[i]!=0)continue; int num = findNum(i+1); ans[i] = num-(i+1); ans[num-(i+1)-1] = i+1; } for(int i = 0; i#성능#정..

#풀이import java.io.*;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int N,r,c; N = Integer.parseInt(st.nextToken()); r = Integer.parseInt(st.nextToken()); c..

#풀이import java.io.*;import java.util.Arrays;import java.util.PriorityQueue;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int[][] arr = new int[N][2]; StringTokenizer st; for(int i = ..

#풀이import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String word1,word2; word1 = br.readLine(); word2 = br.readLine(); int[][]dp = new int[word2.length()+1][word1.length()+1]; for(..

#풀이import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); StringTokenizer st; int[][] dp = new int[N+1][4]; //1:R 2:G 3:B for(int[] arr:dp){ ..

#풀이import java.io.*;import java.util.*;public class Main { static int N,K,M; static ArrayList[] graph; static int[] dist; static boolean[] visited; public static void bfs(int start) { Queue queue = new LinkedList(); queue.add(start); visited[start] = true; dist[start] = 1; while (!queue.isEmpty()) { int now = queue.poll(); f..

#풀이import java.io.*;import java.util.*;public class Main { static int N, M; static ArrayList[] graph; static int[] dist; static boolean[] visited; public static void bfs(int start) { Queue queue = new LinkedList(); queue.add(start); visited[start] = true; dist[start] = 0; while (!queue.isEmpty()) { int now = queue.poll(); fo..