메델_project

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Collections; 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()); PriorityQueue ..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); StringTokenizer st = new StringTokenizer(br.readLine()); int N = Integer.pars..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.PriorityQueue; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); int N = Integer.parseInt(br.readLine()); PriorityQueue p..

import java.util.Scanner; public class Main { static int R, C; static char[][] map; static int sheepCount, wolfCount, totalSheep, totalWolf; static int[] dx = {1, 0, -1, 0}; static int[] dy = {0, 1, 0, -1}; static boolean[][] visited; static StringBuilder sb = new StringBuilder(); static void dfs(int x, int y) { visited[x][y] = true; if(map[x][y] == 'o') sheepCount++; if(map[x][y] == 'v') wolfCo..

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int T = kb.nextInt(); long[] dy = new long[101]; dy[1] = 1; dy[2] = 1; dy[3] = 1; for(int i=0; i

import java.util.Scanner; import java.util.TreeMap; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int a = kb.nextInt(); int b = kb.nextInt(); TreeMap map = new TreeMap(); for(int i=0; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int count = 1; int find = 666; while(true) { if(count == n) { System.out.println(find); break; } find++; if(String.valueOf(find).contains("666")) { count++; } } } }

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

import java.util.HashMap; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int N = kb.nextInt(); HashMap map = new HashMap(); for(int i= 0; i

import java.util.Scanner; public class Main { static long[][] arr; static long combination(int m, int n) { if(arr[m][n] != 0) { return arr[m][n]; } if(m ==n || n == 0) { return 1; } arr[m][n] = combination(m-1, n-1) + combination(m-1, n); return arr[m][n]; } public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int T = kb.nextInt();..