Traveling Programmer

문제https://softeer.ai/practice/7374풀이(40분)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[][] grid = new int[3][3]; // 입력 받기 for (int i = 0; i 문제 풀이 전략 사실 간단한 코드다.농장의 크기가 3x3으로 지정되어 있고, 입력도 1~3까지이기 때문에 브루트포스로 모두 구해보면 되는 것이..

문제https://www.acmicpc.net/problem/1089풀이(30분)import java.io.*;import java.util.*;public class Main { static final String[] NUMS = { // 0~9까지의 7-digit 숫자 저장 "####.##.##.####", "..#..#..#..#..#", "###..#####..###", "###..####..####", "#.##.####..#..#", "####..###..####", "####..####.####", "###..#..#..#..#",..

문제https://softeer.ai/practice/6282풀이(11분)import java.io.*;import java.util.*;public class Main { static int n; static int[][] arr; static Queue queue = new LinkedList(); static int count = 0; static int[] dx = new int[]{0, 0, 1, -1}; static int[] dy = new int[]{-1, 1, 0, 0}; public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReade..

문제https://www.acmicpc.net/problem/1720풀이(30분)import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); // N := 타일 코드의 개수 int N = Integer.parseInt(br.readLine()); // 전체 타일 코드 저장할 배열 int[] dp1 = new int[31]; // 좌우 대칭 타일 코드를 저장..

문제https://softeer.ai/practice/6280풀이(2분)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 n = Integer.parseInt(br.readLine()); int start = 1; for(int i = 0; i 문제 풀이 전략 재귀를 생각했으나 단순하게 점을 찍어가며 사각형이 확장되는 문제였다. 하나의 사각형이 네개로 쪼개지..

문제https://www.acmicpc.net/problem/1241풀이(15분)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 n = Integer.valueOf(br.readLine()); int[] numbers = new int[n + 1]; HashMap frequencyMap = new HashMap(); for (in..

문제https://softeer.ai/practice/7703풀이(11분)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 n = Integer.parseInt(br.readLine()); StringBuilder sb = new StringBuilder(); for (int i = 0; i = t.length()) { return..

문제https://www.acmicpc.net/problem/1041풀이(20분)import java.io.*;import java.util.*;public class Main { private static long n, oneFaceMin, twoFaceMin, threeFaceMin, maxFaceValue = 0; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); n = Integer.parseInt(br.readLine()); int[] faces = new in..

문제https://softeer.ai/practice/7628풀이(7분)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 n = Integer.parseInt(br.readLine()); int[] arr = new int[101]; // 100까지의 수를 저장 st = new StringTokenizer(br..

문제https://www.acmicpc.net/problem/1790풀이(42분)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 = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); // 자연수 범위 (1 ~ n) long k = Long.p..