import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class baeckjoon_2003 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int m = ..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class baekjoon_1254 { public static void main(String[] args) throws IOException { // readLine 사용 시 예외처리 필수 BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); String str = in.readLine(); int answer = str.length(); for (int i = 0; i < str.length(); i++) { if(isPalind(str.subst..

import java.util.*; class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; Deque dq = new LinkedList(); for(int i : numbers){ dq.add(i); } if(direction.contains("right")){ dq.addFirst(dq.removeLast()); }else { dq.addLast(dq.removeFirst()); } for (int i = 0; i < numbers.length; i++) { answer[i] += dq.pop(); } return answer; } }

import java.util.*; class Solution { public String solution(String s) { String answer =""; char [] carr = s.toCharArray(); Hashtable hs = new Hashtable(); for (char c : carr){ hs.put(c, hs.getOrDefault(c, 0) + 1); } List list = new ArrayList(hs.keySet()); Collections.sort(list); for (Character key : list){ if(hs.get(key) == 1){ answer += key; } } return answer; } }

class Solution { public int solution(String str1, String str2) { return str1.contains(str2) ? 1 : 2; } }

import java.util.*; public class asdas { public static void main(String[] args) { Scanner sc= new Scanner(System.in); int num = sc.nextInt(); while (true){ String finish = sc.next(); if(finish.equals("=")){ break; }switch (finish){ case "+": num += sc.nextInt(); break; case "-": num-= sc.nextInt(); break; case "*": num*= sc.nextInt(); break; case "/": num /= sc.nextInt(); break; } } System.out.p..

import java.util.Scanner; public class baekjoon_10807 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int [] numbers = new int[N]; int cnt = 0; for (int i = 0; i < N; i++) { numbers[i] = sc.nextInt(); } int sum = sc.nextInt(); for (int i = 0; i < N; i++) { if(sum == numbers[i]){ cnt++; } } System.out.println(cnt); } }

import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class baekjoon_1158 { public static void main(String[] args) { Scanner sc= new Scanner(System.in); Queue q = new LinkedList(); int n = sc.nextInt(); int k = sc.nextInt(); String answer = ""; for (int i = 1; i

import java.util.Scanner; public class baekjoon_26008 { public static void main(String[] args) { // 해시해킹 Scanner sc= new Scanner(System.in); int N = sc.nextInt(); // 3 int M = sc.nextInt(); // 2 int A = sc.nextInt(); // 1 int H = sc.nextInt(); // 1 long answer = 1; for (int i = 0; i < N - 1; i++) { answer = answer * M % 1000000007; } System.out.println(answer); } }

import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class arrayMinMax { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; for (int i = 0; i < N; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); System.out.println(arr[0] + " " + arr[arr.length - 1]); } }