목록백준공부 (648)
문제 풀이 및 개발 공간
[백준] 14431번 소수마을 (gold 3
import java.io.*;import java.util.*;class Point{ int index; int v; public Point(int index, int v){ this.index=index; this.v=v; }}public class Main{ public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); boolean[] artos=new boolean[9001]; //절댓값이 3000을 넘지 않으므로, 최대길이는 x 6000..
[백준] 2482번 색상환 (gold 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)); int n=Integer.valueOf(br.readLine()); int k=Integer.valueOf(br.readLine()); //나누는 수 int div=1000000003; //틀린 이유... 못구하는 케이스가 들어있다. if(k>n/2){ System.out.p..
[백준] 2109번 순회강연 (gold 3
import java.io.*;import java.util.*;class Point{ int day; int v; public Point(int day, int v){ this.day=day; this.v=v; }}public class Main{ static int[] num; public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int n=Integer.valueOf(br.readLine())..
[백준] 2352번 반도체 설계 (gold 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.valueOf(br.readLine()); int[] num=new int[n+1]; StringTokenizer st=new StringTokenizer(br.readLine()); for(int i=1; idp[end]){ dp[++end]=num[i]..
[백준] 1781번 컵라면 (gold 2
import java.io.*;import java.util.*;class Point{ int day; int value; public Point(int day, int value){ this.day=day; this.value=value; }}public class Main{ static int[] index; public static void main(String[] args) throws IOException{ BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; //우선순위큐로 큰 순서대로 뽑고..
[백준] 12100번 2048 (Easy (gold 2
import java.io.*;import java.util.*;class Point{ int x; int y; public Point(int x, int y){ this.x=x; this.y=y; }}public class Main{ static int[][] map; //원래 지도. static int[][] temp; //임시지도 static int[] num=new int[5]; //백트래킹. 5가지 방향 선택한 것. static int n; static int answer=Integer.MIN_VALUE; static Queue que=new LinkedList(); // 이동할 때 빈칸들 넣기. static i..