Algorithm/Baekjoon (120) 썸네일형 리스트형 [백준_JAVA_알고리즘] 1934 최소공배수 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.List; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); List results = new ArrayList(); int T = Integer.parseIn.. [백준_JAVA_알고리즘] 1764 듣보잡 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.ArrayList; import java.util.Collections; import java.util.HashSet; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bufferedReader = new Buffer.. [백준_JAVA_알고리즘] 7785 회사에 있는 사람 import java.util.ArrayList; import java.util.Comparator; import java.util.HashMap; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); HashMap hashMap = new HashMap(); String name = ""; String log = ""; int n = scanner.nextInt(); for(int i = 0; i < n; i++) { name = scanner.next(); log = scanner.next(); if(hashMap.contai.. [백준_JAVA_알고리즘] 10815 숫자 카드 import java.util.HashMap; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); HashMap hashmap = new HashMap(); StringBuffer stringBuffer = new StringBuffer(); int numN = 0; int numM = 0; int N = scanner.nextInt(); for (int i = 0; i < N; i++) { numN = scanner.nextInt(); hashmap.put(numN, i); } int M = scanner.nextInt(); .. [백준_JAVA_알고리즘] 1010 다리 놓기 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int T = scanner.nextInt(); long[] resultArr = new long[T]; for(int i = 0; i < T; i++) { int N = scanner.nextInt(); int M = scanner.nextInt(); long result = calculate(N, M); resultArr[i] = result; } for(int i = 0; i < T; i++) { System.out.println(resultArr[i]); } scanne.. [백준_JAVA_알고리즘] 10814 나이순 정렬 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; public class Main { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new BufferedWriter(new OutputStreamWriter.. [백준_JAVA_알고리즘] 1181 단어 정렬 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; import java.util.Comparator; public class Main { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter buff.. [백준_JAVA_알고리즘] 11651 좌표 정렬하기 2 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter .. 이전 1 2 3 4 5 6 7 ··· 15 다음 목록 더보기
