본문 바로가기

전체 글

(229)
달려 Zoo
[5502] 팰린드롬 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); String st1 = sc.next(); String st2 = new StringBuffer(st1).reverse().toString(); int[][] DP = new int[N+1][N+1]; for(int i=0; i
[2606] 바이러스 import java.util.Scanner; import java.util.ArrayList; public class Main { static ArrayList[] list; static boolean[] visited; static int answer; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); list = new ArrayList[N+1]; visited = new boolean[N+1]; for(int i=0; i
[11051] 이항 계수 2 import java.util.Scanner; // 이항계수2 public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int K = sc.nextInt(); int[][] arr = new int[1001][1001]; for(int i=1; i
[1389] 케빈 베이컨의 6단계 법칙 import java.util.Scanner; import java.util.ArrayList; import java.util.LinkedList; import java.util.Queue; public class Main { static int N, M, cabin; static ArrayList[] list; static Queue queue; static boolean[] visited; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); M = sc.nextInt(); list = new ArrayList[N+1]; for(int i=0; i
[9251] LCS import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String st1 = sc.next(); String st2 = sc.next(); int[][] DP = new int[st1.length()+1][st2.length()+1]; for(int i=0; i
[2589] 보물섬 import java.util.Scanner; import java.util.ArrayList; import java.util.Queue; import java.util.LinkedList; // 보물섬 -> BFS public class Main { static int N, M, minute, max; static char[][] map; static boolean[][] visited; static Queue queue; static int[][] dir = { { 1, 0 }, { 0, 1 }, { -1, 0 }, { 0, -1 } }; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextIn..
[1157] 단어 공부 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String st = sc.next(); st = st.toUpperCase(); int[] arr = new int[91]; for (int i = 0; i < st.length(); i++) { arr[(int) st.charAt(i)]++; } int max = 0; int idx = 0; for (int i = 65; i max) { max = arr[i]; idx = i; } } int cnt = 0; for(int i=65; i