Traveling Programmer

문제https://www.acmicpc.net/problem/24723풀이(1분)import java.io.*;public class Main{ public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); System.out.println((int)Math.pow(2,n)); }} 제일 위에 있는 캐릭터의 입장에서 봤을 때 내려갈 때마다 2가지의 선택권을 갖기 때문에 x2씩 해가는 것과 동일하다.따라서 제곱 메..

문제https://www.acmicpc.net/problem/15439풀이(1분)import java.util.*;import java.io.*;public class Main{ public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); System.out.println(n*(n-1)); }} 단순 조합 연산을 사용하면 된다. N개의 상의와 바지가 있기 때문에 서로 다른 조합은 N*(N-1)이 된다.

문제https://www.acmicpc.net/problem/2230풀이(8분)import java.awt.Point;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()); i..

문제https://www.acmicpc.net/problem/1484풀이(23분)import java.awt.Point;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; int g = Integer.parseInt(br.readLine()); PriorityQueue queue = new PriorityQueue(); ..

문제https://www.acmicpc.net/problem/14502풀이(21분)import java.awt.Point;import java.io.*;import java.util.*;public class Main { static int n,m; static int[][] arr;// static int[][] visited; static int[][] direction = new int[][]{{-1,0}, {1,0}, {0,-1}, {0,1}}; static ArrayList blankList = new ArrayList(); static ArrayList virusList = new ArrayList(); static Queue queue = new Link..

문제풀이(42분)import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class Main { static int count = 0; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int N = Integer.parseInt(st.ne..

문제https://www.acmicpc.net/problem/1520풀이(32분)import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main { static int rows, cols; static int[][] heightMap, memoization; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputS..

문제https://school.programmers.co.kr/learn/courses/30/lessons/150369 프로그래머스SW개발자를 위한 평가, 교육, 채용까지 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.kr풀이(30분)class Solution { public long solution(int cap, int n, int[] deliveries, int[] pickups) { long answer = 0; int deliveryCheck = n - 1; // 배달을 해야 할 마지막 집의 인덱스 int pickupCheck = n - 1; // 수거를 해야 할 마지막 집의 인덱스 while..

문제https://school.programmers.co.kr/learn/courses/30/lessons/250136풀이(25분)import java.awt.Point;import java.util.*;class Solution { static int[] answerArr; static int[][] direction = new int[][]{{-1,0}, {1,0}, {0,-1}, {0,1}}; static int row; static int col; static Queue queue = new LinkedList(); public int solution(int[][] land) { int answer = 0; answerArr = new in..

문제https://www.acmicpc.net/problem/2156풀이(15분)import java.io.*;import java.util.*;public class Main { static int[] arr; static Integer[] dp; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); arr = new int[n + 1]; dp = new Integer[n + 1]..