Learn/Algorithm(34)
-
2178번 미로 탐색
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int[] dx = {0,0,1,-1}; static int[] dy =..
2020.02.04 -
1012 유기농 배추
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 import java.util.ArrayList; import java.util.Comparator; import java.util.Scanner; public class Main { static int[] dx = {0,0,1,-1}; static int[] dy = {1,-1,0,0}; static int test; static int cnt; static int Nor; static int M..
2020.02.04 -
2667 단지번호붙이기
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 package com.java.first; import java.util.ArrayList; import java.util.Comparator; import java.util.Scanner; public class Main { static int[] dx = {0,0,1,-1}; static int[] dy = {1,-1,0,0}; static int test; static int cnt; public static..
2020.02.04 -
1260 DFS 와 BFS - 백준
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int N ; static int M; static int V ; static int arr[][]; static int visi..
2020.02.04 -
14720 우유축제
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int ar[] = new int [1001]; int ar2[] = new int [1001]; boolean al = false; int cnt = 0; int temp = 0; int maxim = 0; for(int i = 0; i cs 예외처리..
2020.02.03 -
1003번 피보나치 함수
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 import java.util.Scanner; public class Main { static int ar1[] = new int [41]; static int ar2[] = new int [41]; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); ar1[0] = 1; ar1[1] = 0; ar2[0] = 0; ar2[1] = 1; for(int i = 2; i cs 그냥 피보나치 함수를 재귀로 구현하면 터지는 문제. 배열을 통해서 1출력배열과 0출력배열..
2020.02.03