메델_project

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[] numbers = new int[N+1]; int[] sumNumbers = new int[N+1]; StringBuilder sb = new StringBuilder(); for(int i=1; i

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

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String input; String longestWord = ""; while (!(input = scanner.next()).equals("E-N-D")) { String cleanedWord = input.replaceAll("[^a-zA-Z-]", ""); if (cleanedWord.length() > longestWord.length()) { longestWord = cleanedWord; } } System.out.println(longestWord.toLowerC..

import java.util.*; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); ArrayList list = new ArrayList(); for(int i=0; ilist.get(2)) { System.out.println(list.get(0)+ list.get(1)+ list.get(2)); }else { System.out.println((list.get(0)+ list.get(1))*2-1); } } }

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

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int T = kb.nextInt(); int maxN = 1000000; long[] dy = new long[maxN+1]; dy[1] = 1; dy[2] = 2; dy[3] = 4; for(int j=4; j

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] dy = new int[1005]; dy[1] = 1; dy[2] = 2; for(int i=3; i

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 < T; i++) { int n = kb.nextInt(); int[] dy = new int[12]; dy[1] = 1; dy[2] = 2; dy[3] = 4; for (int j = 4; j

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); String s = kb.next(); String[] arr = s.split(""); List list = new ArrayList(); for(int i=0; i

import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; class Time implements Comparable{ public int start, end; Time(int start, int end){ this.start = start; this.end = end; } @Override public int compareTo(Time o) { if (this.end == o.end) { return this.start - o.start; } else { return this.end - o.end; } } } public class Main { public static v..