본문 바로가기

코딩테스트(백준)

 (46)
[백준] 2606 : 바이러스 -JAVA(자바) - 사좋배 공유 import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int[][] arr; static boolean []visit; static Queue q = new LinkedList(); static int size; public static void main(String[] args) { arr= new int[101][101]; Scanner sc = new Scanner(System.in); size = sc.nextInt(); int number = sc.nextInt(); visit =new boolean[size+1]; for(int i=0;i
[백준] 11399 : ATM -JAVA - 사좋배 공유 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc= new Scanner(System.in); int number = sc.nextInt(); int[] arr= new int[number]; int [] temparr = new int[number]; int sum=0; int temp=0; for(int i=0;i
[백준] 9663 : N-Queen -JAVA - 사좋배 공유 import java.util.Scanner; public class Main { static int N; static int cnt; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); cnt=0; int[][]map = new int[N][N]; dfs(map,0); System.out.println(cnt); } static void dfs(int [][]map, int line) { if(line==N) { cnt++; return; } for(int i=0;i=0;i--) { if(map[i][column]==1) { return false; } } // 왼쪽 대각 검사 for..
[백준] 9093 : 단어 뒤집기 -JAVA - 사좋배 공유 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int number= Integer.parseInt(sc.nextLine()); String[] arr= new String[number]; for(int i=0;i
[백준] 8320 : 직사각형을 만드는 방법 -JAVA - 사좋배 공유 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc= new Scanner(System.in); int number =sc.nextInt(); int count=0; for(int i=1;i
[백준] 7576 : 토마토 -JAVA - 사좋배 공유 import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { //시계방향으로 돌아가기 static int dx[] = {1,0,-1,0}; static int dy[] = {0,1,0,-1}; static int arr[][]; static int M,N; static Queue q; private static void BFS() { while(!q.isEmpty()) { tomato t1= q.poll(); int x = t1.x; int y = t1.y; arr[x][y]=t1.count; for(int i=0;iarr[x][y]+1||arr[rx][ry]==0) { arr[rx][ry..
[백준] 6593 : 상범 빌딩 -JAVA - 사좋배 공유 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main { static int dx[]= {-1,0,1,0,0,0}; static int dy[] = {0,1,0,-1,0,0}; static int dh[]= {0,0,0,0,1,-1}; static char[][][]building; static boolean[][][] visit; static int L; static int R; static int C; s..
[백준] 4963 : 섬의 개수 -JAVA - 사좋배 공유 import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static int[][] arr; static int dx[]= {-1,-1,0,1,1,1,0,-1}; static int dy[]= {0,1,1,1,0,-1,-1,-1}; static int w,h; static int count; static Queue q; static int result; static boolean [][]visit; public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true) { w = sc.nextInt..

티스토리툴바