CodingTest

https://www.acmicpc.net/problem/1463import java.io.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int num=Integer.parseInt(br.readLine()); int[] arr = new int[10000001]; ..

https://www.acmicpc.net/problem/1003 1003번: 피보나치 함수각 테스트 케이스마다 0이 출력되는 횟수와 1이 출력되는 횟수를 공백으로 구분해서 출력한다.www.acmicpc.netimport java.io.*;public class Main { static int zero_count; static int one_count; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.*;public class Main { static class MineCraft implements Comparable { private int time; private int Y; MineCraft(int time, int y) { this.time = time; this.Y = y; } public int getTime() { return time; } publi..

https://www.acmicpc.net/problem/18111경우의수 case 1: 블럭 설치하는게 더 빠를때  1-1 if 보유 블럭 수가 더많아야함 case 2: 블럭 부수는게 더 빠를때 case 3: 가지고 있는 블럭수가 적어서 부셔서 설치 할 때 부시면 B+1 브루트포스 알고리즘이라 -부술때의 시간 - 설치할때의 시간 (B이 부족하면 못함) - 부수고 설치할때의 시간 중 적은 수