개발잡부

public static String solution(String s) { String answer = ""; String[] strings = s.split(" "); int min = Integer.parseInt(strings[0]); int max = Integer.parseInt(strings[0]); for (int i = 0; i 0) { int nu = Integer.parseInt(strings[i]); if (nu = max) { max = nu; } } } answer = min + " " + max; return answer; }

A non-empty array A consisting of N numbers is given. The array is sorted in non-decreasing order. The absolute distinct count of this array is the number of distinct absolute values among the elements of the array. For example, consider array A such that: A[0] = -5 A[1] = -3 A[2] = -1 A[3] = 0 A[4] = 3 A[5] = 6 The absolute distinct count of this array is 5, because there are 5 distinct absolut..

문제 An array A consisting of N integers is given. It contains daily prices of a stock share for a period of N consecutive days. If a single share was bought on day P and sold on day Q, where 0 ≤ P ≤ Q < N, then the profit of such transaction is equal to A[Q] − A[P], provided that A[Q] ≥ A[P]. Otherwise, the transaction brings loss of A[P] − A[Q]. For example, consider the following array A consis..

loop 는 1번만 돌게끔 하고 큰 숫자는 long 으로 처리 int 로 하니까 timeout 뜸.. package kr.co.doo.cote.groom; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class ArrayMmulti { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer streamTokenizer = new StringTokenizer..

package kr.co.doo.cote.groom; import java.io.*; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Queuee { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int end = Integer.parseInt(st.nextToken()); int qSiz..

package kr.co.doo.cote.groom; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Stack; import java.util.StringTokenizer; public class Stackk { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int end = Integer.parseInt(st.next..

package kr.co.doo.cote.groom; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class EightNumber { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String input = br.readLine(); StringTokenizer stringTokenizer = new StringTokenizer(br.readLine()); int sum = ..

package groom; import java.io.*; public class Suyul { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String input = br.readLine(); int n = Integer.parseInt(input); int ret = func(n); System.out.println(ret % 1000000007); } public static int func(int n) { if (n > 2) { return func(n - 2) + func(n - 1); } else { re..

double 대신 long 으로 풀어야 하고 Math.pow 도 안쓰고 곱하니까 되네 package groom; import java.io.BufferedReader; import java.io.InputStreamReader; public class Hobby { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String input = br.readLine(); long n = Long.parseLong(input); long sum = (n * (n + 1) / 2) % 1000000007; long ret = (..

import java.io.*; class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int input = Integer.parseInt(br.readLine()); int[] ints = new int[]{40, 20, 10, 5, 1}; int ret = 0; for (int i = 0; i < ints.length; i++) { if (input % ints[i] == 0) { ret = ret + (input / ints[i]); break; } else { ret = ret + (input /..