너T야? 나 T(story)야….

백준 2667 - Java

import java.util.*;public class BJ2667 { static int N; static int[][] map; static boolean[][] visited; static int[][] d = {{0, -1},{0, 1},{-1, 0},{1, 0}}; static List complexSizes; public static void main(String[] args) { insert(); bfs(); printf(); } public static void insert() { Scanner sc = new Scanner(System.in); N = sc.nextInt(); ..

import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class BJ1697 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int K = sc.nextInt(); boolean[] visited = new boolean[100001]; Queue queue = new LinkedList(); queue.add(new int[]{N, 0}); visited[N] = true; ..

import java.util.Scanner;public class BJ14889 { static int N; static int[][] S; static boolean[] visited; static int minDifference = Integer.MAX_VALUE; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); S = new int[N][N]; visited = new boolean[N]; for (int i = 0; i   백트래킹을 사용하는 문제이다 . 결과에 만족할 경우(depth ..

import java.util.Scanner;public class BJ2166 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); long[] x = new long[N]; long[] y = new long[N]; for (int i = 0; i

import java.io.*;import java.util.*;public class BJ1916 { //도시 , 비용 관련 Node 클래스 생성 static class Node implements Comparable { int city, cost; public Node(int city, int cost) { this.city = city; this.cost = cost; } @Override public int compareTo(Node o) { return this.cost - o.cost; } } public static void main(St..

import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class BJ1991 { static class Node { char data; Node left, right; Node(char data) { this.data = data; } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); BinaryTree tree = new BinaryTree(); for ..

import java.util.Scanner;public class BJ1629 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long A = sc.nextLong(); long B = sc.nextLong(); long C = sc.nextLong(); sc.close(); System.out.println(modularExponentiation(A, B, C)); } private static long modularExponentiation(long base, long exp, long mod) { if..

import java.util.Scanner;public class BJ16953 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long A = sc.nextInt(); long B = sc.nextInt(); int count = 1; while (B > A) { if (B % 10 == 1) { B /= 10; } else if (B % 2 == 0) { B /= 2; } else { System.ou..

import java.util.*;public class BJ15663 { static int N, M; static int[] Narr; static boolean[] visited; static List sequence; static Set resultSet; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); M = sc.nextInt(); Narr = new int[N]; visited = new boolean[N]; sequence = new ArrayList(); ..

import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class BJ11725 { static boolean[] visited; // 방문 여부를 체크할 배열 static ArrayList[] graph; // 인접 리스트로 그래프를 표현 static int[] parent; //노드의 부모 저장 public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); graph = new ArrayL..