메델_project

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Deque; import java.util.LinkedList; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); ..

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int a = Integer.parseInt(new StringBuilder(kb.next()).reverse().toString()); int b = Integer.parseInt(new StringBuilder(kb.next()).reverse().toString()); System.out.println(Math.max(a, b)); } }

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

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int s = kb.nextInt(); int[] nums = new int[n+1]; for (int i = 0; i < n; i++) { nums[i] = kb.nextInt(); } int minLength = Integer.MAX_VALUE; int sum = 0; int lt = 0, rt = 0; while(rt=s) { minLength = Math.min(rt-lt, minLength); sum -= nums[lt++]; }else ..

import java.util.Arrays; import java.util.Scanner; public class Main { static int L, M; static char[] arr; static char[] selected; static StringBuilder sb = new StringBuilder(); static boolean isValid() { int consonant = 0, vowel = 0; for (int i = 1; i = 2 && vowel >= 1; } static void rec_func(int k, int index) { if (k == L + 1) { if (isValid()) { for (int i = 1; i

import java.util.Scanner; public class Main { static int N, S; static int[] arr; static int answer; static void rec_func(int k, int value) { if(k == N+1) { if(S == value) answer++; }else{ // 포함 o rec_func(k+1, value+arr[k]); //포함 x rec_func(k+1, value); } } public static void main(String[] args) { Scanner kb = new Scanner(System.in); N = kb.nextInt(); S = kb.nextInt(); arr = new int[N+1]; for(in..

import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); Queue queue = new LinkedList(); StringBuilder sb = new StringBuilder(); for(int i=1; i1) { sb.append(queue.poll()).append(" "); int a = queue.poll(); queue.add(a); } sb.append(queue.poll()); System.o..

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(); int[] bucket = new int[n+1]; for(int i=1; i

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(); int calAbs = Integer.MAX_VALUE; int answer = 0; int[] arr = new int[n]; for(int i=0; i