메델_project

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.HashSet; 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(); int n = Integer.parseInt(br.readLine()); StringToke..

import java.util.HashSet; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String s = kb.next(); HashSet set = new HashSet(); for(int i=0; i

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

import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); List answerList = new ArrayList(); List list = new ArrayList(); int[] index = new int[8]; for(int i=0; i

import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.LinkedHashMap; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int N = kb.nextInt(); int C = kb.nextInt(); LinkedHashMap map = new LinkedHashMap(); for(int ..

import java.util.ArrayList; import java.util.Collections; import java.util.HashMap; import java.util.List; 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.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.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner kb = new Scanner(System.in); String s = kb.next(); String[] suffix = new String[s.length()]; 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(); TreeMap map = new TreeMap(); int n = kb.nextInt(); for(int i=0; i