메델_project

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; public class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int K= Integer.parseInt(br.readLine()); Stack stack = new Stack(); for(int i=0; i

1. 역순 정렬하기 SELECT name, datetime from animal_ins order by animal_id desc; 2. 여러 기준으로 정렬하기 SELECT ANIMAL_ID, NAME, DATETIME FROM ANIMAL_INS ORDER BY NAME ASC, DATETIME DESC; 3. 모든 레코드 조회하기 SELECT * FROM ANIMAL_INS; 4. 동물의 아이디와 이름 SELECT ANIMAL_ID, NAME FROM ANIMAL_INS ORDER BY ANIMAL_ID; 5. 강원도에 위치한 생산공장 목록 출력하기 SELECT FACTORY_ID, FACTORY_NAME, ADDRESS FROM FOOD_FACTORY WHERE ADDRESS LIKE '강원도%' ..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; 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()); Stack stack = new Stack(); StringBuilder sb = new St..

public class Main { static class Elem implements Comparable{ public String name; public int korean, english, math; @Override public int compareTo(Elem other) { //내림차순 if (korean != other.korean) return other.korean - korean; // 오름차순 if (english != other.english) return english - other.english; // 내림차순 if (math != other.math) return other.math - math; // 오름차순 return name.compareTo(other.name); } ..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; 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()); int[] arr =..

import java.util.ArrayList; import java.util.Collections; import java.util.HashSet; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int N = kb.nextInt(); int M = kb.nextInt(); kb.nextLine(); HashSet set = new HashSet(); for(int i=0; i

import java.util.Arrays; import java.util.Scanner; public class Main { static int N; static int[] A; static boolean binarySearch(int[] A, int L,int R, int X){ while (L

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int T = kb.nextInt(); for (int t = 0; t < T; t++) { int N = kb.nextInt(); int M = kb.nextInt(); int[] A = new int[N]; int[] B = new int[M]; for (int i = 0; i < N; i++) { A[i] = kb.nextInt(); } for (int i = 0; i < M; i++) { B[i] = kb.nextInt(); } Arr..

import java.util.Scanner; public class Main { static StringBuilder sb = new StringBuilder(); static int N, M ; static int[] select; static void rec_func(int k) { if(k == M+1) { for(int i=1; i

import java.util.Scanner; public class Main { static StringBuilder sb = new StringBuilder(); static int N, M; static int[] select; static void rec_func(int k) { if(k == M+1) { for(int i=1; i