Jaebin

Comparator와 compare을 이용한다. import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.ArrayList; public class Main { static class Student{ String name; Integer score; Integer input_ranks; } public static void main(String[] args) { ArrayList students = new ArrayList(); Collections.sort(students, new Comparator() { public int compare(Student s1, Student s2..

import java.util.List; import java.util.Scanner; import java.util.Vector; import java.util.Arrays; public class Main { static Result[] rss; static class Result{ int rollsNum = 0; int bonus_rollsNum = 0; int rulesIndex = 4; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int cnt = sc.nextInt(); int[][] rolls = new int[cnt][4]; rss = new Result[cnt]; for(int i = 0; ..

import java.util.List; import java.util.Scanner; import java.util.Vector; import java.util.Arrays; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int m = sc.nextInt(); int n = sc.nextInt(); int min = 10001; int sum = 0; for(int i = m; i 2) continue; if(checkSosu(i)) { if(i > 1) { sum += i; if(i < min) min = i; } } } System.out.println(sum == 0 ?..

import java.util.List; import java.util.Scanner; import java.util.Vector; import java.util.Arrays; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); List times = new Vector(); for(int i = 0; i 4) t_distance = 4; times.add(t..

import java.util.Scanner; import java.util.List; import java.util.Vector; public class Main { static int cnt = 2; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); String n_string = Integer.toString(n); String[] cut_n_string = n_string.split(""); n = 0; n_string = ""; Boolean skipZero = !cut_n_string[cut_n_string.length - 1].equals("0") && !cut_n..

import java.util.Arrays; import java.util.Scanner; public class Main { static long[][] pascal = new long[51][51]; public static void main(String[] args) { Scanner sc = new Scanner(System.in); pascal[1][1] = 1; fillSide(1, 2); fillSide(2, 1); Start(2, 2); int x = sc.nextInt(); int y = sc.nextInt(); System.out.println(pascal[x][y] % 100000000); } public static void Start(int x, int y) { pascal[x][..

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int cnt = sc.nextInt(); int[] numsInfors = new int[cnt]; for(int i = 0; i < cnt; i++) { numsInfors[i] = sc.nextInt(); } int[] numsInfors_backup = Arrays.copyOf(numsInfors, cnt); quickSort(numsInfors); for(int i = 0; i < cnt; i++) { int value = binar..

import java.util.Scanner; import java.util.List; import java.util.Vector; public class Main { static int[] coins; static List rs2_arr = new Vector(); public static void main(String[] args) { Scanner sc = new Scanner(System.in); int price = sc.nextInt(); int cnt = sc.nextInt(); coins = new int[cnt]; for(int i = 0; i < cnt; i++) { coins[i] = sc.nextInt(); } int loopCnt = cnt - 1; int rs1 = 0; int ..

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int cnt = sc.nextInt(); int k = sc.nextInt(); int[] nums = new int[cnt]; for(int i = 0; i < cnt; i++) { nums[i] = sc.nextInt(); } int rs = 0; for(int i = 0; i < cnt; i++) { int sum = 0; for(int j = i; j < cnt; j++) { sum += nums[j]; if(sum == k) { //System.out.printf("통과 : ..

import java.util.List; import java.util.Scanner; import java.util.Vector; import java.util.Arrays; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int[] point = new int[4]; for(int i = 0; i point[1] ? point[0] : point[1];..