Traveling Programmer

문제https://www.acmicpc.net/problem/4948풀이(17분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); boolean flag = true; while(flag){ int testCase = Integer.parseInt(br.readLine()); if(testCase == 0){ br..

문제https://school.programmers.co.kr/learn/courses/30/lessons/181187풀이(30분)import java.util.*;class Solution { public long solution(int r1, int r2) { long answer = 0; double powR1 = Math.pow(r1, 2); double powR2 = Math.pow(r2, 2); int onLine = (r2 - r1 + 1)*4; //선 위에 있는 좌표 개수 for(int i=0; i r1) powR1 = 0; double y1 =0; if(powR1 != 0){ ..

문제https://school.programmers.co.kr/learn/courses/30/lessons/340212풀이(21분)class Solution { public int solution(int[] diffs, int[] times, long limit) { int answer = Integer.MAX_VALUE; int left = 0; int right = Integer.MAX_VALUE; int level; while (left 0) { timeSum = times[i - 1]; } if (level >= diffs[i]) { // 바..

문제https://www.acmicpc.net/problem/1912풀이(15분)import java.util.*;import java.io.*;class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int[] arr = new int[N]; StringTokenizer st = new StringTokenizer(br.readLine()); for (int i = 0; i  누적합과 dp의 혼합형 문제이다.1. 이전 dp..

문제https://school.programmers.co.kr/learn/courses/30/lessons/43238?language=java풀이(20분)import java.util.Arrays;class Solution { public long solution(int n, int[] times) { long answer = 0; Arrays.sort(times); long left = 0; long right = times[times.length-1] * (long)n; //최악의 경우 while(left  이분탐색이라는 힌트를 통해 문제를 접근하지 않았다면 다소 어려울 수도 있었다고 생각한다.풀이 과정은 다음과 같다...

문제https://www.acmicpc.net/problem/17219풀이(3분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int m = Integer.parseIn..

문제https://www.acmicpc.net/problem/6064풀이(32분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int t = Integer.parseInt(br.readLine()); // 테스트 케이스 수 StringBuilder sb = new StringBuilder(); for (int i = 0; i  먼저 해당 풀이를 설명하자면멸망 연..

문제https://www.acmicpc.net/problem/21736풀이(22분)import java.awt.Point;import java.io.*;import java.util.*;public class Main { static int answer = 0; static Queue queue = new LinkedList(); static int n; static int m; static char[][] arr ; static int[][] direction = {{-1,0}, {1,0} , {0,-1}, {0,1}}; public static void main(String[] args) throws IOException{ BufferedReader..

문제https://www.acmicpc.net/problem/1012풀이(25분)import java.io.*;import java.util.*;public class Main { static boolean[][] originArr; static Queue queue; static int[][] direction = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}}; public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; ..

문제https://www.acmicpc.net/problem/18870풀이(22분)import java.io.*;import java.util.*;public class Main { static int[] originArr; static Set sortedSet = new TreeSet(); static int[] answerArr; public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int n = Integer.parseInt..